Complexity of Constraints

An Overview of Current Research Themes

  • Nadia Creignou
  • Phokion G. Kolaitis
  • Heribert Vollmer

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5250)

Table of contents

  1. Front Matter
  2. N. Creignou
    Pages 1-2
  3. Ferdinand Börner
    Pages 38-67
  4. Andrei A. Bulatov, Matthew A. Valeriote
    Pages 68-92
  5. Andrei A. Bulatov, Andrei Krokhin, Benoit Larose
    Pages 93-124
  6. Phokion G. Kolaitis, Moshe Y. Vardi
    Pages 125-155
  7. Francesco Scarcello, Georg Gottlob, Gianluigi Greco
    Pages 156-195
  8. Henning Schnoor, Ilka Schnoor
    Pages 229-254
  9. Peter Jonsson, Gustav Nordh
    Pages 255-282
  10. Oliver Kullmann
    Pages 283-319
  11. Back Matter

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.


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

Editors and affiliations

  • Nadia Creignou
    • 1
  • Phokion G. Kolaitis
    • 2
  • Heribert Vollmer
    • 3
  1. 1.LIF (CNRS UMR 6166)Aix-Marseille UniversitéMarseilleFrance
  2. 2.IBM Almaden Research Center, Computer Science Principles and Methodologies, and Computer Science DepartmentUniversity of CaliforniaSanta CruzUSA
  3. 3.Institut für Theoretische Informatik, LeibnizUniversität HannoverHannoverGermany

Bibliographic information

  • DOI
  • 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
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking
IT & Software