Finite-Valued Lukasiewicz Modal Logic Is PSPACE-Complete.
Félix BouMarco CeramiFrancesc EstevaPublished in: IJCAI (2011)
Keyphrases
- modal logic
- pspace complete
- temporal logic
- model checking
- coalition logic
- satisfiability problem
- np complete
- inference rules
- decision procedures
- decision problems
- strips planning
- finite state
- classical logic
- default logic
- situation calculus
- nonmonotonic logics
- dynamic logic
- prime implicates
- tree automata
- constraint satisfaction problems
- special case
- logical framework
- phase transition
- finite automata
- truth values
- sufficient conditions
- np hard