Abstract
Constraint satisfaction problems (CSP) are a class of combinatorial problems that can be solved efficiently by combining consistency methods such as arc-consistency together with a backtracking search. However these techniques are not adapted to symmetrical CSP. In fact one can exhibit rather small CSP that cannot be solved with consistency techniques. The relevance of this symmetry problem to real world applications is very strong since it can prevent a CSP solver to solve even small instances of real world problems. This paper describes a general solution for this kind of problems. Both a theoretical study and experimental results using the constraint-based library PECOS are provided.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Benhamou B., and Sais L. “Theoretical study of symmetries in propositional calculs and applications”, in proceedings of CADE 92 june 92.
Caseau Y, Puget JF, “Constraints on Order Sorted Domains”, submited.
Deville, Y., and Van Hentenryck, P, “An Efficient Arc Consistency Algorithm for a Class of CSP Problems”, in proceedings of IJCAI 1991, pp 325–330.
Gusgen, Hertzberg “Some fundamental properties of local propagation methods” Art. Int. pp 237–247, 1988.
Ilog, PECOS 1.2 reference manual, december 92 1992.
Jaffar J., and Lassez J.-L. Constraint Logic Programming, in proceedings of POPL 1987, Munich, January 87.
Lauriere J.L., A language and a Program for Stating and Solving Combinatorial Problems, Art. Int. 10(1).
Mackworth A.K., “Consistency in networks of relations”, Art. Int 8, pp 99–118, 1977
Mohr, Henderson “Arc and path consistency revisited” Art. Int. 28, pp 128–233, 1986.
Mohr, Masini, “Good Old Discrete Relaxation”, in proceedings of ECAI 1988.
Puget J.-F., “Pecos: a High Level Constraint programming Language” in proceedings of SPICIS 92, Singapore, Sept 92.
Puget J.-F., “Programmation par contraintes oriente'e objet” in proceedings of Tenth international conference on expert systems and applications, Avignon, June 92 (in French).
San Miguel Aguire, “HOW to use symmetries in Boolean constraint solving” in A. Colmerauer and F. Benhamou, editors, Selected Papers on Constraint Logic Programming (to appear) MIT Press.
Van Hentenryck, P., Constraints Satisfaction in Logic Programming, MIT press, 1989.
Van Hentenryck, P., Deville Y., “The cardinal operator; A new logical connective for constraint logic programming” in proceedings of ICLP 91, pp 745–759.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Puget, JF. (1993). On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski, J., Raś, Z.W. (eds) Methodologies for Intelligent Systems. ISMIS 1993. Lecture Notes in Computer Science, vol 689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56804-2_33
Download citation
DOI: https://doi.org/10.1007/3-540-56804-2_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56804-9
Online ISBN: 978-3-540-47750-1
eBook Packages: Springer Book Archive