- 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 forward checking for non-binary constraint satisfaction
Artificial Intelligence 141 (1-2):205-224 (2002)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Locating the phase transition in binary constraint satisfaction problems.Barbara M. Smith & Martin E. Dyer - 1996 - Artificial Intelligence 81 (1-2):155-181.
An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.
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.
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.
The complexity of constraint satisfaction revisited.Alan K. Mackworth & Eugene C. Freuder - 1993 - Artificial Intelligence 59 (1-2):57-62.
Analytics
Added to PP
2020-12-22
Downloads
7 (#1,412,480)
6 months
6 (#587,779)
2020-12-22
Downloads
7 (#1,412,480)
6 months
6 (#587,779)
Historical graph of downloads
Citations of this work
Efficient solution techniques for disjunctive temporal reasoning problems.Ioannis Tsamardinos & Martha E. Pollack - 2003 - Artificial Intelligence 151 (1-2):43-89.
Computing and restoring global inverse consistency in interactive constraint satisfaction.Christian Bessiere, Hélène Fargier & Christophe Lecoutre - 2016 - Artificial Intelligence 241 (C):153-169.
Domain filtering consistencies for non-binary constraints.Christian Bessiere, Kostas Stergiou & Toby Walsh - 2008 - Artificial Intelligence 172 (6-7):800-822.
References found in this work
Increasing tree search efficiency for constraint satisfaction problems.Robert M. Haralick & Gordon L. Elliott - 1980 - Artificial Intelligence 14 (3):263-313.
A theoretical evaluation of selected backtracking algorithms.Grzegorz Kondrak & Peter van Beek - 1997 - Artificial Intelligence 89 (1-2):365-387.
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-x7cz5 uwo