HARP: a tableau-based theorem prover
Journal of Automated Reasoning
Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results
Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Beyond NP: the QSAT phase transition
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Artificial Intelligence
A machine program for theorem-proving
Communications of the ACM
Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning 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
A Concept Language Extended with Different Kinds of Transitive Roles
KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Terminological Knowledge Representation System with Complete Inference Algorithms
PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
Optimising Propositional Modal Satisfiability for Description Logic Subsumption
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Tableaux and Algorithms for Propositional Dynamic Logic with Converse
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
The complexity of automated reasoning
The complexity of automated reasoning
On evaluating decision procedures for modal logic
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
A new general method to generate random modal formulae for testing decision procedures
Journal of Artificial Intelligence Research
JustBench: a framework for OWL benchmarking
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Performance heterogeneity and approximate reasoning in description logic ontologies
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
| Hi-index | 0.00 |
Heavily optimized decision procedures for propositional modal satisfiability are now becoming available. Two systems incorporating such procedures for modal K, DLP and KSATC, are tested on randomly generated CNF formulae with several sets of parameters, varying the maximum modal depth and ratio of propositional variable to modal subformulae. The results show some easy-hard-easy behavior, but there is as yet no sharp peak as in propositional satisfiability.