- 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
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
Artificial Intelligence 172 (12-13):1579-1604 (2008)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
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
References found in this work
Fast planning through planning graph analysis.Avrim L. Blum & Merrick L. Furst - 1997 - Artificial Intelligence 90 (1-2):281-300.
The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.
Extending and implementing the stable model semantics.Patrik Simons, Ilkka Niemelä & Timo Soininen - 2002 - Artificial Intelligence 138 (1-2):181-234.
Answer set programming and plan generation.Vladimir Lifschitz - 2002 - Artificial Intelligence 138 (1-2):39-54.
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-sz9d2 uwo