The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete.
Martin MundhenkFelix WeißPublished in: STACS (2011)
Keyphrases
- model checking
- model checker
- intuitionistic logic
- pspace complete
- temporal logic
- formal verification
- formal specification
- formal methods
- coalition logic
- description language
- finite state machines
- classical logic
- propositional logic
- linear logic
- default reasoning
- ai planning
- binary decision diagrams
- satisfiability problem
- modal logic
- normal form
- artificial intelligence