Quantified constraint satisfaction and bounded treewidth

被引：0
|
作者：
Chen, H [1 ]
机构：
[1] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
来源：
ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS | 2004年 / 110卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Because the constraint satisfaction problem (CSP) is in general intractable, restricted cases of the CSP that are polynomial-time tractable have been heavily sought after. One class of restrictions that has been studied are variable-based restrictions, which concern the interaction among variables. In this paper, we consider the quantified constraint satisfaction problem (QCSP), a framework more general than the CSP. We present a QCSP tractability result arising from variable-based restrictions by giving a polynomial time algorithm for certain classes of QCSP instances having bounded treewidth.
引用
收藏
页码：161 / 165
页数：5
相关论文
共 50 条
  • [21] Quantified constraint satisfaction and the polynomially generated powers property
    Chen, Hubie
    ALGEBRA UNIVERSALIS, 2011, 65 (03) : 213 - 241
  • [22] Hybrid Tractable Class for Quantified Constraint Satisfaction Problems
    Gao J.
    Chen R.
    Li H.
    Ruan Jian Xue Bao/Journal of Software, 2019, 30 (12): : 3590 - 3604
  • [23] Quantified constraint satisfaction and 2-semilattice polymorphisms
    Chen, HB
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2004, PROCEEDINGS, 2004, 3258 : 168 - 181
  • [24] SENSITIVITY ANALYSIS IN QUANTIFIED INTERVAL CONSTRAINT SATISFACTION PROBLEMS
    Hu, Jie
    Wang, Yan
    PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2013, VOL 3B, 2014,
  • [25] Quantified constraint satisfaction and the polynomially generated powers property
    Hubie Chen
    Algebra universalis, 2011, 65
  • [26] Sensitivity Analysis in Quantified Interval Constraint Satisfaction Problems
    Hu, Jie
    Wang, Yan
    Cheng, Aiguo
    Zhong, Zhihua
    JOURNAL OF MECHANICAL DESIGN, 2015, 137 (04)
  • [27] Bounded backtracking for the valued constraint satisfaction problems
    Terrioux, C
    Jégou, P
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS, 2003, 2833 : 709 - 723
  • [28] Patterns with bounded treewidth
    Reidenbach, Daniel
    Schmid, Markus L.
    INFORMATION AND COMPUTATION, 2014, 239 : 87 - 99
  • [29] The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions
    Gottlob, Georg
    Greco, Gianluigi
    Scarcello, Francesco
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 150 - 155
  • [30] Low-level dichotomy for quantified constraint satisfaction problems
    Martin, Barnaby
    INFORMATION PROCESSING LETTERS, 2011, 111 (20) : 999 - 1003
12345