Journal article icon

Journal article

An algebraic characterisation of complexity for valued constraints

Abstract:

Classical constraint satisfaction is concerned with the feasibility of satisfying a collection of constraints. The extension of this framework to include optimisation is now also being investigated and a theory of so-called soft constraints is being developed. In this extended framework, tuples of values allowed by constraints are given desirability weightings, or costs, and the goal is to find the most desirable (or least cost) assignment. The complexity of any optimisation problem depends c...

Expand abstract
Publication status:
Published

Actions


Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
Journal:
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2006
Volume:
4204
Pages:
107-121
Publication date:
2006-01-01
EISSN:
1611-3349
ISSN:
0302-9743
URN:
uuid:aa06b648-bdee-4764-964e-0a5d23fae270
Source identifiers:
285729
Local pid:
pubs:285729
Language:
English

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP