Quantified equality constraints

被引：5
|
作者：
Bodirsky, Manuel [1 ]
Chen, Hubie [2 ]
机构：
[1] Humboldt Univ, Inst Informat, D-1086 Berlin, Germany
[2] Univ Pompeu Fabra, Dept Technol Informat & Commun, Barcelona, Spain
来源：
22ND ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS | 2007年
关键词：
D O I：
10.1109/LICS.2007.38
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We prove a complete complexity classification for quantified constraint satisfaction problems (QCSPs) over equality templates: these problems are in L (decidable in logarithmic space), NP-complete, or PSPACE-complete. To establish our classification theorem we combine methods from universal algebra with concepts from model theory.
引用
收藏
页码：203 / +
页数：2
相关论文
共 50 条
  • [1] QUANTIFIED EQUALITY CONSTRAINTS
    Bodirsky, Manuel
    Chen, Hubie
    [J]. SIAM JOURNAL ON COMPUTING, 2010, 39 (08) : 3682 - 3699
  • [2] Inner and outer approximations of existentially quantified equality constraints
    Goldsztejn, Alexandre
    Jaulin, Luc
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2006, 2006, 4204 : 198 - 212
  • [3] Solving existentially quantified constraints with one equality and arbitrarily many inequalities
    Ratschan, S
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS, 2003, 2833 : 615 - 633
  • [4] Quantified Class Constraints
    Bottu, Gert-Jan
    Karachalias, Georgios
    Schrijvers, Tom
    Oliveira, Bruno C. D. S.
    Wadler, Philip
    [J]. ACM SIGPLAN NOTICES, 2017, 52 (10) : 148 - 161
  • [5] Introducing Quantified Cuts in Logic with Equality
    Hetzl, Stefan
    Leitsch, Alexander
    Reis, Giselle
    Tapolczai, Janos
    Weller, Daniel
    [J]. AUTOMATED REASONING, IJCAR 2014, 2014, 8562 : 240 - 254
  • [6] Quantified constraints under perturbation
    Ratschan, S
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 2002, 33 (04) : 493 - 505
  • [7] Quantified constraints and containment problems
    Chen, Hubie
    Madelaine, Florent
    Martin, Barnaby
    [J]. TWENTY-THIRD ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2008, : 317 - +
  • [8] Quantified Positive Temporal Constraints
    Charatonik, Witold
    Wrona, Michal
    [J]. COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2008, 5213 : 94 - 108
  • [9] The Complexity of Problems for Quantified Constraints
    Michael Bauland
    Elmar Böhler
    Nadia Creignou
    Steffen Reith
    Henning Schnoor
    Heribert Vollmer
    [J]. Theory of Computing Systems, 2010, 47 : 454 - 490
  • [10] QUANTIFIED CONSTRAINTS AND CONTAINMENT PROBLEMS
    Chen, Hubie
    Madelaine, Florent
    Martin, Barnaby
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2015, 11 (03)
12345