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 条
  • [1] Counting constraint satisfaction problems
    Bulatov, Andrei A.
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONGRESS OF MATHEMATICIANS (ICM 2014), VOL IV, 2014, : 561 - 584
  • [2] Consistency for quantified constraint satisfaction problems
    Nightingale, P
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2005, PROCEEDINGS, 2005, 3709 : 792 - 796
  • [3] Local consistency as a reduction between constraint satisfaction problems
    Dalmau, Victor
    Oprsal, Jakub
    [J]. PROCEEDINGS OF THE 39TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS 2024, 2024,
  • [4] Rewriting numeric constraint satisfaction problems for consistency algorithms
    Lottaz, C
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING-CP'99, 1999, 1713 : 486 - 487
  • [5] Constraint Satisfaction Problems Solvable by Local Consistency Methods
    Barto, Libor
    Kozik, Marcin
    [J]. JOURNAL OF THE ACM, 2014, 61 (01)
  • [6] An agent model for binary constraint satisfaction problems
    Zhong, WC
    Liu, J
    Jiao, LC
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2005, 3448 : 260 - 269
  • [7] Improved algorithms for counting solutions in constraint satisfaction problems
    Angelsmark, O
    Jonsson, P
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS, 2003, 2833 : 81 - 95
  • [8] Generalized counting constraint satisfaction problems with determinantal circuits
    Morton, Jason
    Turner, Jacob
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 466 : 357 - 381
  • [9] The structure of tractable constraint satisfaction problems
    Grohe, Martin
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 58 - 72
  • [10] A non-binary constraint ordering heuristic for constraint satisfaction problems
    Salido, Miguel A.
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2008, 198 (01) : 280 - 295
12345