Sciweavers

491 search results - page 31 / 99
» An Interpolating Theorem Prover
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
ECAI
2000
Springer
14 years 1 months ago
Tree-based Heuristics in Modal Theorem Proving
We use a strong form of the tree model property to boost the performance of resolution-based first-order theorem provers on the so-called relational translations of modal formulas...
Carlos Areces, Rosella Gennari, Juan Heguiabehere,...
CADE
2009
Springer
14 years 9 months ago
Progress in the Development of Automated Theorem Proving for Higher-Order Logic
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of first-ord...
Chad E. Brown, Christoph Benzmüller, Frank Th...
CADE
2007
Springer
14 years 2 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak
CADE
2001
Springer
14 years 9 months ago
JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expre...
Stephan Schmitt, Lori Lorigo, Christoph Kreitz, Al...