27 search results - page 1 / 6 » On the Evaluation of Indexing Techniques for Theorem Proving |
86
Voted
CADE
2001
Springer
15 years 5 months ago
2001
Springer
108
Voted
CADE
2009
Springer
16 years 1 months ago
2009
Springer
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...
115
Voted
IJCAI
2003
15 years 1 months ago
2003
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...
127
Voted
CADE
2005
Springer
16 years 22 days ago
2005
Springer
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...
136
click to vote
PLDI
2011
ACM
14 years 3 months ago
2011
ACM
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...