Skip to main content
  • Book
  • © 2008

Complexity of Constraints

An Overview of Current Research Themes

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)

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (11 chapters)

  1. Front Matter

  2. Introduction

    • N. Creignou
    Pages 1-2
  3. Basics of Galois Connections

    • Ferdinand Börner
    Pages 38-67
  4. Recent Results on the Algebraic Approach to the CSP

    • Andrei A. Bulatov, Matthew A. Valeriote
    Pages 68-92
  5. Dualities for Constraint Satisfaction Problems

    • Andrei A. Bulatov, Andrei Krokhin, Benoit Larose
    Pages 93-124
  6. A Logical Approach to Constraint Satisfaction

    • Phokion G. Kolaitis, Moshe Y. Vardi
    Pages 125-155
  7. Uniform Constraint Satisfaction Problems and Database Theory

    • Francesco Scarcello, Georg Gottlob, Gianluigi Greco
    Pages 156-195
  8. Partial Polymorphisms and Constraint Satisfaction Problems

    • Henning Schnoor, Ilka Schnoor
    Pages 229-254
  9. Introduction to the Maximum Solution Problem

    • Peter Jonsson, Gustav Nordh
    Pages 255-282
  10. Present and Future of Practical SAT Solving

    • 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.

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

Editors and Affiliations

  • LIF (CNRS UMR 6166), Aix-Marseille Université, Marseille, France

    Nadia Creignou

  • IBM Almaden Research Center, Computer Science Principles and Methodologies, and Computer Science Department, University of California, Santa Cruz, USA

    Phokion G. Kolaitis

  • Institut für Theoretische Informatik, Leibniz, Universität Hannover, Hannover, Germany

    Heribert Vollmer

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions