Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5250)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
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.
Keywords
- Ringe
- algorithmics
- algorithms
- approximation
- artificial intelligence
- combinatorial complexity theory
- complexity
- computational biology
- computational complexity
- computational graph theory
- computational linguistics
- constraint processing
- constraint satisfaction problem
- data mining
- optimization
- algorithm analysis and problem complexity
- data structures
Table of contents (11 chapters)
-
Front Matter
-
Back Matter
Editors and Affiliations
Bibliographic Information
Book Title: Complexity of Constraints
Book Subtitle: An Overview of Current Research Themes
Editors: Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-540-92800-3
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2008
Softcover ISBN: 978-3-540-92799-0Published: 18 December 2008
eBook ISBN: 978-3-540-92800-3Published: 23 December 2008
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VII, 321
Topics: Programming Techniques, Algorithm Analysis and Problem Complexity, Data Structures, Discrete Mathematics in Computer Science, Artificial Intelligence, Computer Graphics