The complexity of soft constraint satisfaction

, , &
Artificial Intelligence 170 (11):983-1016 (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2006.04.002

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,881

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The complexity of recursive constraint satisfaction problems.Victor W. Marek & Jeffrey B. Remmel - 2010 - Annals of Pure and Applied Logic 161 (3):447-457.
The Constraint Satisfaction Problem and Universal Algebra.Libor Barto - 2015 - Bulletin of Symbolic Logic 21 (3):319-337.
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination.Martin C. Cooper, Peter G. Jeavons & András Z. Salamon - 2010 - Artificial Intelligence 174 (9-10):570-584.
Decomposing constraint satisfaction problems using database techniques.Marc Gyssens, Peter G. Jeavons & David A. Cohen - 1994 - Artificial Intelligence 66 (1):57-89.
Complexity classification in qualitative temporal constraint reasoning.Peter Jonsson & Andrei Krokhin - 2004 - Artificial Intelligence 160 (1-2):35-51.
Variable-Centered Consistency in Model RB.Liang Li, Tian Liu & Ke Xu - 2013 - Minds and Machines 23 (1):95-103.
An initial study of time complexity in infinite-domain constraint satisfaction.Peter Jonsson & Victor Lagerkvist - 2017 - Artificial Intelligence 245 (C):115-133.
The complexity of constraint satisfaction revisited.Alan K. Mackworth & Eugene C. Freuder - 1993 - Artificial Intelligence 59 (1-2):57-62.
On the parallel complexity of discrete relaxation in constraint satisfaction networks.Simon Kasif - 1990 - Artificial Intelligence 45 (3):275-286.
The complexity of constraint satisfaction problems for small relation algebras.M. Cristani & R. Hirsch - 2004 - Artificial Intelligence 156 (2):177-196.
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems.Alan K. Mackworth & Eugene C. Freuder - 1985 - Artificial Intelligence 25 (1):65-74.
Domain permutation reduction for constraint satisfaction problems.Martin J. Green & David A. Cohen - 2008 - Artificial Intelligence 172 (8-9):1094-1118.
A Compactness Theorem For Infinite Constraint Satisfaction.Robert Cowen - 1998 - Reports on Mathematical Logic:97-107.
Fundamental properties of neighbourhood substitution in constraint satisfaction problems.Martin C. Cooper - 1997 - Artificial Intelligence 90 (1-2):1-24.
Coherence: The price is right.Paul Thagard - 2012 - Southern Journal of Philosophy 50 (1):42-49.

Analytics

Added to PP
2020-12-22

Downloads
7 (#1,387,044)

6 months
6 (#520,848)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Preferences in AI: An overview.Carmel Domshlak, Eyke Hüllermeier, Souhila Kaci & Henri Prade - 2011 - Artificial Intelligence 175 (7-8):1037-1052.
Soft arc consistency revisited.M. C. Cooper, S. de Givry, M. Sanchez, T. Schiex, M. Zytnicki & T. Werner - 2010 - Artificial Intelligence 174 (7-8):449-478.
Hybrid tractability of valued constraint problems.Martin C. Cooper & Stanislav Živný - 2011 - Artificial Intelligence 175 (9-10):1555-1569.

Add more citations

References found in this work

Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
Tractable constraints on ordered domains.Peter G. Jeavons & Martin C. Cooper - 1995 - Artificial Intelligence 79 (2):327-339.
Fast parallel constraint satisfaction.Lefteris M. Kirousis - 1993 - Artificial Intelligence 64 (1):147-160.
Constraints, consistency and closure.Peter Jeavons, David Cohen & Martin C. Cooper - 1998 - Artificial Intelligence 101 (1-2):251-265.

View all 9 references / Add more references