- 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
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
Artificial Intelligence 41 (3):273-312 (1990)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Hybrid backtracking bounded by tree-decomposition of constraint networks.Philippe Jégou & Cyril Terrioux - 2003 - Artificial Intelligence 146 (1):43-75.
Backjumping for Quantified Boolean Logic satisfiability.Enrico Giunchiglia, Massimo Narizzano & Armando Tacchella - 2003 - Artificial Intelligence 145 (1-2):99-120.
EVEXED and MEET for mechanical design: testing structural decomposition and constraint propagation.L. Steinberg & N. Langrana - 1996 - Artificial Intelligence 84 (1-2):37-56.
Processing disjunctions in temporal constraint networks.Eddie Schwalb & Rina Dechter - 1997 - Artificial Intelligence 93 (1-2):29-61.
Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard.Bernd S. W. Schröder - 2001 - Artificial Intelligence 132 (1):105-117.
Decomposition of structural learning about directed acyclic graphs.Xianchao Xie, Zhi Geng & Qiang Zhao - 2006 - Artificial Intelligence 170 (4-5):422-439.
Representation learning with extreme learning machines and empirical mode decomposition for wind speed forecasting methods.Hao-Fan Yang & Yi-Ping Phoebe Chen - 2019 - Artificial Intelligence 277 (C):103176.
Learning to improve constraint-based scheduling.Monte Zweben, Eugene Davis, Brian Daun, Ellen Drascher, Michael Deale & Megan Eskey - 1992 - Artificial Intelligence 58 (1-3):271-296.
Low-rank decomposition meets kernel learning: A generalized Nyström method.Liang Lan, Kai Zhang, Hancheng Ge, Wei Cheng, Jun Liu, Andreas Rauber, Xiao-Li Li, Jun Wang & Hongyuan Zha - 2017 - Artificial Intelligence 250 (C):1-15.
Introduction to the special issue on Combining Constraint Solving with Mining and Learning.Andrea Passerini, Guido Tack & Tias Guns - 2017 - Artificial Intelligence 244 (C):1-5.
Analytics
Added to PP
2020-12-22
Downloads
20 (#1,025,316)
6 months
5 (#1,011,143)
2020-12-22
Downloads
20 (#1,025,316)
6 months
5 (#1,011,143)
Historical graph of downloads
Citations of this work
Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
Reasoning about qualitative temporal information.Peter van Beek - 1992 - Artificial Intelligence 58 (1-3):297-326.
An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.
A theoretical evaluation of selected backtracking algorithms.Grzegorz Kondrak & Peter van Beek - 1997 - Artificial Intelligence 89 (1-2):365-387.
References found in this work
Strips: A new approach to the application of theorem proving to problem solving.Richard E. Fikes & Nils J. Nilsson - 1971 - Artificial Intelligence 2 (3-4):189-208.
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.
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-667477cd97-jhg8z dc2