- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The complexity of soft constraint satisfaction
Artificial Intelligence 170 (11):983-1016 (2006)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
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.
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 some polynomial network consistency algorithms for constraint satisfaction problems.Alan K. Mackworth & Eugene C. Freuder - 1985 - Artificial Intelligence 25 (1):65-74.
Constraint satisfaction using constraint logic programming.Pascal Van Hentenryck, Helmut Simonis & Mehmet Dincbas - 1992 - Artificial Intelligence 58 (1-3):113-159.
Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
The logic of constraint satisfaction.Alan K. Mackworth - 1992 - Artificial Intelligence 58 (1-3):3-20.
Compiling constraint satisfaction problems.Rainer Weigel & Boi Faltings - 1999 - Artificial Intelligence 115 (2):257-287.
Fast parallel constraint satisfaction.Lefteris M. Kirousis - 1993 - Artificial Intelligence 64 (1):147-160.
Analytics
Added to PP
2020-12-22
Downloads
14 (#1,321,670)
6 months
3 (#1,061,821)
2020-12-22
Downloads
14 (#1,321,670)
6 months
3 (#1,061,821)
Historical graph of 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.
Tractability of explaining classifier decisions.Martin C. Cooper & João Marques-Silva - 2023 - Artificial Intelligence 316 (C):103841.
Hybrid tractability of valued constraint problems.Martin C. Cooper & Stanislav Živný - 2011 - Artificial Intelligence 175 (9-10):1555-1569.
References found in this work
Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
A generic arc-consistency algorithm and its specializations.Pascal Van Hentenryck, Yves Deville & Choh-Man Teng - 1992 - Artificial Intelligence 57 (2-3):291-321.
Tractable constraints on ordered domains.Peter G. Jeavons & Martin C. Cooper - 1995 - Artificial Intelligence 79 (2):327-339.
Solving weighted CSP by maintaining arc consistency.Javier Larrosa & Thomas Schiex - 2004 - Artificial Intelligence 159 (1-2):1-26.
Fast parallel constraint satisfaction.Lefteris M. Kirousis - 1993 - Artificial Intelligence 64 (1):147-160.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-8567d8d854-f747c dc2