Abstract
Many tasks in automated reasoning can be modeled as weighted constraint satisfaction problems over Boolean variables (Boolean WCSPs). Tractable classes of such problems have traditionally been identified by exploiting either: (a) the topology of the associated constraint network, or (b) the structure of the weighted constraints. In this paper, we introduce the notion of a constraint composite graph (CCG) associated with a given (Boolean) WCSP. The CCG provides a unifying framework for characterizing/exploiting both the graphical structure of the constraint network as well as the structure of the weighted constraints. We show that a given (Boolean) WCSP can be reduced to the problem of computing the minimum weighted vertex cover for its associated CCG; and we establish the following two important results: (1) “the CCG of a given Boolean WCSP has the same treewidth as its associated constraint network,” and (2) “many classes of Boolean WCSPs that are tractable by virtue of the structure of their weighted constraints have associated CCGs that are bipartite in nature.”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Billionnet, A., Minoux, M.: Maximizing a Supermodular Pseudo-Boolean Function: A Polynomial Algorithm for Supermodular Cubic Functions. Disc. Appl. Math. (1985)
Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison. Over-Constrained Systems (1996)
Boros, E., Hammer, P.: Pseudo-Boolean Optimization. Disc. Appl. Math (2002)
Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., Poole, D.: CP-nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements. J. Artif. Intell. Res. (JAIR) 21, 135–191 (2004)
Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications (2001)
Dechter, R.: Constraint Networks (Survey). Encyclopedia of Artificial Intelligence (1992)
Do, M., Benton, J., van den Briel, M., Kambhampati, S.: Planning with Goal Utility Dependencies. In: IJCAI 2007 (2007)
Hochbaum, D.: Efficient Bounds for the Stable Set, Vertex Cover and Set Packing Problems. Disc. Appl. Math. 6 (1983)
Kolmogorov, V.: Primal-Dual Algorithm for Convex Markov Random Fields. Microsoft Tech. Rep. MSR-TR-2005-117 (2005)
Kolmogorov, V., Zabih, R.: What Energy Functions can be Minimized via Graph Cuts? Transactions on Pattern Analysis and Machine Intelligence 26(2), 147–159 (2004)
Kumar, T.K.S.: Lifting Techniques for Weighted Constraint Satisfaction Problems. In: Tenth International Symposium on Artificial Intelligence and Mathematics (ISAIM 2008) (2008)
Mak, W., Wong, D.: A Fast Hypergraph Min-Cut Algorithm for Circuit Partitioning. VLSI Journal 30(1), 1–11 (2000)
Micali, S., Vazirani, V.: An \(O(\sqrt{|V|}|E|)\) Algorithm for Finding Maximum Matching in General Graphs. In: FOCS 1980 (1980)
Rhys, J.: A Selection Problem of Shared Fixed Costs and Network Flows. Management Sci. 17(3), 200–207 (1970)
Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, T.K.S. (2008). A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems. In: Stuckey, P.J. (eds) Principles and Practice of Constraint Programming. CP 2008. Lecture Notes in Computer Science, vol 5202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85958-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85957-4
Online ISBN: 978-3-540-85958-1
eBook Packages: Computer ScienceComputer Science (R0)