Ordering Heuristics for Arc Consistency Algorithms
نویسندگان
چکیده
Arc consistency algorithms are used in solving constraint satisfaction problems and are important in constraint logic programming languages. Search order heuristics for arc consistency algorithms signiicantly enhance the ef-ciency of their implementation. In this paper we propose and evaluate several ordering heuristics. Care is taken with experimental design , involving random problems, and statistical evaluation of results. A heuristic is identi-ed which yields about 50% savings on average, using the standard measure of consistency pair checks, with reasonable heuristic computation cost.
منابع مشابه
Two New Lightweight Arc Consistency Algorithms
Coarse-grained arc consistency algorithms like AC-3, AC-3d, and AC-2001, are efficient when it comes to transforming a Constraint Satisfaction Problem (CSP) to its arc consistent equivalent. These algorithms repeatedly carry out revisions to remove unsupported values from the domains of the variables. The order of these revisions is determined by so-called revision ordering heuristics. In this ...
متن کاملAbscon 2005
This paper describes the algorithms, heuristics and strategies used by the two solvers which have been elaborated from the Abscon platform and submitted to the first CSP solver competition. Both solvers maintain arc consistency during search, explore the search space using a conflict-directed variable ordering heuristic and integrate a restart strategy. At preprocessing, the first solver establ...
متن کاملHistogram Arc Consistency as a Value Ordering Heuristic
The Constraint Satisfaction Problem (CSP:I is NP-hard. Finding solutions requires searching in an exponential space of possible variable assignments. Good value ordering heuristics are essential for finding solutions to CSPs. Such heuristics estimate the probability that any particular variable assignment will appear in a globally consistent solution. Unfortunately, computing solution probabili...
متن کاملAbscon 109 A generic CSP solver
This paper describes the algorithms, heuristics and general strategies used by the two solvers which have been elaborated from the Abscon platform and submitted to the second CSP solver competition. Both solvers maintain generalized arc consistency during search, explore the search space using a conflict-directed variable ordering heuristic, integrate nogood recording from restarts and exploit ...
متن کاملEfficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to being acyclic. Such graphs are encountered in many real world application domains such as configuration, diagnosis, model-based reasoning and scheduling. We present a class of variable ordering heuristics that exploit the cluste...
متن کامل