Communications of the ACM
A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Programming in Prolog
A Prolog technology theorem prover: implementation by an extended Prolog computer
Journal of Automated Reasoning
First-order logic and automated theorem proving
First-order logic and automated theorem proving
Automated deduction in nonclassical logics
Automated deduction in nonclassical logics
Relative complexities of first order calculi
Relative complexities of first order calculi
A Prolog technology theorem prover: a new exposition and implementation in Prolog
Theoretical Computer Science - Selected papers on theoretical issues of design and implementation of symbolic computation systems
SETHEO: a high-performance theorem prover
Journal of Automated Reasoning
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Mechanical Theorem-Proving by Model Elimination
Journal of the ACM (JACM)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Evaluating general purpose automated theorem proving systems
Artificial Intelligence
Journal of Automated Reasoning
Properties and Relations of Tableau and Connection Calculi
Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday)
T-String Unification: Unifying Prefixes in Non-classical Proof Methods
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
ileanTAP: An Intuitionistic Theorem Prover
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Uniform Proof Procedure for Classical and Non-Classical Logics
KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Proceedings of the 10th International Conference on Automated Deduction
leanTAP: Lean Tableau-Based Theorem Proving (Extended Abstract)
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Connections in nonclassical logics
Handbook of automated reasoning
Model elimination and connection tableau procedures
Handbook of automated reasoning
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
leanCoP: lean connection-based theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
The design and implementation of VAMPIRE
AI Communications - CASC
AI Communications - CASC
The ILTP Problem Library for Intuitionistic Logic
Journal of Automated Reasoning
The 4th IJCAR Automated Theorem Proving System Competition - CASC-J4
AI Communications
Clausal connection-based theorem proving in intuitionistic first-order logic
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Specifying and verifying organizational security properties in first-order logic
Verification, induction termination analysis
Specifying and verifying organizational security properties in first-order logic
Verification, induction termination analysis
A non-clausal connection calculus
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
MaLeCoP: machine learning connection prover
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Hi-index | 0.00 |
Connection calculi benefit from a goal-oriented proof search, but are in general not proof confluent. A substantial amount of backtracking is required, which significantly affects the time complexity of the proof search. This paper presents a simple strategy for effectively restricting backtracking in connection calculi. In combination with a few basic techniques it provides the basis for a refined connection calculus. The paper also describes how this calculus can be implemented directly by a few lines of Prolog code. This very compact program is the core of an enhanced version of the automated theorem prover leanCoP. The performance of leanCoP is compared with other lean theorem provers, connection provers, and state-of-the-art theorem provers. The results show that restricted backtracking is a successful technique when performing proof search in connection calculi.