D. Cohen
The complexity of soft constraint satisfaction
Cohen, D.; Cooper, M.; Jeavons, P.; Krokhin, A.
Abstract
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint types. One very powerful theoretical development in this area links the complexity of a set of constraints to a corresponding set of algebraic operations, known as polymorphisms. In this paper we extend the analysis of complexity to the more general framework of combinatorial optimisation problems expressed using various forms of soft constraints. We launch a systematic investigation of the complexity of these problems by extending the notion of a polymorphism to a more general algebraic operation, which we call a multimorphism. We show that many tractable sets of soft constraints, both established and novel, can be characterised by the presence of particular multimorphisms. We also show that a simple set of NP-hard constraints has very restricted multimorphisms. Finally, we use the notion of multimorphism to give a complete classification of complexity for the Boolean case which extends several earlier classification results for particular special cases.
Journal Article Type | Article |
---|---|
Publication Date | 2006-08 |
Deposit Date | Aug 24, 2006 |
Journal | Artificial Intelligence |
Print ISSN | 0004-3702 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 170 |
Issue | 11 |
Pages | 983-1016 |
DOI | https://doi.org/10.1016/j.artint.2006.04.002 |
Keywords | Soft constraints, Valued constraint satisfaction, Combinatorial optimisation, Submodular functions, Tractability, Multimorphism. |
Public URL | https://durham-repository.worktribe.com/output/1554880 |
You might also like
Algebraic approach to promise constraint satisfaction
(2019)
Presentation / Conference Contribution
The complexity of 3-colouring H-colourable graphs
(2020)
Presentation / Conference Contribution
Robust algorithms with polynomial loss for near-unanimity CSPs
(2017)
Presentation / Conference Contribution
The Complexity of General-Valued CSPs
(2015)
Presentation / Conference Contribution
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search