- 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
State-set branching: Leveraging BDDs for heuristic search
Artificial Intelligence 172 (2-3):103-139 (2008)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
frequent closed item set mining based on zero-suppressed BDDs.Shin-Ichi Minato & Hiroki Arimura - 2007 - Transactions of the Japanese Society for Artificial Intelligence 22 (2):165-172.
Heuristic search in artificial intelligence.Weixiong Zhang, Rina Dechter & Richard E. Korf - 2001 - Artificial Intelligence 129 (1-2):1-4.
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.
Heuristic search through islands.P. P. Chakrabarti, S. Ghose & S. C. DeSarkar - 1986 - Artificial Intelligence 29 (3):339-347.
Theory formation by heuristic search.Douglas B. Lenat - 1983 - Artificial Intelligence 21 (1-2):31-59.
Breadth-first heuristic search.Rong Zhou & Eric A. Hansen - 2006 - Artificial Intelligence 170 (4-5):385-408.
Heuristic search in restricted memory.P. P. Chakrabarti, S. Ghose, A. Acharya & S. C. de Sarkar - 1989 - Artificial Intelligence 41 (2):197-221.
Heuristic evaluation functions in artificial intelligence search algorithms.Richard E. Korf - 1995 - Minds and Machines 5 (4):489-498.
Analytics
Added to PP
2020-12-22
Downloads
14 (#1,272,601)
6 months
6 (#851,135)
2020-12-22
Downloads
14 (#1,272,601)
6 months
6 (#851,135)
Historical graph of downloads
Author's Profile
Citations of this work
Efficient symbolic search for cost-optimal planning.Álvaro Torralba, Vidal Alcázar, Peter Kissmann & Stefan Edelkamp - 2017 - Artificial Intelligence 242 (C):52-79.
Boosting optimal symbolic planning: Operator-potential heuristics.Daniel Fišer, Álvaro Torralba & Jörg Hoffmann - 2024 - Artificial Intelligence 334 (C):104174.
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.
Weak, strong, and strong cyclic planning via symbolic model checking.A. Cimatti, M. Pistore, M. Roveri & P. Traverso - 2003 - Artificial Intelligence 147 (1-2):35-84.
Partial-order planning.Anthony Barrett & Daniel S. Weld - 1994 - Artificial Intelligence 67 (1):71-112.
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-f8568656d-kkgnk uwo