Unification under a mixed prefix
Journal of Symbolic Computation
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
Computing answers with model elimination
Artificial Intelligence
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Full First-Order Free Variable Sequents and Tableaux in Implicit Induction
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Non-elementary Speedups between Different Versions of Tableaux
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
The Even More Liberalized delta-Rule in Free Variable Semantic Tableaux
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
On Notions of Inductive Validity for First-Oder Equational Clauses
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Abstract Notions and Inference Systems for Proofs by Mathematical Induction
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
Full First-Order Free Variable Sequents and Tableaux in Implicit Induction
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
| Hi-index | 0.00 |
. We present a combination of raising, explicit variable dependency representation, the liberalized δ-rule, and preservation of solutions for first-order deductive theorem proving. Our main motivation is to provide the foundation for our work on inductive theorem proving.