- 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
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence 165 (2):165-185 (2005)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Granularity problems.Jens Christian Bjerring & Wolfgang Schwarz - 2017 - Philosophical Quarterly 67 (266):22-37.
Affect and Sensation: Plato’s Embodied Cognition.Ian McCready-Flora - 2018 - Phronesis 63 (2):117-147.
Consistency, optimality, and incompleteness.Yijia Chen, Jörg Flum & Moritz Müller - 2013 - Annals of Pure and Applied Logic 164 (12):1224-1235.
Coarsening Brand on Events, while Proliferating Davidsonian Events.Mylan Engel - 1994 - Grazer Philosophische Studien 47 (1):155-183.
Conditional Belief and the Ramsey Test.Scott Sturgeon - 2002 - Royal Institute of Philosophy Supplement 51:215-232.
Analytics
Added to PP
2020-12-22
Downloads
44 (#1,295,554)
6 months
11 (#1,043,100)
2020-12-22
Downloads
44 (#1,295,554)
6 months
11 (#1,043,100)
Historical graph of downloads
Citations of this work
Random constraint satisfaction: Easy generation of hard (satisfiable) instances.Ke Xu, Frédéric Boussemart, Fred Hemery & Christophe Lecoutre - 2007 - Artificial Intelligence 171 (8-9):514-534.
Reasoning from last conflict(s) in constraint programming.Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary & Vincent Vidal - 2009 - Artificial Intelligence 173 (18):1592-1614.
STR3: A path-optimal filtering algorithm for table constraints.Christophe Lecoutre, Chavalit Likitvivatanavong & Roland H. C. Yap - 2015 - Artificial Intelligence 220 (C):1-27.
Generating custom propagators for arbitrary constraints.Ian P. Gent, Christopher Jefferson, Steve Linton, Ian Miguel & Peter Nightingale - 2014 - Artificial Intelligence 211 (C):1-33.
Solving quantified constraint satisfaction problems.Ian P. Gent, Peter Nightingale, Andrew Rowley & Kostas Stergiou - 2008 - Artificial Intelligence 172 (6-7):738-771.
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.
A generic arc-consistency algorithm and its specializations.Pascal Van Hentenryck, Yves Deville & Choh-Man Teng - 1992 - Artificial Intelligence 57 (2-3):291-321.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
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