- 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
Constraints, consistency and closure
Artificial Intelligence 101 (1-2):251-265 (1998)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Arc consistency for soft constraints.Martin Cooper & Thomas Schiex - 2004 - Artificial Intelligence 154 (1-2):199-227.
On the consistency of cardinal direction constraints.Spiros Skiadopoulos & Manolis Koubarakis - 2005 - Artificial Intelligence 163 (1):91-135.
Cyclic consistency: A local reduction operation for binary valued constraints.Martin C. Cooper - 2004 - Artificial Intelligence 155 (1-2):69-92.
A correction to “Nonmonotonic inconsistency” [Artificial Intelligence 149 (2003) 161–178].Charles B. Cross - 2004 - Artificial Intelligence 160 (1-2):191-192.
Arc-consistency and arc-consistency again.Christian Bessière - 1994 - Artificial Intelligence 65 (1):179-190.
A reconstruction of multipreference closure.Laura Giordano & Valentina Gliozzi - 2021 - Artificial Intelligence 290 (C):103398.
Proof by consistency.Deepak Kapur & David R. Musser - 1987 - Artificial Intelligence 31 (2):125-157.
Rational closure for all description logics.P. A. Bonatti - 2019 - Artificial Intelligence 274 (C):197-223.
Abduction versus closure in causal theories.Kurt Konolige - 1992 - Artificial Intelligence 53 (2-3):255-272.
On the consistency of defeasible databases.Moisés Goldszmidt & Judea Pearl - 1991 - Artificial Intelligence 52 (2):121-149.
Analytics
Added to PP
2020-12-22
Downloads
17 (#1,196,561)
6 months
5 (#702,808)
2020-12-22
Downloads
17 (#1,196,561)
6 months
5 (#702,808)
Historical graph of downloads
Citations of this work
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.
Domain permutation reduction for constraint satisfaction problems.Martin J. Green & David A. Cohen - 2008 - Artificial Intelligence 172 (8-9):1094-1118.
The existence of a near-unanimity term in a finite algebra is decidable.Miklós Maróti - 2009 - Journal of Symbolic Logic 74 (3):1001-1014.
Constraint propagation techniques for the disjunctive scheduling problem.Ulrich Dorndorf, Erwin Pesch & Toàn Phan-Huy - 2000 - Artificial Intelligence 122 (1-2):189-240.
Properties of tree convex constraints.Yuanlin Zhang & Eugene C. Freuder - 2008 - Artificial Intelligence 172 (12-13):1605-1612.
References found in this work
Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
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-99fc7d78b-6fxz5 uwo