Propositional Satisfiability and Constraint Programming: A comparative survey Export

@article{citeulike:1320012, abstract = {Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two relatively independent threads of research cross-fertilizing 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, emphasizing the similarities and differences between the two and the points where we feel that one technology can benefit from ideas or experience acquired from the other.}, address = {New York, NY, USA}, author = {Bordeaux, Lucas and Hamadi, Youssef and Zhang, Lintao}, citeulike-article-id = {1320012}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1177354}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1177352.1177354}, doi = {10.1145/1177352.1177354}, issn = {0360-0300}, journal = {ACM Comput. Surv.}, keywords = {constraint, programming, sat, solver}, number = {4}, pages = {12+}, posted-at = {2007-06-04 16:00:40}, priority = {3}, publisher = {ACM}, title = {Propositional Satisfiability and Constraint Programming: A comparative survey}, url = {http://dx.doi.org/10.1145/1177352.1177354}, volume = {38}, year = {2006} }

TY - JOUR ID - citeulike:1320012 L3 - citeulike-article-id:1320012 N2 - Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two relatively independent threads of research cross-fertilizing 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, emphasizing the similarities and differences between the two and the points where we feel that one technology can benefit from ideas or experience acquired from the other. IS - 4 JF - ACM Comput. Surv. SN - 0360-0300 AD - New York, NY, USA TI - Propositional Satisfiability and Constraint Programming: A comparative survey PB - ACM VL - 38 SP - 12 KW - constraint KW - programming KW - sat KW - solver AU - Bordeaux, Lucas AU - Hamadi, Youssef AU - Zhang, Lintao PY - 2006/// UR - http://dx.doi.org/10.1145/1177352.1177354 ER -