Nonuniform Boolean Constraint Satisfaction Problems with Cardinality Constraint

被引：7
|
作者：
Creignou, Nadia [1 ]
Schnoor, Henning [2 ]
Schnoor, Ilka [3 ]
机构：
[1] Aix Marseille Univ, Marseille, France
[2] Univ Kiel, D-24118 Kiel, Germany
[3] Med Univ Lubeck, D-23562 Lubeck, Germany
来源：
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC | 2010年 / 11卷 / 04期
关键词：
Theory; Computational complexity; constraint satisfaction; COMPLEXITY; SATISFIABILITY; BASES;
D O I：
10.1145/1805950.1805954
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study the computational complexity of Boolean constraint satisfaction problems with cardinality constraint. A Galois connection between clones and coclones has received a lot of attention in the context of complexity considerations for constraint satisfaction problems. This connection does not seem to help when considering constraint satisfaction problems that support in addition a cardinality constraint. We prove that a similar Galois connection, involving a weaker closure operator and partial polymorphisms, can be applied to such problems. Thus, we establish dichotomies for the decision as well as for the counting problems in Schaefer's framework.
引用
收藏
页码：1 / 32
页数：32
相关论文
共 50 条
  • [31] Locked constraint satisfaction problems
    Zdeborova, Lenka
    Mezard, Marc
    PHYSICAL REVIEW LETTERS, 2008, 101 (07)
  • [32] On reformulation of constraint satisfaction problems
    Weigel, R
    Bliek, C
    ECAI 1998: 13TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1998, : 254 - 258
  • [33] Role mining based on permission cardinality constraint and user cardinality constraint
    Ma, Xiaopu
    Li, Ruixuan
    Wang, Hongwei
    Li, Huaqing
    SECURITY AND COMMUNICATION NETWORKS, 2015, 8 (13) : 2317 - 2328
  • [34] A Meta Constraint Satisfaction Optimization Problem for the Optimization of Regular Constraint Satisfaction Problems
    Loeffler, Sven
    Liu, Ke
    Hofstedt, Petra
    PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE (ICAART), VOL 2, 2019, : 435 - 442
  • [35] The expressivity of constraint query languages with Boolean algebra linear cardinality constraints
    Revesz, P
    ADVANCES IN DATABASES AND INFORMATION SYSTEMS, PROCEEDINGS, 2005, 3631 : 167 - 182
  • [36] Constraint logic programming for qualitative and quantitative constraint satisfaction problems
    Lee, HG
    Lee, RM
    Yu, G
    DECISION SUPPORT SYSTEMS, 1996, 16 (01) : 67 - 83
  • [37] The cardinality matrix constraint
    Régin, JC
    Gomes, CP
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2004, PROCEEDINGS, 2004, 3258 : 572 - 587
  • [38] Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
    Galanis, Andreas
    Goldberg, Leslie Ann
    Yang, Kuan
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 115 : 187 - 213
  • [39] Cardinality constraint programs
    Syrjänen, T
    LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 3229 : 187 - 199
  • [40] Simultaneous Approximation of Constraint Satisfaction Problems
    Bhangale, Amey
    Kopparty, Swastik
    Sachdeva, Sushant
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 193 - 205
12345