Christer Bäckström  Home/Search
Context Related
| ida.liu.se/pub/labs/tosca/...kr92.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: fermivista.math....ftp.ida.liu.se (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We define the SAS + planning formalism, which generalizes the previously presented SAS formalism. The SAS + formalism is compared with some better-known propositionalplanning formalisms with respect to expressiveness. Contrary to intuition, all formalisms turn out to be equally expressive in a very strong sense. We further present the SAS + -PUS planning problem which generalizes the previously presented, tractable SASPUS problem. We prove that also the SAS + - PUS problem is tractable... (Update)
Context of citations to this paper: More
.... decide whether a plan exists or not [66] However, for the blocksworld problem per se a plan can be found in low order polynomial time [51, 52, 80] while the decision problem for bounded plans is NP complete, i.e. still better than PSPACE complete. Furthermore, the modification...
.... computationally as hard as planning itself, at least for the case of propositional strips, which is PSPACE complete [ Bylander, 1994; Backstrom, 1992 ] Theorem 1 For propositional strips, deciding complete irrelevance, solution irrelevance, and solution length irrelevance of...
Cited by: More
Ignoring Irrelevant Facts and Operators in Plan Generation - Nebel, Dimopoulos, Koehler (1997) (Correct)
Current Research in RKLLAB, Linköping University's Laboratory for.. - (ed.) (1995) (Correct)
Similar documents (at the sentence level):
30.8%: Computational Complexity of Reasoning about Plans - Bäckström (1992) (Correct)
Active bibliography (related documents): More All
0.9: Complexity Results for SAS+ Planning - Bäckström, Nebel (1996) (Correct)
0.7: Artificial Intelligence: A Computational Perspective - Nebel (1994) (Correct)
0.6: Five Years of Tractable Planning - Bäckström (1995) (Correct)
Similar documents based on text: More All
0.6: Artoolkit: A SAS Macro Program Toolkit for Accounting Researchers - Cram (1997) (Correct)
0.6: Planning using Transformation between Equivalent Formalisms: A.. - Bäckström (1994) (Correct)
0.5: A Transcription System Based on Synchronous Addition .. - Tadokoro, Ozawa.. (Correct)
Related documents from co-citation: More All
2: STRIPS: A new approach to the application of theorem proving to problem solving (context) - Fikes, Nilsson - 1990
2: The computational complexity of propositional STRIPS planning - Bylander - 1994
2: the computational complexity of temporal projection and plan validation - Nebel, Backstrom - 1992
BibTeX entry: (Update)
Christer Backstrom. Equivalence and tractability results for SAS + planning. In Bill Swartout and Bernhard Nebel, editors, Proceedings of the 26 3rd International Conference on Principles on Knowledge Representation and Reasoning (KR-92), pages 126--137, Cambridge, MA, USA, October 1992. Morgan Kaufmann. http://citeseer.ist.psu.edu/backstrom92equivalence.html More
@misc{ backstrom92equivalence,
author = "C. Backstrom",
title = "Equivalence and tractability results for SAS + planning",
text = "Christer Backstrom. Equivalence and tractability results for SAS + planning.
In Bill Swartout and Bernhard Nebel, editors, Proceedings of the 26 3rd
International Conference on Principles on Knowledge Representation and Reasoning
(KR-92), pages 126--137, Cambridge, MA, USA, October 1992. Morgan Kaufmann.",
year = "1992",
url = "citeseer.ist.psu.edu/backstrom92equivalence.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
891 STRIPS: A new approach to the application of theorem proving.. (context) - Fikes, Nilsson - 1971
451 Planning for conjunctive goals (context) - Chapman - 1987
139 Planning as search: A quantitative approach (context) - Korf - 1987
89 Complexity results for planning (context) - Bylander - 1991
82 Reasoning about partially ordered events (context) - Dean, Boddy - 1988
51 the complexity of domainindependent planning (context) - Erol, Nau et al. - 1992
45 a program that simulates human thought (context) - Newell, Simon - 1963
41 Complexity results for blocks-world planning - Gupta, Nau - 1991
32 the computational complexity of temporal projection and plan.. - Nebel, Backstrom - 1992
31 A representation of action structures (context) - Sandewall, Ronnquist - 1986
30 Parallel non-binary planning in polynomial time - Backstrom, Klein - 1991
28 When is planning decidable (context) - Erol, Nau et al. - 1992
23 Planning in polynomial time: The SAS-PUBS class - Backstrom, Klein - 1991
21 The frame problem and related problems in artificial intelli.. (context) - Hayes - 1981
16 Computational Complexity of Reasoning about Plans (context) - Backstrom - 1992
15 The expected value of hierarchical problemsolving - Bacchus, Yang - 1992
13 A theory of abstraction for hierarchical planning (context) - Knoblock - 1990
12 The Frame Problem in Artificial Intelligence (context) - Brown - 1987
11 A system and control theoretic perspective on artificial int.. (context) - Passino, Antsaklis - 1989
8 the planning problem in sequential control - Klein, Backstrom - 1991
8 A representation of coordinated actions characterized by int.. (context) - Backstrom - 1988
6 Department of Computer and Information Science (context) - Backstrom, interdependent et al. - 1988
5 Tractability and artificial intelligence (context) - Bylander - 1991
5 the computational complexity of planning and story understan.. (context) - Backstrom, Nebel - 1992
2 Algorithms and complexity for reasoning about time (context) - Golumbic - 1992
2 National Conference on Artificial Intelligence (context) - the, US - 1992
2 Facing the challenge of computer science in the industrial a.. (context) - Astrom, Benveniste - 1991
1 of Computer and Information Science (context) - Sandewall, fluents et al. - 1992
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.ida.liu.se.html): More
User Interface Design Support Tools and Critiquing - Ericsson (1994) (Correct)
Specification and Synthesis of Plans Using the Features and.. - Karlsson (1995) (Correct)
Computing Circumscription Revisited: Preliminary Report - Doherty, Lukaszewicz, Szalas (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