Complexity, decidability and undecidability results for domain-independent planning

, &
Artificial Intelligence 76 (1-2):75-88 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(94)00080-k

Links

PhilArchive



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

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

More on The Decidability of Mereological Theories.Hsing-Chien Tsai - 2011 - Logic and Logical Philosophy 20 (3):251-265.
Constructibility and Decidability versus Domain Independence and Absoluteness.Arnon Avron - unknown
Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions.Davide Bresolin, Valentin Goranko, Angelo Montanari & Guido Sciavicco - 2010 - Annals of Pure and Applied Logic 161 (3):289-304.
Finitely inseparable first-order axiomatized mereotopological theories.Hsing-Chien Tsai - 2013 - Logic and Logical Philosophy 22 (3):347-363.
Elementary theories and hereditary undecidability for semilattices of numberings.Nikolay Bazhenov, Manat Mustafa & Mars Yamaleev - 2019 - Archive for Mathematical Logic 58 (3-4):485-500.
DEL-based epistemic planning: Decidability and complexity.Thomas Bolander, Tristan Charrier, Sophie Pinchinat & François Schwarzentruber - 2020 - Artificial Intelligence 287 (C):103304.
Three concepts of decidability for general subsets of uncountable spaces.Matthew W. Parker - 2003 - Theoretical Computer Science 351 (1):2-13.
Comparing First Order Theories of Modules over Group Rings II: Decidability: Decidability.Carlo Toffalori & S. Cittadini - 2002 - Mathematical Logic Quarterly 48 (4):483-498.
The Decidability of the Class and the Axiom of Foundation.Dorella Bellè & Franco Parlamento - 2001 - Notre Dame Journal of Formal Logic 42 (1):41-53.
A Road Map of Interval Temporal Logics and Duration Calculi.Valentin Goranko, Angelo Montanari & Guido Sciavicco - 2004 - Journal of Applied Non-Classical Logics 14 (1-2):9-54.
Generic planning: Research results and applications. [REVIEW]John N. Warfield - 1990 - Knowledge, Technology & Policy 3 (4):91-113.
Cornerstones of Undecidability.Grzegorz Rozenberg & Arto Salomaa - 1994
Decidability and essential undecidability.Hilary Putnam - 1957 - Journal of Symbolic Logic 22 (1):39-54.
The Decidability of the $ \forall^*\exists$ Class and the Axiom of Foundation.Dorella Bellè & Franco Parlamento - 2001 - Notre Dame Journal of Formal Logic 42 (1):41-53.
Questions of decidability and undecidability in number theory.B. Mazur - 1994 - Journal of Symbolic Logic 59 (2):353-371.

Analytics

Added to PP
2020-12-22

Downloads
7 (#1,387,044)

6 months
3 (#976,504)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Concise finite-domain representations for PDDL planning tasks.Malte Helmert - 2009 - Artificial Intelligence 173 (5-6):503-535.

View all 15 citations / Add more citations

References found in this work

Planning in a hierarchy of abstraction spaces.Earl D. Sacerdoti - 1974 - Artificial Intelligence 5 (2):115-135.
Planning for conjunctive goals.David Chapman - 1987 - Artificial Intelligence 32 (3):333-377.
Planning as search: A quantitative approach.Richard E. Korf - 1987 - Artificial Intelligence 33 (1):65-88.

View all 8 references / Add more references