Complexity of Constraints An Overview of Current Research Themes /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Creignou, Nadia (Επιμελητής έκδοσης), Kolaitis, Phokion G. (Επιμελητής έκδοσης), Vollmer, Heribert (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
• Σειρά: Lecture Notes in Computer Science, 5250
• Θέματα: 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 Graphics.

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

Πίνακας περιεχομένων:

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