Soft constraints: Complexity and multimorphisms
UNSPECIFIED (2003) Soft constraints: Complexity and multimorphisms. In: 9th International Conference on Principles and Practice of Constraint Programming, KINSALE, IRELAND, SEP 29-OCT 03, 2003. Published in: PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS, 2833 pp. 244-258.Full text not available from this repository.
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of classical (crisp) constraint satisfaction problems with specified constraint types. One very powerful theoretical development in this area links the complexity of a set of classical constraints to a corresponding set of algebraic operations, known as polymorphisms.
In this paper we begin a systematic investigation of the complexity of combinatorial optimisation problems expressed using various forms of soft constraints. We extend the notion of a polymorphism by introducing a more general algebraic operation, which we call a multimorphism. We show that a number of maximal tractable sets of soft constraints, both established and novel, can be characterised by the presence of particular multimorphisms.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS|
|Number of Pages:||15|
|Page Range:||pp. 244-258|
|Title of Event:||9th International Conference on Principles and Practice of Constraint Programming|
|Location of Event:||KINSALE, IRELAND|
|Date(s) of Event:||SEP 29-OCT 03, 2003|
Actions (login required)