Michael L. Littman  Home/Search
Context Related
| duke.edu/pub/dist/techr...199618.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: duke.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many representations for probabilistic propositional planning problems have been studied. This paper reviews several such representations and shows that, in spite of superficial differences between the representations, they are "expressively equivalent," meaning that planning problems specified in one representation can be converted to equivalent planning problems in any of the other representations with at most a polynomial increase in the resulting representation and the number of... (Update)
Context of citations to this paper: More
.... have been several proposals (for example, Pearl, 1999; 2000; Baral et al. 2002; Boutilier and Goldszmidt, 1996; Reiter, 2001; Littman, 1997] to represent and reason with such actions. In all these proposals, except in [Pearl, 1999; 2000; 1995] actions have explicit...
...Work on the computational complexity of planning in AI include [14, 38] which consider deterministic problems. Later work, for example [77, 78], considers nite plans (or problems in nite horizon POMDPs) Our work builds on the undecidability of the emptiness problem for...
Cited by: More
Semantic Email: Theory and Applications - McDowell, Etzioni, Halevy (2004) (Correct)
Semantic Email - McDowell, Etzioni, Halevy, Levy (2004) (Correct)
Complexity and Approximation Studies of Finding Polynomially - Bounded Length Plans (Correct)
Similar documents (at the sentence level):
71.3%: Probabilistic Propositional Planning: Representations and.. - Littman (1997) (Correct)
Active bibliography (related documents): More All
0.5: Learning policies for partially observable.. - Littman, Cassandra.. (1995) (Correct)
0.4: The Complexity of Plan Existence and Evaluation in.. - Goldsmith, Littman.. (1997) (Correct)
0.4: The Complexity of Model Aggregation - Goldsmith, Sloan (2000) (Correct)
Similar documents based on text: More All
0.1: Decidability and Undecidability Results - For Planning With (2002) (Correct)
0.0: Incremental Pruning: A Simple, Fast, Exact Method for.. - Cassandra, Littman.. (1997) (Correct)
0.0: Learning a Language-Independent Representation for Terms.. - Littman, Jiang, Keim (1998) (Correct)
Related documents from co-citation: More All
30: The computational complexity of propositional STRIPS planning - Bylander - 1994
25: decidability and undecidability results for domain-independent planning (context) - Erol, Nau et al. - 1991
20: The computational complexity of probabilistic plan existence and evaluation - Littman, Goldsmith et al. - 1997
BibTeX entry: (Update)
M. Littman, "Probabilistic propositional planning: representation and complexity", AAAI'97, pp. 748--754. http://citeseer.ist.psu.edu/littman97probabilistic.html More
@inproceedings{ littman97probabilistic,
author = "Michael L. Littman",
title = "Probabilistic Propositional Planning: Representations and Complexity",
booktitle = "Proceedings of the 14th National Conference on Artificial Intelligence ({AAAI}-97)",
publisher = "AAAI Press / MIT Press",
address = "Providence, Rhode Island",
isbn = "0-262-51095-2",
pages = "748--761",
year = "1997",
url = "citeseer.ist.psu.edu/littman97probabilistic.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
140 Probabilistic planning with information gathering and contin.. - Draper, Hanks et al. - 1993
96 The complexity of Markov decision processes (context) - Papadimitriou, Tsitsiklis - 1987
70 Abstraction and approximate decision theoretic planning - Dearden, Boutilier - 1996
64 Planning under uncertainty: Structural assumptions and compu.. - Boutilier, Dean et al. - 1995
58 Games against nature (context) - Papadimitriou - 1983
30 Approximating value trees in structured dynamic programming - Boutilier, Dearden - 1996
23 Provably difficult combinatorial games (context) - Stockmeyer, Chandra - 1979
15 The complexity of stochastic games - Condon - 1992
11 and Goldszmidt (context) - Boutilier, Dearden - 1995
6 Expressive equivalence of planning formalisms - Backstrom - 1995
5 and Mundhenk (context) - Goldsmith, Lusena - 1996
3 The complexity of unobservable finite-horizon Markov decisio.. - Mundhenk, Goldsmith et al. - 1996
2 An algorithm for probabilistic planning (context) - of, finitehorizon et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.duke.edu.html): More
Band Ordering in Lossless Compression of Multispectral Images - Tate (1994) (Correct)
A Notation for Lambda Terms II: Refinements and Applications - Nadathur (1994) (Correct)
I/O-Efficient Scientific Computation Using TPIE - Vengroff, Vitter (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC