A Benchmark Method for the Propositional Modal Logics K, KT, S4
Journal of Automated Reasoning
Evaluating Optimized Decision Procedures for Propositional Modal K(m) Satisfiability
Journal of Automated Reasoning
Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
The description logic handbook
An Efficient Tableau Prover using Global Caching for the Description Logic ALC
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Hypertableau reasoning for description logics
Journal of Artificial Intelligence Research
Spartacus: A Tableau Prover for Hybrid Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Linkless normal form for ALC concepts and TBoxes
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
An Efficient Tableau Prover using Global Caching for the Description Logic ALC
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
The Tableaux 98 conference included a comparison of automated theorem provers for some modal logics. Our aim was to make the existing provers better known and to show what possibilities they offer. This comparison included benchmarks for the propositional modal logics K, KT and S4. Although effciency is an important aspect, depending on the intended application other qualities can be as important, such as portability, construction of counter-models, user-friendliness, or small size.We first discuss our aims in more detail, explain the applied benchmark method, and finally give a short summary of the results. The submissions of the participants follow in alphabetic order.