A note on the complexity of the satisfiability of modal Horn clauses
- 31 March 1987
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 4 (1) , 1-10
- https://doi.org/10.1016/0743-1066(87)90018-5
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- MOLOG: A system that extends PROLOG with modal logicNew Generation Computing, 1986
- The Computational Complexity of Provability in Systems of Modal Propositional LogicSIAM Journal on Computing, 1977
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- Semantical Analysis of Modal Logic I Normal Modal Propositional CalculiMathematical Logic Quarterly, 1963