215 search results - page 2 / 43 » Connecting a Logical Framework to a First-Order Logic Prover |
TAP
2010
Springer
13 years 3 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
TABLEAUX
2000
Springer
13 years 9 months ago
2000
Springer
mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for ...
CSL
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
CADE
2007
Springer
14 years 6 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
JAR
2008
13 years 5 months ago
2008
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...