| 负表约束的简单表缩减广泛弧相容算法 |
| |
| 引用本文： | 李宏博,梁艳春,李占山.负表约束的简单表缩减广泛弧相容算法[J].软件学报,2016,27(11):2701-2711. |
| |
| 作者姓名： | 李宏博 梁艳春 李占山 |
| |
| 作者单位： | 吉林大学 计算机科学与技术学院, 吉林 长春 130012;符号计算与知识工程教育部重点实验室(吉林大学), 吉林 长春 130012,吉林大学 计算机科学与技术学院, 吉林 长春 130012;符号计算与知识工程教育部重点实验室(吉林大学), 吉林 长春 130012,吉林大学 计算机科学与技术学院, 吉林 长春 130012;符号计算与知识工程教育部重点实验室(吉林大学), 吉林 长春 130012 |
| |
| 基金项目： | 国家自然科学基金（61472158，61272207）；吉林省科技计划（20140101200JC） |
| |
| 摘 要： | 广泛弧相容算法（generalized arc consistency，简称GAC），是求解约束满足问题的核心方法.表约束理论上可以表示所有约束关系，在过去10年中，有很多应用于表约束的广泛弧相容算法被提出来.在这些算法中，表缩减算法的效率非常高.但是目前的表缩减算法只能应用于正表约束，无法直接应用于负表约束.首先，提出一种表缩减算法STR-N，可以直接应用于负表约束；然后，给出了STR-N的两个改进版本STR-N2和STR-NIC.实验结果显示，STR-N算法在负表约束上的求解效率具有明显的优势.
|
| 关 键 词： | 约束满足问题 广泛弧相容 简单表缩减 负表约束 |
| 收稿时间： | 2014/9/25 0:00:00 |
| 修稿时间： | 1/7/2015 12:00:00 AM |
Simple Tabular Reduction for Generalized Arc Consistency on Negative Table Constraints |
| |
| LI Hong-Bo,LIANG Yan-Chun and LI Zhan-Shan.Simple Tabular Reduction for Generalized Arc Consistency on Negative Table Constraints[J].Journal of Software,2016,27(11):2701-2711. |
| |
| Authors: | LI Hong-Bo LIANG Yan-Chun and LI Zhan-Shan |
| |
| Affiliation: | College of Computer Science and Technology, Jilin University, Changchun 130012, China;Key Laboratory of Symbolic Computation and Knowledge Engineering for the Ministry of Education(Jilin University, Changchun 130012, China,College of Computer Science and Technology, Jilin University, Changchun 130012, China;Key Laboratory of Symbolic Computation and Knowledge Engineering for the Ministry of Education(Jilin University, Changchun 130012, China and College of Computer Science and Technology, Jilin University, Changchun 130012, China;Key Laboratory of Symbolic Computation and Knowledge Engineering for the Ministry of Education(Jilin University, Changchun 130012, China |
| |
| Abstract: | Generalized arc consistency (GAC) plays a central role in solving the constraint satisfaction problem. Table constraints can theoretically represent all kinds of constraint relations, and many algorithms have been proposed to establish GAC on table constraints in the past decade. Among these methods, the simple tabular reduction algorithms (STR) are very efficient. However, the existing STR algorithms are suitable for only positive table constraints. They can not directly work on negative table constraints. In this paper, a STR algorithm, called STR-N, is first proposed to directly work on negative table constraints. Then, two improved versions of STR-N, STR-N2 and STR-NIC are presented. Experimental results show that the STR-N algorithms bring improvements over CPU time while solving the instances with negative table constraints. |
| |
| Keywords: | constraint satisfaction problem generalized arc consistency simple tabular reduction negative table constraint |
|
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
