Narrowing Support Searching Range in Maintaining Arc Consistency for Solving Constraint Satisfaction Problems

被引：4
|
作者：
Li, Hongbo [1 ]
机构：
[1] Northeast Normal Univ, Sch Comp Sci & Informat Technol, Changchun 130117, Peoples R China
来源：
IEEE ACCESS | 2017年 / 5卷
关键词：
Constraint satisfaction problem; constraint propagation; arc consistency; residue support;
D O I：
10.1109/ACCESS.2017.2690672
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Arc consistency is the most popular filtering technique for solving constraint satisfaction problems. Constraint check plays a central role in establishing arc consistency. In this paper, we propose a method to save constraint checks in maintaining coarse-grained arc consistency during backtracking search for solving the constraint satisfaction problems. We reduce the support searching range by utilizing the information generated by an AC3.1 algorithm at preprocessing step. Compared with the existing maintaining arc consistency (MAC) algorithms, the proposed MAC3(be) algorithm saves constraint checks without maintaining additional data structures at each search tree node. Our experimental results show that MAC3(be) saves both constraint checks and CPU time while solving some benchmark problems.
引用
收藏
页码：5798 / 5803
页数：6
相关论文
共 50 条
  • [21] A reactive approach for solving constraint satisfaction problems
    Dury, A
    Le Ber, F
    Chevrier, V
    INTELLIGENT AGENTS V: AGENT THEORIES, ARCHITECTURES, AND LANGUAGES, 1999, 1555 : 397 - 411
  • [22] Solving Mixed and Conditional Constraint Satisfaction Problems
    Esther Gelle
    Boi Faltings
    Constraints, 2003, 8 : 107 - 141
  • [23] A System for Solving Constraint Satisfaction Problems with SMT
    Bofill, Miguel
    Suy, Josep
    Villaret, Mateu
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2010, PROCEEDINGS, 2010, 6175 : 300 - 305
  • [24] On communication in solving Distributed Constraint Satisfaction Problems
    Jung, H
    Tambe, M
    MULTI-AGENT SYSTEMS AND APPLICATIONS IV, PROCEEDINGS, 2005, 3690 : 418 - 429
  • [25] Local consistency as a reduction between constraint satisfaction problems
    Dalmau, Victor
    Oprsal, Jakub
    PROCEEDINGS OF THE 39TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS 2024, 2024,
  • [26] Rewriting numeric constraint satisfaction problems for consistency algorithms
    Lottaz, C
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING-CP'99, 1999, 1713 : 486 - 487
  • [27] Constraint Satisfaction Problems Solvable by Local Consistency Methods
    Barto, Libor
    Kozik, Marcin
    JOURNAL OF THE ACM, 2014, 61 (01)
  • [28] An optimal algorithm based on the solution to the coarse-grained arc consistency algorithms of the Constraint satisfaction Problems
    Yang, Gang
    Li, Huifeng
    Cao, Can
    Chen, Siyuan
    Zhao, Yubo
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INTELLIGENT COMMUNICATION, 2015, 16 : 12 - 17
  • [29] A FINE-GRAINED ARC-CONSISTENCY ALGORITHM FOR NON-NORMALIZED CONSTRAINT SATISFACTION PROBLEMS
    Arangu, Marlene
    Salido, Miguel A.
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2011, 21 (04) : 733 - 744
  • [30] Saving constraint checks in maintaining coarse-grained generalized arc consistency
    Li, Hongbo
    Li, Ruizhi
    Yin, Minghao
    NEURAL COMPUTING & APPLICATIONS, 2019, 31 (Suppl 1): : 499 - 508
12345