Abstract
Many works about abstraction of Constraint Satisfaction Problems (CSPs) introduce materials in order to build specific abstractions. But, to our best knowledge, only two works [2, 9] were devoted to defining frameworks of CSP abstraction. In this paper, we try to go one step beyond by proposing an original and unifying framework with a two-fold objective: a proposal sufficiently general to embrace previous works and to envision new forms of abstraction, and sufficiently precise to decide without any ambiguity the correctness of a given abstraction.
This paper has been supported in part by a “contrat de plan Etat-Région Nord/Pasde-Calais” and by the “IUT de Lens”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Bessiere, P. Meseguer, E.C. Freuder, and J. Larrosa. On forward checking for non-binary constraint satisfaction. In Proc. of CP’99, pages 88–102, Alexandra, VA, 1999.
Y. Caseau. Abstract interpretation of constraints on order-sorted domains. In Proc. of the International Symposium on Logic Programming, pages 435–452, 1991.
B. Choueiry, B. Faltings, and G. Noubi. Abstraction methods for resource allocation. In Proc. of the Workshop on theory Reformulation and Abstraction, Jackson Hole, Wyoming, 1994.
B. Choueiry, B. Faltings, and R. Weigel. Abstraction by interchangeability in resource allocation. In Proc. of IJCAI’95, pages 1694–1710, Montréal, Canada, 1995.
B. Choueiry and G. Noubir. On the computation of local interchangeability in discrete constraint satisfaction problems. In Proc. of AAAI’98, pages 326–333, Madison, WI, 1998.
P. Cousot and R. Cousot. Abstract interpretation: a unified lattice for static analysis of programs by construction of approximation of fixpoints. In Proc. of POPL’77, pages 238–252, Los Angeles, CA, 1977.
P. Cousot and R. Cousot. Abstract interpretation frameworks. Logic and Computation, 2(4):447–511, August 1992.
S. de Givry, G. Verfaillie, and T. Schiex. Bounding the optimum of constraint optimization problem. In Proc. of CP’97, Schloss Hagenberg, Austria, 1997.
Thomas Ellman. Abstraction via approximate symmetry. In Proc. of IJCAI’93, pages 916–921, chambéry, France, 1993.
E. Freuder and D. Sabin. Interchangeability supports abstraction and reformulation for constraint satisfaction. In Proc. of SARA’ 95, 1995.
E.C. Freuder. Eliminating interchangeable values in constraint satisfaction problems. In Proc. of AAAI’91, pages 227–233, Anaheim, CA, 1991.
F. Giunchiglia and T. Walsh. Abstract theorem proving. In Proc. of IJCAI’89, pages 372–377, Detroit, MI, 1989.
F. Giunchiglia and T. Walsh. A theory of abstraction. Artificial Intelligence, 56(2–3):323–390, October 1992.
J. Larrosa. Merging constraint satisfaction subproblems to avoid redundant search. In Proc. of IJCAI’97, pages 424–429, Nagoya, Japan, 1997.
A.K. Mackworh. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.
K. Marriott. Frameworks for abstract interpretation. Acta Informatica, 30:103–129, 1993.
K. Marriott. Abstract interpretation: a theory of approximate computation. In Proc. of SAS’97, pages 367–378, Paris, France, 1997.
U. Montanari. Network of constraints: Fundamental properties and applications to picture processing. Information Science, 7:95–132, 1974.
P. Prosser. An empirical study of phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81, 1996.
R. Shrag and D. Miranker. Abstraction and the csp phase transition boundary. In Proc. of AI/Math’96, pages 138–141, 1996.
B. Smith and M. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81, 1996.
R. Weigel and B.V. Faltings. Structuring techniques for constraint satisfaction problems. In Proc. of IJCAI’97, pages 418–423, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lecoutre, C., Merchez, S., Boussemart, F., Grégoire, E. (2000). A CSP Abstraction Framework. In: Choueiry, B.Y., Walsh, T. (eds) Abstraction, Reformulation, and Approximation. SARA 2000. Lecture Notes in Computer Science(), vol 1864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44914-0_10
Download citation
DOI: https://doi.org/10.1007/3-540-44914-0_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67839-7
Online ISBN: 978-3-540-44914-0
eBook Packages: Springer Book Archive