- 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
Domain filtering consistencies for non-binary constraints
Artificial Intelligence 172 (6-7):800-822 (2008)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Binary vs. non-binary constraints☆☆This paper includes results that first appeared in [1,4,23]. This research has been supported in part by the Canadian Government through their NSERC and IRIS programs, and by the EPSRC Advanced Research Fellowship program. [REVIEW]Fahiem Bacchus, Xinguang Chen, Peter van Beek & Toby Walsh - 2002 - Artificial Intelligence 140 (1-2):1-37.
A Note On Impossibility Theorems and Seniority Rules.Matthias Hild - 2004 - Theory and Decision 57 (1):69-78.
Decomposable constraints☆☆Supported by EPSRC award GR/L/24014. The authors wish to thank other members of the APES research group.Ian Gent, Kostas Stergiou & Toby Walsh - 2000 - Artificial Intelligence 123 (1-2):133-156.
Time-dependent probability density of the rc low-pass filtering of a binary random process.P. A. Lee - 1968 - In Peter Koestenbaum (ed.), Proceedings. [San Jose? Calif.. pp. 312.
Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints.Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan & Toby Walsh - 2009 - Artificial Intelligence 173 (11):1054-1078.
The Contribution of Domain Specificity in the Highly Modular Mind.Axel Arturo Barceló Aspeitia, Ángeles Eraña & Robert Stainton - 2010 - Minds and Machines 20 (1):19-27.
STR3: A path-optimal filtering algorithm for table constraints.Christophe Lecoutre, Chavalit Likitvivatanavong & Roland H. C. Yap - 2015 - Artificial Intelligence 220 (C):1-27.
Typological variation of kinship terminologies is a function of strict ranking of constraints on nested binary classification trees.Paul Miers - 2010 - Behavioral and Brain Sciences 33 (5):395 - 397.
Filtering algorithms for global chance constraints.Brahim Hnich, Roberto Rossi, S. Armagan Tarim & Steven Prestwich - 2012 - Artificial Intelligence 189 (C):69-94.
Mechanisms of Cognitive Development: Domain-General Learning or Domain-Specific Constraints?Vladimir M. Sloutsky - 2010 - Cognitive Science 34 (7):1125-1130.
Filtering AtMostNValue with difference constraints: Application to the shift minimisation personnel task scheduling problem.Jean-Guillaume Fages & Tanguy Lapègue - 2014 - Artificial Intelligence 212 (C):116-133.
Filtering algorithms for the multiset ordering constraint.Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel & Toby Walsh - 2009 - Artificial Intelligence 173 (2):299-328.
Domain-Creating Constraints.Robert L. Goldstone & David Landy - 2010 - Cognitive Science 34 (7):1357-1377.
Backtracking algorithms for disjunctions of temporal constraints.Kostas Stergiou & Manolis Koubarakis - 2000 - Artificial Intelligence 120 (1):81-117.
Analytics
Added to PP
2020-12-22
Downloads
1 (#1,515,607)
6 months
1 (#489,169)
2020-12-22
Downloads
1 (#1,515,607)
6 months
1 (#489,169)
Historical graph of downloads
Sorry, there are not enough data points to plot this chart.
References found in this work
Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
An optimal coarse-grained arc consistency algorithm.Christian Bessière, Jean-Charles Régin, Roland H. C. Yap & Yuanlin Zhang - 2005 - Artificial Intelligence 165 (2):165-185.
Binary vs. non-binary constraints☆☆This paper includes results that first appeared in [1,4,23]. This research has been supported in part by the Canadian Government through their NSERC and IRIS programs, and by the EPSRC Advanced Research Fellowship program. [REVIEW]Fahiem Bacchus, Xinguang Chen, Peter van Beek & Toby Walsh - 2002 - Artificial Intelligence 140 (1-2):1-37.
On forward checking for non-binary constraint satisfaction.Christian Bessière, Pedro Meseguer, Eugene C. Freuder & Javier Larrosa - 2002 - Artificial Intelligence 141 (1-2):205-224.
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-7cdd687c8d-79zxv N