Cargando…

The Complexity of Valued Constraint Satisfaction Problems

The topic of this book is the following optimisation problem: given a set of discrete variables and a set of functions, each depending on a subset of the variables, minimise the sum of the functions over all variables. This fundamental research problem has been studied within several different conte...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Živný, Stanislav (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Edición:1st ed. 2012.
Colección:Cognitive Technologies,
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-642-33974-5
003 DE-He213
005 20220117152130.0
007 cr nn 008mamaa
008 121026s2012 gw | s |||| 0|eng d
020 |a 9783642339745  |9 978-3-642-33974-5 
024 7 |a 10.1007/978-3-642-33974-5  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
100 1 |a Živný, Stanislav.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 4 |a The Complexity of Valued Constraint Satisfaction Problems  |h [electronic resource] /  |c by Stanislav Živný. 
250 |a 1st ed. 2012. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2012. 
300 |a XVIII, 170 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Cognitive Technologies,  |x 2197-6635 
505 0 |a Chap. 1 Introduction -- Chap. 2 Background -- Chap. 3 Expressibility of Valued Constraints -- Chap. 4 Expressibility of Fixed-Arity Languages -- Chap. 5 Expressibility of Submodular Languages -- Chap. 6 Non-expressibility of Submodular Languages -- Chap. 7 Tractable Languages -- Chap. 8  Conservative Languages -- Chap. 9 The Power of Linear Programming -- Chap. 10 Hybrid Tractability -- Chap. 11 Summary and Open Problems -- References -- Index. 
520 |a The topic of this book is the following optimisation problem: given a set of discrete variables and a set of functions, each depending on a subset of the variables, minimise the sum of the functions over all variables. This fundamental research problem has been studied within several different contexts of discrete mathematics, computer science and artificial intelligence under different names: Min-Sum problems, MAP inference in Markov random fields (MRFs) and conditional random fields (CRFs), Gibbs energy minimisation, valued constraint satisfaction problems (VCSPs), and, for two-state variables, pseudo-Boolean optimisation. In this book the author presents general techniques for analysing the structure of such functions and the computational complexity of the minimisation problem, and he gives a comprehensive list of tractable cases. Moreover, he demonstrates that the so-called algebraic approach to VCSPs can be used not only for the search for tractable  VCSPs, but also for other questions such as finding the boundaries to the applicability of certain algorithmic techniques. The book is suitable for researchers interested in methods and results from the area of constraint programming and discrete optimisation. 
650 0 |a Computer science. 
650 0 |a Artificial intelligence. 
650 0 |a Mathematical logic. 
650 0 |a Computer science-Mathematics. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Artificial Intelligence. 
650 2 4 |a Mathematical Logic and Foundations. 
650 2 4 |a Mathematics of Computing. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642339752 
776 0 8 |i Printed edition:  |z 9783642434563 
776 0 8 |i Printed edition:  |z 9783642339738 
830 0 |a Cognitive Technologies,  |x 2197-6635 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-642-33974-5  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)