A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
On the complexity of epistemic reasoning
Proceedings of the Fourth Annual Symposium on Logic in computer science
Minimizing the number of clauses by renaming
CADE-10 Proceedings of the tenth international conference on Automated deduction
Reasoning about knowledge
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
An algorithm to evaluate quantified Boolean formulae
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Ideal and Real Belief about Belief
FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning
Strongly Analytic Tableaux for Normal Modal Logics
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
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
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
On evaluating decision procedures for modal logic
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
ACM Transactions on Computational Logic (TOCL)
A Subset-Matching Size-Bounded Cache for Testing Satisfiability in Modal Logics
Annals of Mathematics and Artificial Intelligence
Labelled Tableaux for Non-normal Modal Logics
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
A New System and Methodology for Generating Random Modal Formulae
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
The description logic handbook
The SAT-based Approach to Separation Logic
Journal of Automated Reasoning
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Continuous time in a SAT-based planner
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Semantical considerations on dialectical and practical commitments
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A new general method to generate random modal formulae for testing decision procedures
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Spartacus: A Tableau Prover for Hybrid Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Building efficient decision procedures on top of SAT solvers
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Knowledge acquisition: Past, present and future
International Journal of Human-Computer Studies
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Propositional temporal proving with reductions to a SAT problem
CADE'13 Proceedings of the 24th international conference on Automated Deduction
InKreSAT: modal reasoning via incremental reduction to SAT
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
We present a set of SAT-based decision procedures for various classical modal logics. By SAT based, we mean built on top of a SAT solver. We show how the SAT-based approach allows for a modular implementation for these logics. For some of the logics we deal with, we are not aware of any other implementation. For the others, we define a testing methodology that generalizes the 3CNFiK methodology by Giunchiglia and Sebastiani. The experimental evaluation shows that our decision procedures perform better than or as well as other state-of-the-art decision procedures.