- 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
Fast parallel constraint satisfaction
Artificial Intelligence 64 (1):147-160 (1993)
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.
On the parallel complexity of discrete relaxation in constraint satisfaction networks.Simon Kasif - 1990 - Artificial Intelligence 45 (3):275-286.
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.
The complexity of constraint satisfaction revisited.Alan K. Mackworth & Eugene C. Freuder - 1993 - Artificial Intelligence 59 (1-2):57-62.
Analog retrieval by constraint satisfaction.Paul Thagard, Keith J. Holyoak, Greg Nelson & David Gochfeld - 1990 - Artificial Intelligence 46 (3):259-310.
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.
Constraint satisfaction from a deductive viewpoint.W. Bibel - 1988 - Artificial Intelligence 35 (3):401-413.
Analytics
Added to PP
2020-12-22
Downloads
11 (#1,150,279)
6 months
9 (#439,104)
2020-12-22
Downloads
11 (#1,150,279)
6 months
9 (#439,104)
Historical graph of downloads
Citations of this work
Tractable constraints on ordered domains.Peter G. Jeavons & Martin C. Cooper - 1995 - Artificial Intelligence 79 (2):327-339.
Constraints, consistency and closure.Peter Jeavons, David Cohen & Martin C. Cooper - 1998 - Artificial Intelligence 101 (1-2):251-265.
Characterising tractable constraints.Martin C. Cooper, David A. Cohen & Peter G. Jeavons - 1994 - Artificial Intelligence 65 (2):347-361.
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.
Uncovering trees in constraint networks.Itay Meiri, Rina Dechter & Judea Pearl - 1996 - Artificial Intelligence 86 (2):245-267.
References found in this work
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.
Arc and path consistency revisited.Roger Mohr & Thomas C. Henderson - 1986 - Artificial Intelligence 28 (2):225-233.
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.
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-6686886f5-ktvwr uwo