English
Related papers

Related papers: The Case for Durative Actions: A Commentary on PDD…

200 papers

PDDL2.1 was designed to push the envelope of what planning algorithms can do, and it has succeeded. It adds two important features: durative actions,which take time (and may have continuous effects); and objective functions for measuring…

Artificial Intelligence · Computer Science 2011-09-27 D. McDermott

Since the introduction of the PDDL+ modeling language, it was known that temporal planning with durative actions (as in PDDL 2.1) could be compiled into PDDL+. However, no practical compilation was presented in the literature ever since. We…

Artificial Intelligence · Computer Science 2026-03-13 Andrea Micheli , Enrico Scala , Alessandro Valentini

Since its establishment, propositional dynamic logic (PDL) has been a subject of intensive academic research and frequent use in the industry. We have studied the complexity of some PDL problems and in this paper, we show results for some…

Logic in Computer Science · Computer Science 2024-01-23 Mohammad Javad Hosseinpour , Farzad Didehvar

Event definitions in Complex Event Processing systems are constrained by the expressiveness of each system's language. Some systems allow the definition of instantaneous complex events, while others allow the definition of durative complex…

Logic in Computer Science · Computer Science 2021-08-31 Manolis Pitsikalis , Alexei Lisitsa , Shan Luo

Dynamic logic is a powerful framework for reasoning about imperative programs. An extension with a concurrent operator [18] was introduced to formalise programs running in parallel. In other direction, other authors proposed a systematic…

Logic in Computer Science · Computer Science 2019-11-04 Leandro Gomes

In this paper we combine Answer Set Programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional…

Artificial Intelligence · Computer Science 2011-10-18 Laura Giordano , Alberto Martelli , Daniele Theseider Dupré

Linear Temporal Logic (LTL) is the standard specification language for reactive systems and is successfully applied in industrial settings. However, many shortcomings of LTL have been identified in the literature, among them the limited…

Logic in Computer Science · Computer Science 2021-04-30 Daniel Neider , Alexander Weinert , Martin Zimmermann

PDDL was originally conceived and constructed as a lingua franca for the International Planning Competition. PDDL2.1 embodies a set of extensions intended to support the expression of something closer to real planning problems. This…

Artificial Intelligence · Computer Science 2011-10-13 M. S. Boddy

Linear Temporal Logic (LTL) is the standard specification language for reactive systems and is successfully applied in industrial settings. However, many shortcomings of LTL have been identified in the literature, among them the limited…

Logic in Computer Science · Computer Science 2019-09-19 Daniel Neider , Alexander Weinert , Martin Zimmermann

Real world applications as in industry and robotics need modelling rich and diverse automated planning problems. Their resolution usually requires coordinated and concurrent action execution. In several cases, these problems are naturally…

Artificial Intelligence · Computer Science 2023-06-14 Damien Pellier , Alexandre Albore , Humbert Fiorino , Rafael Bailon-Ruiz

The class of defeasible logics is only vaguely defined -- it is defined by a few exemplars and the general idea of efficient reasoning with defeasible rules. The recent definition of the defeasible logic $DL(\partial_{||})$ introduced new…

Logic in Computer Science · Computer Science 2024-05-30 Michael J. Maher

PDDL+ is an extension of PDDL2.1 which incorporates fully-featured autonomous processes and allows for better modelling of mixed discrete-continuous domains. Unlike PDDL2.1, PDDL+ lacks a logical semantics, relying instead on…

Artificial Intelligence · Computer Science 2021-11-24 Vitaliy Batusov , Mikhail Soutchanski

Propositional Dynamic Logic, PDL, is a modal logic designed to formalize the reasoning about programs. By extending accessibility between states to states and state sets, concurrent propositional dynamic logic CPDL, is introduced to include…

Logic in Computer Science · Computer Science 2025-01-17 Chun-Yu Lin

The interleaving semantics is not compatible with both action refinement and durational actions. Since many true concurrency semantics are congruent w.r.t. action refinement, notably the causality and the maximality ones, this has…

Logic in Computer Science · Computer Science 2010-04-14 Walid Belkhir

Like any other logical theory, domain descriptions in reasoning about actions may evolve, and thus need revision methods to adequately accommodate new information about the behavior of actions. The present work is about changing action…

Artificial Intelligence · Computer Science 2008-11-13 Ivan Varzinczak

We compare various notions of proper discontinuity for group actions. We also discuss fundamental domains and criteria for cocompactness.

Group Theory · Mathematics 2024-06-18 Michael Kapovich

In recent years research in the planning community has moved increasingly toward s application of planners to realistic problems involving both time and many typ es of resources. For example, interest in planning demonstrated by the space…

Artificial Intelligence · Computer Science 2011-06-24 M. Fox , D. Long

Among the many approaches for reasoning about degrees of belief in the presence of noisy sensing and acting, the logical account proposed by Bacchus, Halpern, and Levesque is perhaps the most expressive. While their formalism is quite…

Artificial Intelligence · Computer Science 2018-09-17 Vaishak Belle , Hector J. Levesque

This paper is an original attempt to understand the foundations of economic reasoning. It endeavors to rigorously define the relationship between subjective interpretations and objective valuations of such interpretations in the context of…

Logic in Computer Science · Computer Science 2024-05-20 Daniel Lu

I comment on the PDDL 2.1 language and its use in the planning competition, focusing on the choices made for accommodating time and concurrency. I also discuss some methodological issues that have to do with the move toward more expressive…

Artificial Intelligence · Computer Science 2011-10-13 H. A. Geffner
‹ Prev 1 2 3 10 Next ›