Arc and path consistence revisited
Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Solving large combinatorial problems in logic programming
Journal of Logic Programming - Logic programming applications
Constraint satisfaction algorithms
Computational Intelligence
Constraint relaxation may be perfect
Artificial Intelligence
On the parallel complexity of discrete relaxation in constraint satisfaction networks
Artificial Intelligence
Synthesizing constraint expressions
Communications of the ACM
Distributed Reinforcement of Arc-Consistency
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Using inference to reduce arc consistency computation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A graph based backtracking algorithm for solving general CSPs
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Tradeoffs in the complexity of backdoor detection
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Combining qualitative and quantitative constraints in temporal reasoning
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
On the minimality and decomposability of constraint networks
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Arc-consistency and arc-consistency again
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
On guaranteeing polynomially bounded search tree size
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Possibilistic constraint satisfaction problems or "How to handle soft constraints ?"
UAI'92 Proceedings of the Eighth international conference on Uncertainty in artificial intelligence
| Hi-index | 0.00 |
Consistency Techniques have been studied extensively in the past as a way of tackling Constraint Satisfaction Problems (CSP). In particular various arc consistency algorithms have been proposed, originating from Waltz's filtering algorithm [20] and culminating in the optimal algorithm AC-4 of Mohr and Henderson [13]. AC-4 runs in O(ed2) in the worst case where e is the number of arcs (or constraints) and d is the site of the largest domain. Being applicable to the whole class of (binary) CSP, these algorithms do not take into account the semantics of constraints. In this paper, we present a new generic arc consistency algorithm AC-5. The algorithm is parametrised on two specified procedures and can be instantiated to reduce to AC-3 and AC-4. More important, AC-5 can be instantiated to produce an O(ed) algorithm for two important classes of constraints: functional and monotonic constraints. We also show that AC-5 has an important application in Constraint Logic Programming over Finite Domains [18]. The kernel of the constraint-solver for such a programming language is an arc consistency algorithm for a set of basic constraints. We prove that AC-5, in conjunction with node consistency, provides a decision procedure for these constraints running in time O(ed).