1 option
The Complexity of Valued Constraint Satisfaction Problems / by Stanislav Živný.
SpringerLink Books Computer Science (2011-2024) Available online
SpringerLink Books Computer Science (2011-2024)- Format:
- Book
- Author/Creator:
- Živný, Stanislav, author.
- Series:
- Computer Science (Springer-11645)
- Cognitive technologies 1611-2482
- Cognitive Technologies, 1611-2482
- Language:
- English
- Subjects (All):
- Computers.
- Artificial intelligence.
- Logic, Symbolic and mathematical.
- Computer science--Mathematics.
- Theory of Computation.
- Artificial Intelligence.
- Mathematical Logic and Foundations.
- Mathematics of Computing.
- Local Subjects:
- Theory of Computation.
- Artificial Intelligence.
- Mathematical Logic and Foundations.
- Mathematics of Computing.
- Physical Description:
- 1 online resource (XVIII, 170 pages).
- Edition:
- First edition 2012.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-33974-5
- 9783642339745
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.