Decidability and complexity of action-based temporal planning over dense time

, , &
Artificial Intelligence 307 (C):103686 (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2022.103686

Links

PhilArchive



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

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

Decidability Results for Metric and Layered Temporal Logics.Angelo Montanari & Alberto Policriti - 1996 - Notre Dame Journal of Formal Logic 37 (2):260-282.
The complexity of temporal logic over the reals.Mark Reynolds - 2010 - Annals of Pure and Applied Logic 161 (8):1063-1096.
A note on unbounded metric temporal logic over dense time domains.Stefano Baratella & Andrea Masini - 2006 - Mathematical Logic Quarterly 52 (5):450-456.
Temporal non-commutative logic: Expressing time, resource, order and hierarchy.Norihiro Kamide - 2009 - Logic and Logical Philosophy 18 (2):97-126.
Theories of ω-layered metric temporal structures: expressiveness and decidability.A. Montanari, A. Peron & A. Policriti - 1999 - Logic Journal of the IGPL 7 (1):79-102.
DEL-based epistemic planning: Decidability and complexity.Thomas Bolander, Tristan Charrier, Sophie Pinchinat & François Schwarzentruber - 2020 - Artificial Intelligence 287 (C):103304.
Reasoning about actions in dynamic linear time temporal logic.L. Giordano, A. Martelli & C. Schwind - 2001 - Logic Journal of the IGPL 9 (2):273-288.
Axiomatisation and decidability off andp in cyclical time.Mark Reynolds - 1994 - Journal of Philosophical Logic 23 (2):197 - 224.
An infinitary variant of Metric Temporal Logic over dense time domains.S. Baratella - 2004 - Mathematical Logic Quarterly 50 (3):249.
Against the Distinction between Intentions for the Future and Intentions for the Present.Chiara Brozzo - 2021 - American Philosophical Quarterly 4 (58):333-346.
Reasoning about sequences of memory states.Rémi Brochenin, Stéphane Demri & Etienne Lozes - 2010 - Annals of Pure and Applied Logic 161 (3):305-323.
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.
Linear temporal logic as an executable semantics for planning languages.Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini & Valentina Poggioni - 2006 - Journal of Logic, Language and Information 16 (1):63-89.
Decidable fragments of first-order temporal logics.Ian Hodkinson, Frank Wolter & Michael Zakharyaschev - 2000 - Annals of Pure and Applied Logic 106 (1-3):85-134.
Complexity, decidability and undecidability results for domain-independent planning.Kutluhan Erol, Dana S. Nau & V. S. Subrahmanian - 1995 - Artificial Intelligence 76 (1-2):75-88.

Analytics

Added to PP
2022-04-08

Downloads
8 (#1,291,989)

6 months
5 (#638,139)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.

View all 6 references / Add more references