Reusing Search Tree for Incremental SAT Solving of Temporal Induction.
Liangze YinFei HeMin ZhouMing GuPublished in: ICECCS (2013)
Keyphrases
- sat solving
- search tree
- sat solvers
- boolean satisfiability
- sat problem
- search space
- search algorithm
- symmetry breaking
- orders of magnitude
- temporal constraints
- propositional satisfiability
- b tree
- iterative deepening
- branch and bound algorithm
- max sat
- search strategies
- constraint satisfaction
- heuristic function
- sat instances
- domain independent
- information retrieval
- information retrieval systems
- clause learning
- upper bound
- temporal planning
- sat encodings
- special case