Examining the Satisfiability of Formulas of Propositional Dynamic Logic.
Tomasz JanowskiPublished in: STACS (1989)
Keyphrases
- propositional dynamic logic
- cnf formula
- propositional formulas
- conjunctive normal form
- reasoning about actions
- boolean formula
- dynamic logic
- satisfiability problem
- np complete
- propositional logic
- terminological reasoning
- phase transition
- normal form
- computational complexity
- decision procedures
- random sat
- sat problem
- partial order
- reasoning problems
- constraint satisfaction problems
- sat encodings
- mathematical formulas
- artificial intelligence
- machine learning