<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2013-07-29 01:10:58Automated theorem proving Boolean algebra NP-complete problems Constraint programming Logic in computer science Boolean satisfiability problem Davis–Putnam algorithm Satisfiability Unit propagation Theoretical computer science Mathematics Computational complexity theory |
Add to Reading List |
Artificial Intelligence ELSEVIER Artificial Intelligence[removed]345 | Compilation of Planning to SAT Yiqiao Wang 1 MotivationDocID: 15yug - View Document |
| A First-Order Davis-Putnam-Logemann-Loveland Procedure Peter Baumgartner + Some slides from "First Order Theorem Proving" TutorialDocID: 14SLy - View Document |
| A New Approach to Model Counting Wei Wei and Bart Selman Department of Computer Science Cornell University Ithaca, NY 14853DocID: 14pbM - View Document |
| Overview SAT Solving and its Relationship to CSPs ڗTremendous gains have been achieved over theDocID: 13DzJ - View Document |
| Enhancing Davis Putnam with Extended Binary Clause Reasoning Fahiem Bacchus Dept. Of Computer Science University Of Toronto Toronto, Ontario Canada, M5S 1A4DocID: 11Xfp - View Document |