Abstract
We analyze the complexity of optimization problems expressed using valued constraints. This very general framework includes a number of well-known optimization problems such as MAX-SAT, and WEIGHTED MAX-SAT, as well as properly generalizing the classical CSP framework by allowing the expression of preferences. We focus on valued constraints over Boolean variables, and we establish a dichotomy theorem which characterizes the complexity of any problem involving a fixed set of constraints of this kind. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Cohen, D., Cooper, M., & Jeavons, P. (2004). A complete characterization of complexity for Boolean constraint optimization problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3258, 212–226. https://doi.org/10.1007/978-3-540-30201-8_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
