Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard?
Bartosz BednarczykStéphane DemriPublished in: CoRR (2021)
Keyphrases
- temporal logic
- modal logic
- model checking
- transition systems
- default logic
- mazurkiewicz traces
- decision trees
- nonmonotonic logics
- modal operators
- predicate logic
- concurrent systems
- belief revision
- default theories
- satisfiability problem
- tree structure
- linear temporal logic
- propositional logic
- formal specification
- temporal resolution
- temporal knowledge
- bounded model checking
- computation tree logic