On forward checking for non-binary constraint satisfaction

Authors:
Christian Bessière;Pedro Meseguer;Eugene C. Freuder;Javier Larrosa
Affiliations:
LIRMM-CNRS, 161 rue Ada, Montpellier, France;IIIA-CSIC, Campus UAB, Bellaterra, Spain;Cork Constraint Computation Centre, University College Cork, Cork, Ireland;Dep. LSI, UPC, Jordi Girona Salgado, 1-3, Barcelona, Spain
Venue:
Artificial Intelligence
Year:
2002

Citing 8
Cited 11

Running efficiently arc consistency

Syntactic and structural pattern recognition
Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
A theoretical evaluation of selected backtracking algorithms

Artificial Intelligence
On the conversion between non-binary constraint satisfaction problems

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Backtrack Programming

Journal of the ACM (JACM)
Contradicting Conventional Wisdom in Constraint Satisfaction

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Collaborative Learning for Constraint Solving

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Refining the basic constraint propagation algorithm

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Fuzzy constraint satisfaction approach for landmark recognition in mobile robotics

AI Communications
Partition search for non-binary constraint satisfaction

Information Sciences: an International Journal
Domain filtering consistencies for non-binary constraints

Artificial Intelligence
Inverse Consistencies for Non-binary Constraints

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results

Journal of Artificial Intelligence Research
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism

Journal of Experimental Algorithmics (JEA)
Second-order consistencies

Journal of Artificial Intelligence Research
The car-sequencing problem as n-ary CSP: sequential and parallel solving

AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
A boolean encoding including SAT and n-ary CSPs

AIMSA'06 Proceedings of the 12th international conference on Artificial Intelligence: methodology, Systems, and Applications
Dealing with Satisfiability and n-ary CSPs in a Logical Framework

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Solving non-binary constraint satisfaction problems, a crucial challenge today, can be tackled in two different ways: translating the non-binary problem into an equivalent binary one, or extending binary search algorithms to solve directly the original problem. The latter option raises some issues when we want to extend definitions written for the binary case. This paper focuses on the well-known forward checking algorithm, and shows that it can be generalized to several non-binary versions, all fitting its binary definition. The classical non-binary version, proposed by Van Hentenryck, is only one of these generalizations.