Seventy-five problems for testing automatic theorem provers
Journal of Automated Reasoning
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Efficient Loop-Check for Backward Proof Search in Some Non-classical Propositional Logics
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Comparison of Theorem Provers for Modal Logics - Introduction and Summary
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Propositional Logics on the Computer
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
On the Modal Logic K Plus Theories
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
KT and S4 Satisfiability in a Constraint Logic Environment
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Hypertableau reasoning for description logics
Journal of Artificial Intelligence Research
Spartacus: A Tableau Prover for Hybrid Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
The 5th IJCAR automated theorem proving system competition - CASC-J5
AI Communications
The second QBF solvers comparative evaluation
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A branching heuristics for quantified renamable horn formulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Herod and pilate: two tableau provers for basic hybrid logic
IJCAR'10 Proceedings of the 5th international 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
InKreSAT: modal reasoning via incremental reduction to SAT
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
A lot of methods have been proposed – and sometimes implemented – for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of these methods in practice, since in most cases no or only a few execution times have been published. We try to improve this unsatisfactory situation by presenting a set of benchmark formulas. Note that we do not just list formulas, but give a method that allows us to compare different provers today and in the future. As a starting point we give the results we obtained when we applied this benchmark method to the Logics Workbench (LWB). We hope that the discussion of postulates concerning ATP benchmark helps to obtain improved benchmark methods for other logics, too.