The computational complexity of propositional STRIPS planning

Artificial Intelligence 69 (1-2):165-204 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(94)90081-7

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,928

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
A probabilistic analysis of prepositional STRIPS planning.Tom Bylander - 1996 - Artificial Intelligence 81 (1-2):241-271.
On The Computational Consequences of Independence in Propositional Logic.Merlijn Sevenster - 2006 - Synthese 149 (2):257-283.
Computational complexity of planning and approximate planning in the presence of incompleteness.Chitta Baral, Vladik Kreinovich & Raúl Trejo - 2000 - Artificial Intelligence 122 (1-2):241-267.
On Algorithmic Properties of Propositional Inconsistency-Adaptive Logics.Sergei P. Odintsov & Stanislav O. Speranski - 2012 - Logic and Logical Philosophy 21 (3):209-228.
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.
A modal perspective on the computational complexity of attribute value grammar.Patrick Blackburn & Edith Spaan - 1993 - Journal of Logic, Language and Information 2 (2):129-169.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 339-353.
Evaluation of propositional formulas from the viewpoint of computational complexity.Ivan Kramosil - 1988 - Bulletin of the Section of Logic 17 (2):62-66.
Computational motor planning and the theory of event coding.David A. Rosenbaum - 2001 - Behavioral and Brain Sciences 24 (5):902-903.
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.
Computer Thought: Propositional Attitudes and Meta-Knowledge.Eric Stanley Dietrich - 1985 - Dissertation, The University of Arizona
Incompleteness in the Finite Domain.Pavel Pudlák - 2017 - Bulletin of Symbolic Logic 23 (4):405-441.

Analytics

Added to PP
2020-12-22

Downloads
19 (#799,523)

6 months
10 (#268,496)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Tractable Cognition Thesis.Iris Van Rooij - 2008 - Cognitive Science 32 (6):939-984.
Fast planning through planning graph analysis.Avrim L. Blum & Merrick L. Furst - 1997 - Artificial Intelligence 90 (1-2):281-300.
DA2 merging operators.S. Konieczny, J. Lang & P. Marquis - 2004 - Artificial Intelligence 157 (1-2):49-79.
Concise finite-domain representations for PDDL planning tasks.Malte Helmert - 2009 - Artificial Intelligence 173 (5-6):503-535.

View all 47 citations / Add more citations

References found in this work

Planning for conjunctive goals.David Chapman - 1987 - Artificial Intelligence 32 (3):333-377.
Temporal data base management.Thomas L. Dean & Drew V. McDermott - 1987 - Artificial Intelligence 32 (1):1-55.
Planning as search: A quantitative approach.Richard E. Korf - 1987 - Artificial Intelligence 33 (1):65-88.
Reasoning about action I.Matthew L. Ginsberg & David E. Smith - 1988 - Artificial Intelligence 35 (2):165-195.

View all 12 references / Add more references