Counting, structure identification and maximum consistency for binary constraint satisfaction problems

被引：0
|
作者：
Istrate, G [1 ]
机构：
[1] Univ Rochester, Dept Comp Sci, Rochester, NY 14627 USA
来源：
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 97 | 1997年 / 1330卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Using a framework inspired by Schaefer's generalized satisfiability model [Sch78], Cohen, Cooper and Jeavons [CCJ94] studied the computational 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 identified the tractable (and intractable) cases. Using the same model we characterize the complexity of three related problems: 1. counting the number of solutions. 2. structure identification (Dechter and Pearl [DP92]). 3. approximating the maximum number of satisfiable constraints.
引用
收藏
页码：136 / 149
页数：14
相关论文
共 50 条
  • [21] On the conversion between non-binary and binary constraint satisfaction problems
    Bacchus, F
    van Beek, P
    [J]. FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS, 1998, : 311 - 318
  • [22] Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems
    Charikar, Moses
    Makarychev, Konstantin
    Makarychev, Yury
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (03)
  • [23] Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems
    Charikar, Moses
    Makarychev, Konstantin
    Makarychev, Yury
    [J]. PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 62 - 68
  • [24] An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems
    Georg Ringwelski
    [J]. Artificial Intelligence Review, 2005, 24 : 431 - 454
  • [25] CONSTRAINT SATISFACTION WITH COUNTING QUANTIFIERS
    Martin, Barnaby
    Madelaine, Florent
    Stacho, Juraj
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (02) : 1065 - 1113
  • [26] A FILTERING TECHNIQUE TO ACHIEVE 2-CONSISTENCY IN CONSTRAINT SATISFACTION PROBLEMS
    Arangu, Marlene
    Salido, Miguel A.
    Barber, Federico
    [J]. INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2012, 8 (06): : 3891 - 3906
  • [27] An arc-consistency algorithm for dynamic and distributed constraint satisfaction problems
    Ringwelski, G
    [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2005, 24 (3-4) : 431 - 454
  • [28] A graph of a relational structure and constraint satisfaction problems
    Bulatov, AA
    [J]. 19TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2004, : 448 - 457
  • [29] THE COMPLEXITY OF SOME POLYNOMIAL NETWORK CONSISTENCY ALGORITHMS FOR CONSTRAINT SATISFACTION PROBLEMS
    MACKWORTH, AK
    FREUDER, EC
    [J]. ARTIFICIAL INTELLIGENCE, 1985, 25 (01) : 65 - 74
  • [30] Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
    Yamakami, Tomoyuki
    [J]. APPROXIMATION AND ONLINE ALGORITHMS, 2011, 6534 : 261 - 272
12345