Please use this identifier to cite or link to this item:
|Title:||Unified framework for consistency check|
|Citation:||Liu, Bing (1995-08). Unified framework for consistency check. International Journal of Intelligent Systems 10 (8) : 691-713. ScholarBank@NUS Repository.|
|Abstract:||Constraint Satisfaction Problem (CSP) involves finding values for variables to satisfy a set of constraints. Consistency check is the key technique in solving this class of problems. Past research has developed many algorithms for such a purpose, e.g., node consistency, arc consistency, generalized node and arc consistency, specific methods for checking specific constraints, etc. In this article, an attempt is made to unify these algorithms into a common framework. This framework consists of two parts. The first part is a generic consistency check algorithm, which allows and encourages each individual constraint to be checked by its specific consistency methods. Such an approach provides a direct way of practical implementation of the CSP model for real problem-solving. The second part is a general schema for describing the handling of each type of constraint. The schema characterizes various issues of constraint handling in constraint satisfaction, and provides a common language for expressing, discussing, and exchanging constraint handling techniques.|
|Source Title:||International Journal of Intelligent Systems|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 23, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.