FEEDBACK Smiley face
Normal view MARC view ISBD view

Complexity of Constraints [electronic resource] :An Overview of Current Research Themes /

Contributor(s): Creignou, Nadia [editor.] | Kolaitis, Phokion G [editor.] | Vollmer, Heribert [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 5250Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.Description: VII, 321 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540928003.Subject(s): Computer science | Computer programming | Data structures (Computer science) | Algorithms | Computer science -- Mathematics | Artificial intelligence | Computer graphics | Computer Science | Programming Techniques | Algorithm Analysis and Problem Complexity | Data Structures | Discrete Mathematics in Computer Science | Artificial Intelligence (incl. Robotics) | Computer GraphicsOnline resources: Click here to access online
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.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in