Complexity of Constraints : An Overview of Current Research Themes / edited by Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer.

Format:

Book

Contributor:

Creignou, Nadia, editor.

Kolaitis, Phokion G., editor.

Vollmer, Heribert, 1964- editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 5250.

Theoretical Computer Science and General Issues ; 5250

Language:

English

Subjects (All):

Computer programming.

Algorithms.

Data structures (Computer science).

Computer science--Mathematics.

Computer science.

Artificial intelligence.

Computer graphics.

Programming Techniques.

Algorithm Analysis and Problem Complexity.

Data Structures.

Discrete Mathematics in Computer Science.

Artificial Intelligence.

Computer Graphics.

Local Subjects:

Programming Techniques.

Algorithm Analysis and Problem Complexity.

Data Structures.

Discrete Mathematics in Computer Science.

Artificial Intelligence.

Computer Graphics.

Physical Description:

1 online resource (VII, 321 pages).

Edition:

First edition 2008.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.

System Details:

text file PDF

Summary:

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.

Contents:

Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?

Basics of Galois Connections

Recent Results on the Algebraic Approach to the CSP

Dualities for Constraint Satisfaction Problems

A Logical Approach to Constraint Satisfaction

Uniform Constraint Satisfaction Problems and Database Theory

Constraint Satisfaction Problems with Infinite Templates

Partial Polymorphisms and Constraint Satisfaction Problems

to the Maximum Solution Problem

Present and Future of Practical SAT Solving.

Other Format:

Printed edition:

ISBN:

978-3-540-92800-3

9783540928003

Access Restriction:

Restricted for use by site license.