000 03959nam a22006015i 4500
001 978-3-540-92800-3
003 DE-He213
005 20160624102126.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540928003
_9978-3-540-92800-3
024 7 _a10.1007/978-3-540-92800-3
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aComplexity of Constraints
_h[electronic resource] :
_bAn Overview of Current Research Themes /
_cedited by Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5250
505 0 _aBoolean 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.
520 _aNowadays 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.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aElectronic data processing.
650 0 _aComputational complexity.
650 0 _aArtificial intelligence.
650 0 _aComputer graphics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aData Structures.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aComputer Graphics.
650 2 4 _aNumeric Computing.
700 1 _aCreignou, Nadia.
_eeditor.
700 1 _aKolaitis, Phokion G.
_eeditor.
700 1 _aVollmer, Heribert.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540927990
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5250
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-92800-3
942 _2EBK8373
_cEBK
999 _c37667
_d37667