The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic.
Cheng-Chia ChenI-Peng LinPublished in: Inf. Process. Lett. (1993)
Keyphrases
- computational complexity
- horn formulas
- propositional logic
- linear time temporal logic
- knowledge compilation
- np complete
- satisfiability testing
- linear temporal logic
- cnf formula
- satisfiability problem
- temporal reasoning
- temporal logic
- model checking
- temporal information
- first order logic
- sequent calculus
- decision procedures
- prime implicates
- np hard
- boolean formula
- prime implicants
- inference rules
- artificial intelligence