Counting, Structure Identification and Maximum Consistency for Binary Constraint Satisfaction Problems
نویسنده
چکیده
Using a framework inspired by Schaefer's generalized satissability model Sch78], Cooper, Cohen and Jeavons CCJ94] studied the complexity of constraint satisfaction problems in the special case when the set of constraints is closed under permutation of labels and domain restriction, and precisely identiied the tractable (and intractable) cases. Using the same model we characterize the complexity of three related problems: counting the number of solutions. structure identiication (Dechter and Pearl DP92]). approximating the maximum number of satissable constraints.
منابع مشابه
A Generalization of Generalized Arc Consistency: From Constraint Satisfaction to Constraint-Based Inference
Arc consistency and generalized arc consistency are two of the most important local consistency techniques for binary and non-binary classic constraint satisfaction problems (CSPs). Based on the Semiring CSP and Valued CSP frameworks, arc consistency has also been extended to handle soft constraint satisfaction problems such as fuzzy CSP, probabilistic CSP, max CSP, and weighted CSP. This exten...
متن کاملAlgorithms for Counting 2-SatSolutions and Colorings with Applications
An algorithm is presented for exactly solving (in fact, counting) the number of maximum weight satisfying assignments of a 2-Cnf formula. The worst case running time of O(1.246) for formulas with n variables improves on the previous bound of O(1.256) by Dahllöf, Jonsson, and Wahlström. The algorithm uses only polynomial space. As a consequence we get an O(1.246) time algorithm for counting maxi...
متن کاملAn LP-Designed Algorithm for Constraint Satisfaction
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we present an O(nr)-time algorithm. It is the fastest algorithm for most problems in the class (including Max Cut, Max 2-Sat, and weighted Maximum Independent Set), and in combination with “Generalized CSPs” introduced in a co...
متن کاملOptimizing Simple Tabular Reduction with a Bitwise Representation
Maintaining Generalized Arc Consistency (GAC) during search is considered an efficient way to solve non-binary constraint satisfaction problems. Bit-based representations have been used effectively in Arc Consistency algorithms. We propose STRbit, a GAC algorithm, based on simple tabular reduction (STR) using an efficient bit vector support data structure. STRbit is extended to deal with compre...
متن کاملA Dual Graph Translation of a Problem in 'Life'
Conway’s game of Life provides interesting problems in which modelling issues in constraint programming can be explored. The problem of finding a maximum density stable pattern (‘still-life’) is discussed. A formulation of this problem as a constraint satisfaction problem with 0-1 variables and non-binary constraints is compared with its dual graph translation into a binary CSP. The success of ...
متن کامل