Hybrid Tractable Class for Quantified Constraint Satisfaction Problems

被引：0
|
作者：
Gao J. [1 ]
Chen R. [1 ]
Li H. [1 ]
机构：
[1] College of Information Science and Technology, Dalian Maritime University, Dalian
来源：
Ruan Jian Xue Bao/Journal of Software | 2019年 / 30卷 / 12期
基金：
中国国家自然科学基金;
关键词：
Backdoor set; Backtracking algorithm; Quantified constraint satisfaction problem (QCSP); Tractable class;
D O I：
10.13328/j.cnki.jos.005598
中图分类号：
学科分类号：
摘要：
Quantified constraint satisfaction problem (QCSP) is a central problem in artificial intelligence and automated reasoning. The tractable class is an important method to analyze its computation complexity. This study proposed a new method to determine tractability of quantified variables by analyzing constraint structures and the ordering of universally quantified variables in the prefix on a binary QCSP. Based on this method, the existing tractable class was extended with the broken-triangle property, and then a more generalized hybrid tractable class was proposed. Furthermore, an application was presented that was identifying backdoor sets through the new tractable class, and the experimental results were analyzed to show the size of backdoor sets identified by those hybrid tractable classes. To perform the experiment, a state-of-the-art QCSP solver was modified based on a backtracking algorithm by integrating a backdoor set detection module, and the advantage of the new generalized tractable class is shown where the size of backdoor set identified by it is smaller than the existing one on randomly generated instances. Finally, it is indicated that the method proposed in this study can be employed to extend other hybrid tractable classes. © Copyright 2019, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：3590 / 3604
页数：14
相关论文
共 56 条
  • [1] Dechter R., Constraint Processing, (2003)
  • [2] Amilhastre J., Fargier H., Marquis P., Consistency restoration and explanationsin dynamic CSPs-Application to configuration, Artificial Intelligence, 135, 1, pp. 199-234, (2002)
  • [3] Bartak R., Salido M.A., Constraint satisfaction for planning and scheduling problems, Constraints, 16, 3, pp. 223-227, (2011)
  • [4] Van Beek P., Chen X., CPlan: A constraint programming approach to planning, Proc. of the 16th National Conf. on Artificial Intelligence and 11th Conf. on Innovative Applications of Artificial Intelligence, pp. 585-590, (1999)
  • [5] Gent I.P., Nightingale P., Rowley A., Stergiou K., Solving quantified constraint satisfaction problems, Artificial Intelligence, 72, 6-7, pp. 738-771, (2008)
  • [6] Buning H.K., Karpinski M., Flogel A., Resolution for quantified Boolean formulas, Information and Computation, 117, 1, pp. 12-18, (1995)
  • [7] Nightingale P., Non-binary quantified CSP: Algorithms and modelling, Constraints, 14, 4, pp. 539-581, (2009)
  • [8] Palmieri A., Lallouet A., Constraint games revisited, Proc. of the 26th Int'l Joint Conf. on Artificial Intelligence, pp. 729-735, (2017)
  • [9] Lin X.H., Feng Y.X., Tan J.R., Feng Y., Gao Y.C., Product quality characteristics robust optimization design based on quantified constraint satisfaction problem, Chinese Journal of Mechanical Engineering, 49, 15, pp. 169-179, (2013)
  • [10] Benedetti M., Lallouet A., Vautard J., Modeling adversary scheduling with QCSP+, Proc. of the 2008 ACM Symp. on Applied Computing (SAC), pp. 151-155, (2008)
123456