Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?
Bartosz BednarczykStéphane DemriPublished in: Log. Methods Comput. Sci. (2022)
Keyphrases
- temporal logic
- modal logic
- default logic
- model checking
- transition systems
- mazurkiewicz traces
- satisfiability problem
- propositional logic
- inference rules
- concurrent systems
- nonmonotonic logics
- decision trees
- first order logic
- temporal knowledge
- modal operators
- linear temporal logic
- belief revision
- default theories
- computation tree logic
- coalition logic
- propositional variables
- verification method
- bounded model checking
- epistemic logic
- predicate logic
- situation calculus
- finite state
- reactive systems
- natural language