Complexity of Constraints An Overview of Current Research Themes /

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Creignou, Nadia (Editor ), Kolaitis, Phokion G. (Editor ), Vollmer, Heribert (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
Edición:1st ed. 2008.
Colección:Theoretical Computer Science and General Issues, 5250
Temas:
Computer programming.
Algorithms.
Artificial intelligence-Data processing.
Computer science-Mathematics.
Discrete mathematics.
Artificial intelligence.
Computer graphics.
Programming Techniques.
Data Science.
Discrete Mathematics in Computer Science.
Artificial Intelligence.
Computer Graphics.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares