Clausal connection-based theorem proving in intuitionistic first-order logic

Authors:
Jens Otten
Affiliations:
Institut für Informatik, University of Potsdam, Potsdam-Babelsberg, Germany
Venue:
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Year:
2005

Citing 23
Cited 8

Matings in matrices

Communications of the ACM
Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
First-order logic and automated theorem proving

First-order logic and automated theorem proving
Automated deduction in nonclassical logics

Automated deduction in nonclassical logics
SETHEO: a high-performance theorem prover

Journal of Automated Reasoning
Mechanical Theorem-Proving by Model Elimination

Journal of the ACM (JACM)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
The TPTP Problem Library

Journal of Automated Reasoning
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
linTAP: A Tableau Prover for Linear Logic

TABLEAUX '99 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
leanTAP: Lean Tableau-Based Theorem Proving (Extended Abstract)

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
A Resolution Theorem Prover for Intuitonistic Logic

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Converting Non-Classical Matrix Proofs into Sequent-Style Systems

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Connection-Based Proof Construction in Linear Logic

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Encoding two-valued nonclassical logics in classical logic

Handbook of 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
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
The ILTP library: benchmarking automated theorem provers for intuitionistic logic

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods

The CADE-21 automated theorem proving system competition

AI Communications
A Labelled System for IPL with Variable Splitting

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Proof Search for the First-Order Connection Calculus in Maude

Electronic Notes in Theoretical Computer Science (ENTCS)
Restricting backtracking in connection calculi

AI Communications - Practical Aspects of Automated Reasoning
A non-clausal connection calculus

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
The ILTP library: benchmarking automated theorem provers for intuitionistic logic

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Research perspectives for logic and deduction

Reasoning, Action and Interaction in AI Theories and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a clausal connection calculus for first-order intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the characteristics of intuitionistic logic. Our calculus is based on a clausal matrix characterisation for intuitionistic logic, which we prove correct and complete. The calculus was implemented by extending the classical prover leanCoP. We present some details of the implementation, called ileanCoP, and experimental results.