skip to content
The complexity of valued constraint satisfaction problems Preview this item
ClosePreview this item
Checking...

The complexity of valued constraint satisfaction problems

Author: Stanislav Živný
Publisher: Heidelberg ; New York : Springer, ©2012.
Series: Cognitive technologies.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Database:WorldCat
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Stanislav Živný
ISBN: 9783642339745 3642339743
OCLC Number: 818413991
Description: 1 online resource (xvii, 170 p.)
Contents: Background --
Expressive power --
Expressibility of valued constraints --
Expressibility of fixed-Arity languages --
Expressibility of submodular languages --
Non-expressibility of submodular languages --
Tractability --
Tractable languages --
Conservative languages --
The power of linear programming --
Hybrid tractability --
Summary and open problems.
Series Title: Cognitive technologies.
Responsibility: Stanislav Živný.
More information:

Abstract:

This book presents general methods for analysing the complexity of optimisation problems cast as valued constraint satisfaction problems (VCSPs). It is an ideal resource for researchers in constraint  Read more...

Reviews

Editorial reviews

Publisher Synopsis

From the reviews: "The book is concerned with valued constraint satisfaction problems with finite domains, i. e., the problem of minimising the sum of functions that each depend on some subset of a Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/818413991>
library:oclcnum"818413991"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/818413991>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
<http://id.loc.gov/authorities/subjects/sh92001623>
rdf:typeschema:Intangible
schema:name"Constraints (Artificial intelligence)--Mathematics."@en
schema:about
schema:bookFormatschema:EBook
schema:copyrightYear"2012"
schema:creator
schema:datePublished"2012"
schema:description"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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1182123718>
schema:genre"Electronic books."@en
schema:inLanguage"en"
schema:name"The complexity of valued constraint satisfaction problems"@en
schema:numberOfPages"170"
schema:publisher
schema:url<http://dx.doi.org/10.1007/978-3-642-33974-5>
schema:url<http://site.ebrary.com/id/10614882>
schema:url<http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=538342>
schema:url
schema:url<http://oclc-marc.ebrary.com/id/10614882>
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.