The ILTP Problem Library for Intuitionistic Logic

Authors:
Thomas Raths;Jens Otten;Christoph Kreitz
Affiliations:
Institut für Informatik, University of Potsdam, Potsdam, Germany D-14482;Institut für Informatik, University of Potsdam, Potsdam, Germany D-14482;Institut für Informatik, University of Potsdam, Potsdam, Germany D-14482
Venue:
Journal of Automated Reasoning
Year:
2007

Citing 0
Cited 18

Improvements to the Tableau Prover PITP

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4

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
Optimization techniques for propositional intuitionistic logic and their implementation

Theoretical Computer Science
Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Progress in the Development of Automated Theorem Proving for Higher-Order Logic

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
The TPTP Problem Library and Associated Infrastructure

Journal of Automated Reasoning
Restricting backtracking in connection calculi

AI Communications - Practical Aspects of Automated Reasoning
Automating theories in intuitionistic logic

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus

Information Sciences: an International Journal
FCUBE: an efficient prover for intuitionistic propositional logic

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Simplification Rules for Intuitionistic Propositional Tableaux

ACM Transactions on Computational Logic (TOCL)
Refutation in dummett logic using a sign to express the truth at the next possible world

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Truthful monadic abstractions

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
BDD-based automated reasoning for propositional bi-intuitionistic tense logics

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
The QMLTP problem library for first-order modal logics

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
An improved BDD method for intuitionistic propositional logic: BDDIntKt system description

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Intuitionistic Logic Theorem Proving (ILTP) library provides a platform for testing and benchmarking automated theorem proving (ATP) systems for intuitionistic propositional and first-order logic. It includes about 2,800 problems in a standardized syntax from 24 problem domains. For each problem an intuitionistic status and difficulty rating were obtained by running comprehensive tests of currently available intuitionistic ATP systems on all problems in the library. Thus, for the first time, the testing and evaluation of ATP systems for intuitionistic logic have been put on a firm basis.