About this book
Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems to circuit design, network optimization, and theory of programming languages. Consequently, it is important to analyze and pinpoint the computational complexity of certain algorithmic tasks related to constraint satisfaction. The complexity-theoretic results of these tasks may have a direct impact on, for instance, the design and processing of database query languages, or strategies in data-mining, or the design and implementation of planners.
This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006. A number of speakers were solicited to write surveys presenting the state of the art in their area of expertise. These contributions were peer-reviewed by experts in the field and revised before they were collated to the 9 papers of this volume. In addition, the volume contains a reprint of a survey by Kolaitis and Vardi on the logical approach to constraint satisfaction that first appeared in 'Finite Model Theory and its Applications', published by Springer in 2007.
Editors and affiliations
- DOI https://doi.org/10.1007/978-3-540-92800-3
- Copyright Information Springer-Verlag Berlin Heidelberg 2008
- Publisher Name Springer, Berlin, Heidelberg
- eBook Packages Computer Science
- Print ISBN 978-3-540-92799-0
- Online ISBN 978-3-540-92800-3
- Series Print ISSN 0302-9743
- Series Online ISSN 1611-3349
- About this book