- 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
On the parallel complexity of discrete relaxation in constraint satisfaction networks
Artificial Intelligence 45 (3):275-286 (1990)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Local consistency in parallel constraint satisfaction networks.Simon Kasif & Arthur L. Delcher - 1994 - Artificial Intelligence 69 (1-2):307-327.
Fast parallel constraint satisfaction.Lefteris M. Kirousis - 1993 - Artificial Intelligence 64 (1):147-160.
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.
The complexity of constraint satisfaction revisited.Alan K. Mackworth & Eugene C. Freuder - 1993 - Artificial Intelligence 59 (1-2):57-62.
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 relaxation may be perfect.Ugo Montanari & Francesca Rossi - 1991 - Artificial Intelligence 48 (2):143-170.
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.
Analytics
Added to PP
2020-12-22
Downloads
5 (#847,061)
6 months
4 (#1,635,958)
2020-12-22
Downloads
5 (#847,061)
6 months
4 (#1,635,958)
Historical graph of downloads
Citations of this work
Arc consistency: parallelism and domain dependence.Paul R. Cooper & Michael J. Swain - 1992 - Artificial Intelligence 58 (1-3):207-235.
A generic arc-consistency algorithm and its specializations.Pascal Van Hentenryck, Yves Deville & Choh-Man Teng - 1992 - Artificial Intelligence 57 (2-3):291-321.
Fast parallel constraint satisfaction.Lefteris M. Kirousis - 1993 - Artificial Intelligence 64 (1):147-160.
The complexity of constraint satisfaction revisited.Alan K. Mackworth & Eugene C. Freuder - 1993 - Artificial Intelligence 59 (1-2):57-62.
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.
Symbolic reasoning among 3-D models and 2-D images.Rodney A. Brooks - 1981 - Artificial Intelligence 17 (1-3):285-348.
Constraint satisfaction from a deductive viewpoint.W. Bibel - 1988 - Artificial Intelligence 35 (3):401-413.
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-zhzfn uwo