Introduction to algorithms
A fast hypergraph min-cut algorithm for circuit partitioning
Integration, the VLSI Journal
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison
Over-Constrained Systems
Discrete Applied Mathematics
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Journal of Artificial Intelligence Research
Planning with goal utility dependencies
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A new hybrid tractable class of soft constraint problems
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Hybrid tractability of valued constraint problems
Artificial Intelligence
| Hi-index | 0.00 |
Many tasks in automated reasoning can be modeled as weighted constraint satisfaction problemsover 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 coverfor 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."