Sciweavers

27 search results - page 1 / 6
» On the Evaluation of Indexing Techniques for Theorem Proving
Sort
View
CADE
2001
Springer
13 years 9 months ago
On the Evaluation of Indexing Techniques for Theorem Proving
Robert Nieuwenhuis, Thomas Hillenbrand, Alexandre ...
CADE
2009
Springer
14 years 5 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning
IJCAI
2003
13 years 6 months ago
Practical Partition-Based Theorem Proving for Large Knowledge Bases
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
Bill MacCartney, Sheila A. McIlraith, Eyal Amir, T...
CADE
2005
Springer
14 years 4 months ago
Tabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
Brigitte Pientka
PLDI
2011
ACM
12 years 7 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...