Journal of Logic Programming
First steps in modal logic
Abductive planning with sensing
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
First-order modal logic
A Benchmark Method for the Propositional Modal Logics K, KT, S4
Journal of Automated Reasoning
Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A General Theorem Prover for Quantified Modal Logics
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Types, Tableaus, and Godel's God
Types, Tableaus, and Godel's God
A transition logic for schemata conflicts
Data & Knowledge Engineering
The ILTP Problem Library for Intuitionistic Logic
Journal of Automated Reasoning
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
A new general method to generate random modal formulae for testing decision procedures
Journal of Artificial Intelligence Research
EQL-lite: effective first-order query processing in description logics
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
The 5th IJCAR automated theorem proving system competition - CASC-J5
AI Communications
Reducing higher-order theorem proving to a sequence of SAT problems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Hi-index | 0.00 |
The Quantified Modal Logic Theorem Proving (QMLTP) library provides a platform for testing and evaluating automated theorem proving (ATP) systems for first-order modal logics. The main purpose of the library is to stimulate the development of new modal ATP systems and to put their comparison onto a firm basis. Version 1.1 of the QMLTP library includes 600 problems represented in a standardized extended TPTP syntax. Status and difficulty rating for all problems were determined by running comprehensive tests with existing modal ATP systems. In the presented version 1.1 of the library the modal logics K, D, T, S4 and S5 with constant, cumulative and varying domains are considered. Furthermore, a small number of problems for multi-modal logic are included as well.