DMCA
Propositional Satisfiability and Constraint Programming: a Comparative Survey (2006)
Cached
Download Links
- [research.microsoft.com]
- [research.microsoft.com]
- [cse.unl.edu]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Computing Surveys |
| Citations: | 38 - 4 self |
BibTeX
@MISC{Bordeaux06propositionalsatisfiability,
author = {Lucas Bordeaux and Youssef Hamadi and Lintao Zhang},
title = {Propositional Satisfiability and Constraint Programming: a Comparative Survey},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two relatively independent threads of research, cross-fertilising occasionally. These two approaches to problem solving have a lot in common, as evidenced by similar ideas underlying the branch and prune algorithms that are most successful at solving both kinds of problems. They also exhibit differences in the way they are used to state and solve problems, since SAT’s approach is in general a black-box approach, while CP aims at being tunable and programmable. This survey overviews the two areas in a comparative way, emphasising the similarities and differences between the two and the points where we feel that one technology can benefit from ideas or experience acquired
