Tom Bylander  Home/Search
Context Related
Links: ACM DBLP | i5.informatik.rwth...rStripsCompl.ps.gz utsa.edu/research/...telligence94.ps.gz utsa.edu/~bylander...telligence94.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 Problem Downloading? From: i5.informatik.rwthaachen.de/L... (more) From: utsa.edu/research/AI/bylan...pubs (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: I present several computational complexity results for propositional STRIPS planning, i.e., STRIPS planning restricted to ground formulas. Different planning problems can be defined by restricting the type of formulas, placing limits on the number of pre- and postconditions, by restricting negation in pre- and postconditions, and by requiring optimal plans. For these types of restrictions, I show when planning is tractable (polynomial) and intractable (NPhard) . In general, it is... (Update)
Cited by: More
Action Planning for Graph Transition Systems - Edelkamp, Jabbar, al. (2005) (Correct)
Action Planning for Directed Model Checking of Petri Nets - Edelkamp, Jabbar (2005) (Correct)
Finding Feasible Pathways in Metabolic Networks - Ari (Correct)
Active bibliography (related documents): More All
0.3: A Probabilistic Analysis of Propositional STRIPS Planning - Bylander (1996) (Correct)
0.3: A Survey of Complexity Results for Planning - Cadoli (1993) (Correct)
0.3: Regular Search Spaces and Constructive Negation - Momigliano, Ornaghi (1997) (Correct)
Similar documents based on text: More All
0.2: A Linear Programming Heuristic for Optimal Planning - Bylander (1997) (Correct)
0.1: Worst-Case Absolute Loss Bounds for Linear Learning Algorithms - Tom Bylander (1997) (Correct)
0.1: Learning Noisy Linear Threshold Functions - Bylander (1998) (Correct)
Related documents from co-citation: More All
44: STRIPS: A new approach to the application of theorem proving to problem solving (context) - Fikes, Nilsson - 1990
35: Planning for conjunctive goals (context) - Chapman - 1987
32: Fast planning through planning graph analysis - Blum, Furst - 1995
BibTeX entry: (Update)
T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69:161--204, 1994. http://citeseer.ist.psu.edu/bylander94computational.html More
@article{ bylander94computational,
author = "Tom Bylander",
title = "The Computational Complexity of Propositional {STRIPS} Planning",
journal = "Artificial Intelligence",
volume = "69",
number = "1-2",
pages = "165-204",
year = "1994",
url = "citeseer.ist.psu.edu/bylander94computational.html" }
Citations (may not include all citations):891 STRIPS: A new approach to the application of theorem proving.. (context) - Fikes, Nilsson - 1971
572 Computers and Intractability (context) - Garey, Johnson - 1979 ACM
451 Planning for conjunctive goals (context) - Chapman - 1987
410 Principles of Artificial Intelligence (context) - Nilsson - 1980
329 Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991 DBLP
320 Hard and easy distributions of SAT problems - Mitchell, Selman et al. - 1992 DBLP
210 Minimizing conflicts: A heuristic repair method for constrai.. - Minton, Johnston et al. - 1992 DBLP
151 Reasoning about Change (context) - Shoham - 1988 ACM
149 Readings in Planning (context) - Allen, Hendler et al. - 1990
139 Planning as search: A quantitative approach (context) - Korf - 1987 ACM DBLP
132 Relationship between nondeterministic and deterministic tape.. (context) - Savitch - 1970
112 Reasoning about actions I: A possible worlds approach - Ginsberg, Smith - 1988
106 Temporal data base management (context) - Dean, McDermott - 1987 ACM DBLP
94 Expressiveness and tractability in knowledge representation .. (context) - Levesque, Brachman - 1987
89 Complexity results for planning (context) - Bylander - 1991
82 Reasoning about partially ordered events (context) - Dean, Boddy - 1988 ACM DBLP
71 Macro-operators: A weak method for learning (context) - Korf - 1985
63 algorithm for finding maximum matching in general graphs (context) - Micali, Vazivani et al. - 1980
45 AI planning: Systems and techniques (context) - Hendler, Tate et al. - 1990
41 Complexity results for blocks-world planning - Gupta, Nau - 1991
41 Impediments to universal preference-based default theories - Doyle, Wellman - 1991 ACM DBLP
31 Complexity results for SAS+ planning (context) - Backstrom, Nebel - 1993
30 Parallel non-binary planning in polynomial time - Backstrom, Klein - 1991
25 the NP-hardness of blocks world (context) - Chenoweth - 1991
25 The downward refinement property (context) - Bacchus, Yang - 1991
22 Annual Review of Computer Science (context) - Georgeff - 1987
22 Complexity results for serial decomposability (context) - Bylander - 1992
21 The frame problem and related problems in artificial intelli.. (context) - Hayes - 1973 ACM
17 Complexity results for extended planning (context) - Bylander - 1992 ACM
7 How long will it take (context) - Musick, Russell - 1992
6 Finding a shortest solution for the n \Theta n extension of .. (context) - Ratner, Warmuth - 1986
6 An average case analysis of planning (context) - Bylander - 1993
5 and undecidability results for domain-independent planning (context) - Erol, Nau et al. - 1991
3 The decision problem for a class of first-order formulas in .. (context) - Krom - 1967
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-i5.informatik.rwth-aachen.de/LuFG/Lehre/WS97/PLAN/): More
Fast Planning Through Planning Graph Analysis - Blum, Furst (1995) (Correct)
An Introduction to Least Commitment Planning - Weld (1994) (Correct)
An Algorithm for Probabilistic Planning - Kushmerick, Hanks, Weld (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