- 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
Strong planning under partial observability
Artificial Intelligence 170 (4-5):337-384 (2006)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
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.
Strong temporal planning with uncontrollable durations.Alessandro Cimatti, Minh Do, Andrea Micheli, Marco Roveri & David E. Smith - 2018 - Artificial Intelligence 256 (C):1-34.
Epistemic planning for single- and multi-agent systems.Thomas Bolander & Mikkel Birkegaard Andersen - 2011 - Journal of Applied Non-Classical Logics 21 (1):9-34.
Automated composition of Web services via planning in asynchronous domains.Piergiorgio Bertoli, Marco Pistore & Paolo Traverso - 2010 - Artificial Intelligence 174 (3-4):316-361.
Conformant planning via symbolic model checking and heuristic search.A. Cimatti, M. Roveri & P. Bertoli - 2004 - Artificial Intelligence 159 (1-2):127-206.
Effective embeddings into strong degree structures.Timothy H. McNicholl - 2003 - Mathematical Logic Quarterly 49 (3):219.
Observability and Observation in Physical Science.Peter Kosso - 1986 - Dissertation, University of Minnesota
Dimensions of observability.Peter Kosso - 1988 - British Journal for the Philosophy of Science 39 (4):449-467.
Partial observability and learnability.Loizos Michael - 2010 - Artificial Intelligence 174 (11):639-669.
Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning.Subbarao Kambhampati, Craig A. Knoblock & Qiang Yang - 1995 - Artificial Intelligence 76 (1-2):167-238.
Deliberation, Reasons, and Alternatives.Justin Snedegar - 2019 - Pacific Philosophical Quarterly 100 (3):682-702.
A Case for Old‐Fashioned Observability, and a Reconstructed Constructive Empiricism.Hasok Chang - 2005 - Philosophy of Science 72 (5):876-887.
Partial and total‐order planning: evidence from normal and prefrontally damaged populations.Mary Jo Rattermann, Lee Spector, Jordan Grafman, Harvey Levin & Harriet Harward - 2001 - Cognitive Science 25 (6):941-975.
HSP-type Characterization of Strong Equational Classes of Partial Algebras.Bogdan Staruch - 2009 - Studia Logica 93 (1):41-65.
Analytics
Added to PP
2020-12-22
Downloads
4 (#1,265,453)
6 months
1 (#478,598)
2020-12-22
Downloads
4 (#1,265,453)
6 months
1 (#478,598)
Historical graph of downloads
Citations of this work
Knowledge-based programs as succinct policies for partially observable domains.Bruno Zanuttini, Jérôme Lang, Abdallah Saffidine & François Schwarzentruber - 2020 - Artificial Intelligence 288 (C):103365.
Analyzing generalized planning under nondeterminism.Vaishak Belle - 2022 - Artificial Intelligence 307 (C):103696.
Conformant plans and beyond: Principles and complexity.Blai Bonet - 2010 - Artificial Intelligence 174 (3-4):245-269.
Task decomposition on abstract states, for planning under nondeterminism.Ugur Kuter, Dana Nau, Marco Pistore & Paolo Traverso - 2009 - Artificial Intelligence 173 (5-6):669-695.
Plan aggregation for strong cyclic planning in nondeterministic domains.Ron Alford, Ugur Kuter, Dana Nau & Robert P. Goldman - 2014 - Artificial Intelligence 216 (C):206-232.
References found in this work
Planning and acting in partially observable stochastic domains.Leslie Pack Kaelbling, Michael L. Littman & Anthony R. Cassandra - 1998 - Artificial Intelligence 101 (1-2):99-134.
Using temporal logics to express search control knowledge for planning.Fahiem Bacchus & Froduald Kabanza - 2000 - Artificial Intelligence 116 (1-2):123-191.
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.
An algorithm for probabilistic planning.Nicholas Kushmerick, Steve Hanks & Daniel S. Weld - 1995 - Artificial Intelligence 76 (1-2):239-286.
In defense of PDDL axioms.Sylvie Thiébaux, Jörg Hoffmann & Bernhard Nebel - 2005 - Artificial Intelligence 168 (1-2):38-69.
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-5b5888c749-fsgz8 N