- 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 constraint satisfaction revisited
Artificial Intelligence 59 (1-2):57-62 (1993)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
The complexity of soft constraint satisfaction.David A. Cohen, Martin C. Cooper, Peter G. Jeavons & Andrei A. Krokhin - 2006 - Artificial Intelligence 170 (11):983-1016.
On the phase transitions of random k-constraint satisfaction problems.Yun Fan & Jing Shen - 2011 - Artificial Intelligence 175 (3-4):914-927.
The complexity of constraint satisfaction problems for small relation algebras.M. Cristani & R. Hirsch - 2004 - Artificial Intelligence 156 (2):177-196.
On the parallel complexity of discrete relaxation in constraint satisfaction networks.Simon Kasif - 1990 - Artificial Intelligence 45 (3):275-286.
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.
Analytics
Added to PP
2020-12-22
Downloads
6 (#711,559)
6 months
7 (#1,397,300)
2020-12-22
Downloads
6 (#711,559)
6 months
7 (#1,397,300)
Historical graph of downloads
Citations of this work
Automatic generation of dominance breaking nogoods for a class of constraint optimization problems.Jimmy H. M. Lee & Allen Z. Zhong - 2023 - Artificial Intelligence 323 (C):103974.
Using constraint metaknowledge to reduce arc consistency computation.Christian Bessiére, Eugene C. Freuder & Jean-Charles Regin - 1999 - Artificial Intelligence 107 (1):125-148.
The complexity of soft constraint satisfaction.David A. Cohen, Martin C. Cooper, Peter G. Jeavons & Andrei A. Krokhin - 2006 - Artificial Intelligence 170 (11):983-1016.
Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes.P. Parodi, R. Lancewicki, A. Vijh & J. K. Tsotsos - 1998 - Artificial Intelligence 105 (1-2):47-75.
References found in this work
Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
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.
Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
Arc and path consistency revisited.Roger Mohr & Thomas C. Henderson - 1986 - Artificial Intelligence 28 (2):225-233.
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-68866f4b87-s5tms uwo