First-order logic and automated theorem proving
First-order logic and automated theorem proving
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Ordered Tableaux: Extensions and Applications
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Hyper Tableau - The Next Generation
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Strategies in rigid-variable methods
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Ordered semantic hyper linking
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
DCTP - A Disconnection Calculus Theorem Prover - System Abstract
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Incremental Closure of Free Variable Tableaux
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Logical Engineering with Instance-Based Methods
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
| Hi-index | 0.00 |
This work is concerned with basic issues of the design of calculi and proof procedures for first-order connection methods and tableaux calculi. Proof procedures for these type of calculi developed so far suffer from not exploiting proof confluence, and very often unnecessarily rely on a heavily backtrack oriented control regime. As a new result, we present a variant of a connection calculus and prove its strong completeness. This enables the design of backtrack-free control regimes. To demonstrate that the underlying fairness condition is reasonably implementable we define an effective search strategy.