LEADER 04622nam  22008655  450 
001 996465424103316
005 20230406000019.0
010   $a3-540-92800-6
024 7 $a10.1007/978-3-540-92800-3
035   $a(CKB)1000000000545785
035   $a(SSID)ssj0000316742
035   $a(PQKBManifestationID)11238010
035   $a(PQKBTitleCode)TC0000316742
035   $a(PQKBWorkID)10275411
035   $a(PQKB)10208004
035   $a(DE-He213)978-3-540-92800-3
035   $a(MiAaPQ)EBC3063837
035   $a(MiAaPQ)EBC6708732
035   $a(Au-PeEL)EBL6708732
035   $a(PPN)132861909
035   $a(EXLCZ)991000000000545785
100   $a20100301d2008      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aComplexity of Constraints$b[electronic resource] $eAn Overview of Current Research Themes /$fedited by Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
205   $a1st ed. 2008.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008.
215   $a1 online resource (VII, 321 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5250
300   $aIncludes index.
311   $a3-540-92799-9 
320   $aIncludes bibliographical references and index.
327   $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.
330   $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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5250
606   $aComputer programming
606   $aAlgorithms
606   $aArtificial intelligence?Data processing
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aArtificial intelligence
606   $aComputer graphics
606   $aProgramming Techniques
606   $aAlgorithms
606   $aData Science
606   $aDiscrete Mathematics in Computer Science
606   $aArtificial Intelligence
606   $aComputer Graphics
615  0$aComputer programming.
615  0$aAlgorithms.
615  0$aArtificial intelligence?Data processing.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aArtificial intelligence.
615  0$aComputer graphics.
615 14$aProgramming Techniques.
615 24$aAlgorithms.
615 24$aData Science.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aArtificial Intelligence.
615 24$aComputer Graphics.
676   $a004.33
702   $aKolaitis$b Phokion
702   $aCreignou$b Nadia
702   $aVollmer$b Heribert$f1964-
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996465424103316
996   $aComplexity of Constraints$9774103
997   $aUNISA