3-SAT = SAT for a class of normal modal logics
From MaRDI portal
Publication:673009
DOI10.1016/0020-0190(95)00060-PzbMath0875.68762OpenAlexW2028506047MaRDI QIDQ673009
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00060-p
Cites Work
- Proof methods for modal and intuitionistic logics
- Modal resolution in clausal form
- Application of modal logic to programming
- A guide to completeness and complexity for modal logics of knowledge and belief
- The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
- New foundations for Lewis modal systems
- A note on the complexity of the satisfiability of modal Horn clauses
- Methods for Automated Theorem Proving in Nonclassical Logics
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- An incompleteness theorem in modal logic
- A normal modal calculus between T and S4 without the finite model property
- The complexity of theorem-proving procedures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
