183 search results - page 2 / 37 » Automated theorem proving by resolution in non-classical log... |
CADE
1998
Springer
14 years 25 days ago
1998
Springer
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
CADE
2009
Springer
14 years 9 months ago
2009
Springer
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...
KI
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In recent years there has been a growing demand for Automated Theorem Proving (ATP) in large theories, which often have more axioms than can be handled effectively as no...
IJCAI
2003
13 years 10 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...
LPAR
2004
Springer
14 years 1 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...