Abstract
Abstraction is a process where problems are modified in some way to make them easier to solve. For our purposes, we look at abstraction as adding constraints in such a manner as to reduce the number of solutions, or removing constraints in order to make more solutions valid. It is a form of simplification, where certain details of a problem are ignored, or temporarily cast aside, in order to make the problem less difficult to solve. The central idea in this paper is to use constraints in order find candidate abstractions of a problem, making the abstraction process quicker, easier, and more efficient.
This work has been supported by Science Foundation Ireland under Grant 00/PI.1/C075 and ILOG, SA.
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
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gibbons, J. (2003). Abstracting Constraints Using Constraints. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_96
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_96
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive