leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)

Authors:
Jens Otten
Affiliations:
Institut für Informatik, University of Potsdam, Potsdam-Babelsberg, Germany 14482
Venue:
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Year:
2008

Citing 19
Cited 4

Matings in matrices

Communications of the ACM
A Prolog technology theorem prover: implementation by an extended Prolog computer

Journal of Automated Reasoning
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)
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
KoMeT

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
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
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
MPTP 0.2: Design, Implementation, and Initial Experiments

Journal of Automated Reasoning
The ILTP Problem Library for Intuitionistic Logic

Journal of Automated Reasoning
The CADE-21 automated theorem proving system competition

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
MaLeCoP: machine learning connection prover

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
A proof-search procedure for intuitionistic propositional logic

Archive for Mathematical Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

leanCoPis a very compact theorem prover for classical first-order logic, based on the connection (tableau) calculus and implemented in Prolog. leanCoP 2.0enhances leanCoP1.0by adding regularity, lemmata, and a technique for restricting backtracking. It also provides a definitional translation into clausal form and integrates "Prolog technology" into a lean theorem prover. ileanCoPis a compact theorem prover for intuitionistic first-order logic and based on the clausal connection calculus for intuitionistic logic. leanCoP 2.0extends the classical prover leanCoP 2.0by adding prefixes and a prefix unification algorithm. We present details of both implementations and evaluate their performance.