SAT-based unbounded symbolic model checking.
Hyeong-Ju KangIn-Cheol ParkPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2005)
Keyphrases
- symbolic model checking
- planning domains
- model checking
- partial observability
- planning problems
- ai planning
- conformant planning
- answer set programming
- formal verification
- model checker
- sat solvers
- symbolic representation
- orders of magnitude
- constraint solver
- binary decision diagrams
- domain independent
- description language
- data structure
- heuristic search
- formal specification
- search strategies
- state space
- search algorithm