Christer Bäckström, Bernhard Nebel  Home/Search
Context Related
Links: DBLP | informatik.unifre...ebelijcai93.ps.gz ida.liu.se/pub/labs/tos...ijcai93.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: informatik.unifrei...conferences (more) From: ida.liu.se/~chr...conferencefull (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We have previously reported a number of tractable planning problems defined in the SAS + formalism. This paper complements these results by providing a complete map over the complexity of SAS + planning under all combinations of the previously considered restrictions. We analyse the complexity both of finding a minimal plan and of finding any plan. In contrast to other complexity surveys of planning we study not only the complexity of the existence problems but also of the search problems.... (Update)
Context of citations to this paper: More
.... Strips formalism with negative goals [ Bylander, 1994 ] which is equivalent to most other variants of propositional Strips [ Backstrom, 1995 ] Definition 2.1 An instance of the PSN planning problem is a quadruple Pi = hP ; O; I; Gi where ffl P is a finite set of...
.... as Ground TWEAK (GT) The fourth, and final, formalism in our analysis is the extended simplified action structures (SAS ) formalism [2, 3, 6, 17], which derives from the SAS formalism [4, 5] and the original action structures formalism [23] These four formalism seem to form...
Cited by: More
On the Complexity of Planning in Transportation Domains - Helmert (2001) (Correct)
Planning with Abstraction Hierarchies can be Exponentially.. - Bäckström, Jonsson (Correct)
Complexity Results for State-Variable Planning under Mixed.. - Jonsson, Bäckström (1994) (Correct)
Similar documents (at the sentence level):
12.2%: Complexity Results for SAS+ Planning - Bäckström, Nebel (1995) (Correct)
Active bibliography (related documents): More All
0.5: A Survey of Complexity Results for Planning - Cadoli (1993) (Correct)
0.4: Finding Least Constrained Plans and Optimal Parallel Executions.. - Bäckström (1994) (Correct)
0.4: State-Variable Planning under Structural Restrictions.. - Jonsson, Bäckström (1998) (Correct)
Similar documents based on text: More All
0.5: Equivalence and Tractability Results for SAS+ Planning - Bäckström (1992) (Correct)
0.4: Tractable Planning with State Variables by Exploiting.. - Jonsson, Bäckström (1994) (Correct)
0.4: Practical introduction to SAS on Unix - Document Sas-T Practical (Correct)
Related documents from co-citation: More All
10: The computational complexity of propositional STRIPS planning - Bylander - 1994
10: Network-based Multicomputers: an Emerging Parallel Architecture - Kung, Sansom et al. - 1991
9: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Michael, David et al. - 1979
BibTeX entry: (Update)
Christer Backstrom and Bernhard Nebel, `Complexity results for SAS + planning', Computational Intelligence, 11(4), 625--655, (1995). http://citeseer.ist.psu.edu/article/backstrom93complexity.html More
@techreport{ backstrom93complexity,
author = "Christer Backstrom and Bernhard Nebel",
title = "Complexity results for {SAS}+ planning",
number = "LiTH-IDA-R-93-34",
address = "Linkoping, Sweden",
pages = "39",
year = "1993",
url = "citeseer.ist.psu.edu/article/backstrom93complexity.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
147 The computational complexity of propositional STRIPS plannin.. - Bylander - 1993 ACM DBLP
139 Planning as search: A quantitative approach (context) - Korf - 1987 ACM DBLP
89 Complexity results for planning (context) - Bylander - 1991
82 Reasoning about partially ordered events (context) - Dean, Boddy - 1988 ACM DBLP
51 the complexity of blocks-world planning - Gupta, Nau - 1992
51 the complexity of domainindependent planning (context) - Erol, Nau et al. - 1992
32 the computational complexity of temporal projection - Nebel, Backstrom - 1993
31 Complexity results for SAS + planning (context) - Backstrom, Nebel - 1993
30 Parallel non-binary planning in polynomial time - Backstrom, Klein - 1991 DBLP
22 Complexity results for serial decomposability (context) - Bylander - 1992 DBLP
17 Complexity results for extended planning (context) - Bylander - 1992 ACM
16 Computational Complexity of Reasoning about Plans (context) - Backstrom - 1992
14 Equivalence and tractability results for SAS + planning (context) - Backstrom - 1992
12 and Joaquim Gabarr'o (context) - Balc'azar, Diaz - 1988
5 the computational complexity of planning and story understan.. (context) - Backstrom, Nebel - 1992
3 Planning in polynomial time: The SASPUBS class (context) - Backstrom, Klein - 1991
3 on Artif Intell (context) - th, Nat'l - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-freiburg.de/~nebel/conferences.html): More
Issues of Integration and Balancing in Hybrid Knowledge.. - Nebel, von Luck (1987) (Correct)
Reasoning about Temporal Relations: A Maximal Tractable.. - Nebel, Bürckert (1994) (Correct)
Preferred Arguments are Harder to Compute than Stable.. - Dimopoulos, Nebel, Toni (1999) (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