The complexity of soft constraint satisfaction

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

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,401

External links

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

Through your library

Analytics

Added to PP
2020-12-22

Downloads
14 (#1,321,670)

6 months
3 (#1,061,821)

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.

View all 9 references / Add more references