• No results found

Automated theorem-proving

CiteSeerX — The Philosophy of Automated Theorem Proving

CiteSeerX — The Philosophy of Automated Theorem Proving

... an automated theorem proving system, you might be impatient to k n o w at this ...of automated theorem proving have a coherent ...of automated theorem p r o v i n g ...

7

Automated Theorem Proving with Extensions of First-Order Logic

Automated Theorem Proving with Extensions of First-Order Logic

... The work presented in the thesis addresses this challenge by developing an extension of first-order logic named FOOL. FOOL contains syntactical features of programming languages and more expressive logics, is friendly ...

170

Prover-independent Axiom Selection for Automated Theorem Proving in Ontohub

Prover-independent Axiom Selection for Automated Theorem Proving in Ontohub

... Automatically proving prop- erties in such theories is an important task in research as well as in industry, for instance, as part of system ...mated theorem provers struggle finding proofs when there are ...

13

CiteSeerX — Automated theorem proving in loop theory

CiteSeerX — Automated theorem proving in loop theory

... was originally derived as a series of results, a number of steps eventually leading to the main theorem. In our study, Waldmeister proved it from scratch in 40 minutes. To state the obvious: some theorems will be ...

13

Automated theorem-proving in non-classical logics

Automated theorem-proving in non-classical logics

... debate will be to present several problems from logic that can be solved using a relevant ATP system employing proof procedures that we develop explicitly to handle relevant log[r] ...

196

Another  Look  at  Automated  Theorem-Proving.  II

Another Look at Automated Theorem-Proving. II

... a theorem, which goes back to the ancient Greeks, has been a central paradigm in theoretical mathematics, and more recently in certain branches of applied mathematics as ...

18

Introduction to Automated Theorem Proving. Tudor Jebelean

Introduction to Automated Theorem Proving. Tudor Jebelean

... This proving procedure is not e fficient: resolution is more efficient because it finds (by unifica- tion) the instances which are more likely to lead to ...Herbrand theorem is important because it is a ...

26

Automated theorem proving for mathematics : real analysis in PVS

Automated theorem proving for mathematics : real analysis in PVS

... JUDGEMENT exp(f: [ T -> re a l ]) HAS.TYPE real.fu n . o p s[T ]. p o s fu n Given our development of transcendental functions (Section 5) most of the judgements have quite simple proofs as they correspond closely to ...

169

Aspects of the theory of containers within automated theorem proving

Aspects of the theory of containers within automated theorem proving

... ∀n i. i < u n → i < v n → f n i = g n i, is a formula within Presburger arithmetic, which we know is decidable. Remark 6.10. The piecewise-linear interpretation of reindexing maps shown in the proof of ...

120

Brigitte Pientka. Programming Languages, Verification, Automated Theorem Proving, Logical Frameworks, Logic, Type Theory, Logic Programming

Brigitte Pientka. Programming Languages, Verification, Automated Theorem Proving, Logical Frameworks, Logic, Type Theory, Logic Programming

... [8] Brigitte Pientka and Frank Pfenning. Termination and reduction checking in the logical framework. In C. Sch¨ urmann, editor, Workshop on Automation of Proofs by Mathematical Induction, Pittsburgh, USA, 2000. [9] ...

7

Symmetric Temporal Theorem Proving

Symmetric Temporal Theorem Proving

... Automated theorem proving is a collection of techniques to deal with mathematical theorems using a computer ...consider automated temporal theorem proving, focusing on an ...

37

Evaluating reasoning heuristics for a hybrid theorem proving platform

Evaluating reasoning heuristics for a hybrid theorem proving platform

... resolution-based automated theorem proving, their set-theoretic nature lends itself to evaluation with other automated ...hybrid theorem proving environment, namely the Rodin ...

251

Automated Geometry Theorem Proving for Human-Readable Proofs

Automated Geometry Theorem Proving for Human-Readable Proofs

... We have realized our approach as a new automated ge- ometry theorem prover, iGeoTutor and extensively evaluated it. Our problem corpus has 77 problems in total, including ones cited in prior work and from ...

7

Theorem recycling for Theorem Proving

Theorem recycling for Theorem Proving

... editors, Automated Reasoning - 8th International Joint Con- ference, IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings, volume 9706 of Lecture Notes in Computer Science, pages ...

8

A Machine Program For Theorem-Proving

A Machine Program For Theorem-Proving

... Detroit 1, Michigan MINNESOTA Department of Mathematics Folwell Hall University of Minnesota Minneapolis, Minnesota Department of Mathematics Institute of Technology Engineering Building[r] ...

40

Cryptographically  Sound  Theorem  Proving

Cryptographically Sound Theorem Proving

... a theorem prover and without sacrificing the strong soundness guarantees? The main obstacle for an efficient mechanization is the complex state space, which in- cludes message buffers, references to messages via ...

23

Proving The Pythagorean Theorem Worksheet

Proving The Pythagorean Theorem Worksheet

... This theorem in a hands on the theorem word problems and its content and high school homework help to work on the resource freely available and b squared? Zhao Shuang wrote his commentaries on Zhou Bi Suan ...

8

CiteSeerX — Theorem Proving with the Real Numbers

CiteSeerX — Theorem Proving with the Real Numbers

... and Automated Reasoning groups at the Computer Laboratory in Cambridge, have provided a friendly and stimulating ...in theorem proving and veri cation, Thomas Forster taught me a lot about logic and ...

157

The complexity of theorem proving in autoepistemic logic

The complexity of theorem proving in autoepistemic logic

... Abstract. Autoepistemic logic is one of the most successful formalisms for nonmonotonic reasoning. In this paper we provide a proof-theoretic analysis of sequent calculi for credulous and sceptical reasoning in propo- ...

14

Lecture 8: Resolution theorem-proving

Lecture 8: Resolution theorem-proving

... • Suppose we take a set C of clauses in the 1-variable fragment, and keep applying resolution and factoring to them. • Obviously, only clauses featuring the signature of C will be genera[r] ...

36

Show all 10000 documents...

Related subjects