The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics.
Cheng-Chia ChenI-Peng LinPublished in: Theor. Comput. Sci. (1994)
Keyphrases
- horn clauses
- modal logic
- inference rules
- computational complexity
- propositional logic
- decision procedures
- nonmonotonic logics
- first order logic
- propositional variables
- np complete
- satisfiability problem
- cl pc
- temporal logic
- logic programs
- expressive power
- inductive logic programming
- default logic
- coalition logic
- truth values
- situation calculus
- computational properties
- database queries
- dynamic logic
- database
- bayesian networks
- machine learning