Premium
A unified framework for consistency check
Author(s) -
Liu Bing
Publication year - 1995
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.4550100802
Subject(s) - local consistency , constraint satisfaction problem , computer science , consistency (knowledge bases) , constraint satisfaction , consistency model , constraint (computer aided design) , constraint learning , schema (genetic algorithms) , constraint logic programming , weak consistency , causal consistency , theoretical computer science , constraint satisfaction dual problem , sequential consistency , strong consistency , mathematics , data consistency , artificial intelligence , distributed computing , information retrieval , statistics , geometry , estimator , probabilistic logic
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, are 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. © 1995 John Wiley & Sons, Inc.