Valued Constraint Satisfaction Problems: Hard and Easy Problems

by: Thomas Schiex, Hélène Fargier, Gerard Verfaillie

edited by: Chris Mellish

(1995)

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

lcigler

Find related articles with these CiteULike tags

constraints, softconstraints

Abstract

In order to deal with over-constrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities... Each extension uses a specific mathematical operator (+,max...) to aggregate constraint violations. In this paper, we consider a simple algebraic framework, related to Partial Constraint Satisfaction, which subsumes most of these proposals and use it to characterize existing proposals in...

@inproceedings{schiex95vcsp, abstract = {In order to deal with over-constrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities... Each extension uses a specific mathematical operator (+,max...) to aggregate constraint violations. In this paper, we consider a simple algebraic framework, related to Partial Constraint Satisfaction, which subsumes most of these proposals and use it to characterize existing proposals in...}, address = {Montreal}, author = {Schiex, Thomas and Fargier, H\'{e}l{\`{e}}ne and Verfaillie, Gerard }, booktitle = {IJCAI'95: Proceedings International Joint Conference on Artificial Intelligence}, citeulike-article-id = {2628851}, editor = {Mellish, Chris }, keywords = {constraints, softconstraints}, posted-at = {2008-04-04 09:21:23}, priority = {2}, title = {Valued Constraint Satisfaction Problems: Hard and Easy Problems}, url = {http://citeseer.ist.psu.edu/schiex95valued.html}, year = {1995} }

RIS record

TY - CONF ID - schiex95vcsp L3 - citeulike-article-id:2628851 TI - Valued Constraint Satisfaction Problems: Hard and Easy Problems T2 - IJCAI'95: Proceedings International Joint Conference on Artificial Intelligence AD - Montreal N2 - In order to deal with over-constrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities... Each extension uses a specific mathematical operator (+,max...) to aggregate constraint violations. In this paper, we consider a simple algebraic framework, related to Partial Constraint Satisfaction, which subsumes most of these proposals and use it to characterize existing proposals in... KW - constraints KW - softconstraints AU - Schiex, Thomas AU - Fargier, H\'{e}l{\`{e}}ne AU - Verfaillie, Gerard A2 - Mellish, Chris PY - 1995/// UR - http://citeseer.ist.psu.edu/schiex95valued.html ER -

RIS BibTeX