- 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
Locating the phase transition in binary constraint satisfaction problems
Artificial Intelligence 81 (1-2):155-181 (1996)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.
On the phase transitions of random k-constraint satisfaction problems.Yun Fan & Jing Shen - 2011 - Artificial Intelligence 175 (3-4):914-927.
The hardest constraint problems: A double phase transition.Tad Hogg & Colin P. Williams - 1994 - Artificial Intelligence 69 (1-2):359-377.
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.
Compiling constraint satisfaction problems.Rainer Weigel & Boi Faltings - 1999 - Artificial Intelligence 115 (2):257-287.
Solving quantified constraint satisfaction problems.Ian P. Gent, Peter Nightingale, Andrew Rowley & Kostas Stergiou - 2008 - Artificial Intelligence 172 (6-7):738-771.
Backjump-based backtracking for constraint satisfaction problems.Rina Dechter & Daniel Frost - 2002 - Artificial Intelligence 136 (2):147-188.
Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
Domain permutation reduction for constraint satisfaction problems.Martin J. Green & David A. Cohen - 2008 - Artificial Intelligence 172 (8-9):1094-1118.
Automated streamliner portfolios for constraint satisfaction problems.Patrick Spracklen, Nguyen Dang, Özgür Akgün & Ian Miguel - 2023 - Artificial Intelligence 319 (C):103915.
Analytics
Added to PP
2020-12-22
Downloads
6 (#1,485,580)
6 months
4 (#862,833)
2020-12-22
Downloads
6 (#1,485,580)
6 months
4 (#862,833)
Historical graph of downloads
Citations of this work
An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.
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.
Backtracking algorithms for disjunctions of temporal constraints.Kostas Stergiou & Manolis Koubarakis - 2000 - Artificial Intelligence 120 (1):81-117.
On the phase transitions of random k-constraint satisfaction problems.Yun Fan & Jing Shen - 2011 - Artificial Intelligence 175 (3-4):914-927.
References found in this work
Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
Increasing tree search efficiency for constraint satisfaction problems.Robert M. Haralick & Gordon L. Elliott - 1980 - Artificial Intelligence 14 (3):263-313.
Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.
An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.
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