Communications of the ACM
A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Automated deduction in nonclassical logics
Automated deduction in nonclassical logics
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)
Theorem Proving via General Matings
Journal of the ACM (JACM)
JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Connections in nonclassical logics
Handbook of automated reasoning
Model elimination and connection tableau procedures
Handbook of automated reasoning
leanCoP: lean connection-based theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
Liberalized Variable Splitting
Journal of Automated Reasoning
Restricting backtracking in connection calculi
AI Communications - Practical Aspects of Automated Reasoning
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
Incremental variable splitting
Journal of Symbolic Computation
| Hi-index | 0.00 |
A non-clausal connection calculus for classical first-order logic is presented that does not require the translation of input formulae into any clausal form. The definition of clauses is generalized, which may now also contain (sub-) matrices. Copying of appropriate (sub-)clauses in a dynamic way, i.e. during the actual proof search, is realized by a generalized extension rule. Thus, the calculus combines the advantage of a non-clausal proof search in tableau calculi with the more efficient goal-oriented proof search of clausal connection calculi. Soundness, completeness, and (relative) complexity results are presented as well as some optimization techniques.