Clause Learning, Resolution Space, and Pebbling
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by Clause Learning. These solvers can handle many real-world problems from application areas like verification, diagnosis, planning, and design. Clause Learning works by storing previously computed, intermed...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_ca |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1807/16736 |