Complexity issues for timeline-based planning over dense time under future and minimal semantics
type: Item
instance of: scholarly article
title: Complexity issues for timeline-based planning over dense time under future and minimal semantics
author: Laura Bozzelli
author: Angelo Montanari
author: Adriano Peron
published in: Theoretical Computer Science
publication date: 2022-01-18T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7458778
zbMATH Keywords: timeline-based planning
zbMATH Keywords: dense time
zbMATH Keywords: complexity
zbMATH Keywords: timed automata
zbMATH Keywords: event-clock automata
describes a project that uses: PDDL
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.12.004
OpenAlex ID: W4200471605
cites work: Q5875669
cites work: Q4449295
cites work: Q2999180
cites work: Planning and execution with flexible timelines: a formal account
cites work: A really temporal logic
cites work: Constraint-based attribute and interval planning
cites work: Timeline-based planning over dense temporal domains
cites work: Q3384890
cites work: Foundations of Software Science and Computation Structures
cites work: A theory of timed automata
cites work: On the decidability and complexity of Metric Temporal Logic over finite words
cites work: The benefits of relaxing punctuality
cites work: Event-clock automata: a determinizable class of timed automata
cites work: Event Clock Automata: From Theory to Practice
cites work: Q5590814
cites work: Q4939602
cites work: Q4003357
DOI: 10.1016/J.TCS.2021.12.004
description: scientific article; zbMATH DE number 7458778