Collapsibility in infinite-domain quantified constraint satisfaction

被引：0
|
作者：
Bodirsky, Manuel [1 ]
Chen, Hubie
机构：
[1] Humboldt Univ, Inst Informat, Berlin, Germany
[2] Univ Pompeu Fabra, Dept Tecnol, Barcelona, Spain
来源：
COMPUTER SCIENCE LOGIC, PROCEEDINGS | 2006年 / 4207卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong complexity upper bounds on the QCSP. This technique makes use of both logical and universal-algebraic ideas. We give applications illustrating the use of our technique.
引用
收藏
页码：197 / 211
页数：15
相关论文
共 50 条
  • [1] Promise and Infinite-Domain Constraint Satisfaction
    Mottet, Antoine
    [J]. 32ND EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC, CSL 2024, 2024, 288
  • [2] Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep
    Pinsker, Michael
    [J]. 2022 IEEE 52ND INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2022), 2022, : 80 - 87
  • [3] An initial study of time complexity in infinite-domain constraint satisfaction
    Jonsson, Peter
    Lagerkvist, Victor
    [J]. ARTIFICIAL INTELLIGENCE, 2017, 245 : 115 - 133
  • [4] Collapsibility and consistency in quantified constraint satisfaction
    Chen, HB
    [J]. PROCEEDING OF THE NINETEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE SIXTEENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2004, : 155 - 160
  • [5] Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)
    Bodirsky, Manuel
    Mottet, Antoine
    Olsak, Miroslav
    Oprsal, Jakub
    Pinsker, Michael
    Willard, Ross
    [J]. 2019 34TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2019,
  • [6] Fundamentals on infinite-domain interpolations
    Okabe, M
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL FLUID DYNAMICS, 1996, 7 (1-2) : 179 - 191
  • [7] The complexity of quantified constraint satisfaction: Collapsibility, sink algebras, and the three-element case
    Chen, Hubie
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 37 (05) : 1674 - 1701
  • [8] Computational Short Cuts in Infinite Domain Constraint Satisfaction
    Jonsson, Peter
    Lagerkvist, Victor
    Ordyniak, Sebastian
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2022, 75 : 793 - 831
  • [9] Computational Short Cuts in Infinite Domain Constraint Satisfaction
    Jonsson P.
    Lagerkvist V.
    Ordyniak S.
    [J]. Journal of Artificial Intelligence Research, 2022, 75 : 793 - 831
  • [10] Relatively quantified constraint satisfaction
    Manuel Bodirsky
    Hubie Chen
    [J]. Constraints, 2009, 14 : 3 - 15
12345