Abstract
Let V = {x1,...,x n } be a set of variables that range over a set of values D = {d1,...,d q }. A constraint is an expression of the type \(R(x_{i_1},\ldots,x_{i_r})\), where R ⊆ Dr is a relation on the domain set D and \(x_{i_1},\ldots,x_{i_r}\) are variables in V. The space of assignments, or configurations, is the set of all mappings σ: V →D. We say that σ satisfies the constraint \(R(x_{i_1},\ldots,x_{i_r})\) if \((\sigma(x_{i_1}),\ldots,\sigma(x_{i_r})) \in R\). Otherwise we say that it falsifies it. On a given system of constraints we face a number of important computational problems.
Chapter PDF
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Atserias, A. (2009). Four Subareas of the Theory of Constraints, and Their Links. In: Královič, R., Niwiński, D. (eds) Mathematical Foundations of Computer Science 2009. MFCS 2009. Lecture Notes in Computer Science, vol 5734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03816-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-03816-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03815-0
Online ISBN: 978-3-642-03816-7
eBook Packages: Computer ScienceComputer Science (R0)