First-order theorem proving with Theories
Automated Theorem Proving with Extensions of First-Order Logic
... of first-order theorem provers might be ...in first- order logic in a way that is efficient for automated ...on first-order provers, such as program verification tools and ...
170
Theorem recycling for Theorem Proving
... In this paper we examine two cases where solutions to one system of constraints can be used or adapted to solutions to others, for free. We first revisit a method by Bromberger for lifting solutions to systems ...
8
Symmetric Temporal Theorem Proving
... we first present a naive GuessedLoopTemplate algo- rithm that enumerates possible loop templates that follow from the current loop template obtained by the GroupFormulae .... First, it can potentially ...
37
Cryptographically Sound Theorem Proving
... ways. First, it provides messages with a simple inductive structure that enables standard structural ...Isabelle/HOL theories to this term-based setting. The equational theories associated with these ...
23
The PIE Environment for First-Order-Based Proving, Interpolating and Eliminating
... automated first-order theorem proving techniques, in examples, experiments, benchmarks, and as background machinery in other ...applying first-order proving techniques is ...
14
CiteSeerX — Theorem Proving with the Real Numbers
... for theorem proving techniques in veri cation has been ...to theories of elementary analysis that a truly integrated mechanical proof of algorithms for the transcendental functions becomes ...
157
Theorem Proving for Maude's Rewriting Logic
... should be formulas of membership equational logic (that Maude can also understand). This may sometimes lead to awkward formulations, for instance, the inability to deal with exis- tential quantifiers imposes to replace ...
48
CiteSeerX — The Philosophy of Automated Theorem Proving
... It has been incorporated into T H I N K E R with some considerable success for standard modal systems. Of course, to use the semantic method correctly one must know what the correct underlying logic of the abstract ...
7
Undecidable First-Order Theories of Affine Geometries
... investigate first-order theories of classes of the type { (S, β, (P i ) i ∈N ) | P i ⊆ S }, where S ⊆ R n and β is the restriction of the betweenness relation of R n to the set S ...
17
Alternating Automata Modulo First Order Theories
... introduce first-order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first- order formulae, with states and ...
18
Proving Safety Properties of Rewrite Theories
... rewrite theories treated in this paper satisfy the follow- ing executability conditions; these conditions guarantee agreement between the equational semantics and the operational semantics obtained by ...
29
Deductive Program Analysis with First-Order Theorem Provers
... Automated theorem provers can be used to reason about all sorts of mathematical questions, and they are particularly well suited to problems of program verification, which often require proving a very large ...
32
leanCoP: lean connection-based theorem proving
... yields an astonishing performance, in particular for Horn problems without equality. We ran leanCoP on a subset of the TPTP library and compared its performance with the resolution-based prover O TTER , the ...
23
CiteSeerX — Automated theorem proving in loop theory
... the first to use automated theorem provers in loop theory and, in fact, one of the first noneasy results in mathematics obtained ...The theorem says that a quasigroup satisfying any one of the ...
13
Applications of real number theorem proving in PVS
... higher order theorem provers applied to problem domains such as real number theorem ...a theorem prover as a back-end to another tool, such as Maple in the application NRV, provides a way to ...
24
The complexity of theorem proving in circumscription and minimal entailment
... 1 Introduction Circumscription is one of the main formalisms for non-monotonic reasoning. It uses reasoning with minimal models, the key idea being that minimal models have as few exceptions as possible. Therefore ...
16
Data Model Verification via Theorem Proving
... In order to isolate the effect of the axioms on the overall deduction process, we also verified all actions using the conjecture ...the theorem prover handles coexecution vs sequential execution of nested ...
161
Computational Thinking: Students On Proving Geometry Theorem
... intersects at P exactly as done in the first triangle, but in the second ABC triangle, point P is outside the triangle. The results of construction are presented in Figure 2. below. Figure 2. Perpendicular ...
8
Another Look at Automated Theorem-Proving. II
... A pedagogical digression. Some mathematicians have argued that the removal of rigorous proofs from the teaching of most elementary math courses — such as first-year calculus — in American universities was a mis- ...
18
Introduction to Automated Theorem Proving. Tudor Jebelean
... This theorem shows the remarkable fact that for proving in first order logic it is enough to reason about ground ...The theorem also suggests a procedure for proving: we ...
26