English
Related papers

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

200 papers

Temporal logics over finite traces have recently seen wide application in a number of areas, from business process modelling, monitoring, and mining to planning and decision making. However, real-life dynamic systems contain a degree of…

Logic in Computer Science · Computer Science 2019-11-19 Fabrizio M. Maggi , Marco Montali , Rafael Peñaloza

Biological systems, including human beings, have the innate ability to perform complex tasks in versatile and agile manner. Researchers in sensorimotor control have tried to understand and formally define this innate property. The idea,…

Robotics · Computer Science 2023-09-27 Matteo Saveriano , Fares J. Abu-Dakka , Aljaz Kramberger , Luka Peternel

Action-at-a-distance is a generic property of physical theories. As such, it is not a fruitful idea in theory building. Its absence confers a rigidity on a theory which we exemplify through analysis of long-range correlations of the…

General Physics · Physics 2007-05-23 George Svetlichny

In this paper we investigate the notion of legibility in sequential decision tasks under uncertainty. Previous works that extend legibility to scenarios beyond robot motion either focus on deterministic settings or are computationally too…

Robotics · Computer Science 2024-04-19 Miguel Faria , Francisco S. Melo , Ana Paiva

In order to enrich dynamic semantic theories with a `pragmatic' capacity, we combine dynamic and nonmonotonic (preferential) logics in a modal logic setting. We extend a fragment of Van Benthem and De Rijke's dynamic modal logic with…

cmp-lg · Computer Science 2008-02-03 Jan Jaspars , Megumi Kameyama

Modular logic programs provide a way of viewing logic programs as consisting of many independent, meaningful modules. This paper introduces first-order modular logic programs, which can capture the meaning of many answer set programs. We…

Logic in Computer Science · Computer Science 2017-02-21 Amelia Harrison , Yuliya Lierler

Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit…

Logic in Computer Science · Computer Science 2015-10-27 Samuel Bucheli

Action languages are formal models of parts of natural language that are designed to describe effects of actions. Many of these languages can be viewed as high level notations of answer set programs structured to represent transition…

Artificial Intelligence · Computer Science 2025-06-24 Joseph Babb , Joohyung Lee

Despite their importance in activated processes, transition-event durations -- which are much shorter than first passage times -- have not received a complete theoretical treatment. We therefore study the distribution of durations of…

Statistical Mechanics · Physics 2015-06-25 Bin W. Zhang , David Jasnow , Daniel M. Zuckerman

We present Dynamic Epistemic Temporal Logic, a framework for reasoning about operations on multi-agent Kripke models that contain a designated temporal relation. These operations are natural extensions of the well-known "action models" from…

Logic in Computer Science · Computer Science 2014-11-25 Bryan Renne , Joshua Sack , Audrey Yap

Dynamic Epistemic Logic (DEL) is a logical framework in which one can describe in great detail how actions are perceived by the agents, and how they affect the world. DEL games were recently introduced as a way to define classes of games…

Logic in Computer Science · Computer Science 2020-01-22 Bastien Maubert , Aniello Murano , Sophie Pinchinat , François Schwarzentruber , Silvia Stranieri

We propose the concept of adaptable processes as a way of overcoming the limitations that process calculi have for describing patterns of dynamic process evolution. Such patterns rely on direct ways of controlling the behavior and location…

Logic in Computer Science · Computer Science 2015-07-01 Mario Bravetti , Cinzia Di Giusto , Jorge A Perez , Gianluigi Zavattaro

We endow prioritised default logic (PDL) with argumentation semantics using the ASPIC+ framework for structured argumentation, and prove that the conclusions of the justified arguments are exactly the prioritised default extensions.…

Artificial Intelligence · Computer Science 2015-07-02 Anthony P. Young , Sanjay Modgil , Odinaldo Rodrigues

The complex Langevin method is a general method to treat systems with complex action, such as QCD at nonzero density. The formal justification relies on the absence of certain boundary terms, both at infinity and at the unavoidable poles of…

High Energy Physics - Lattice · Physics 2021-11-03 Erhard Seiler

Dynamical systems are abstract models of interaction between space and time. They are often used in fields such as physics and engineering to understand complex processes, but due to their general nature, they have found applications for…

Logic · Mathematics 2023-06-01 David Fernández-Duque , Yoàv Montacute

Cycles of attacking arguments pose non-trivial issues in Dung style argumentation theory, apparent behavioural difference between odd and even length cycles being a notable one. While a few methods were proposed for treating them, to - in…

Artificial Intelligence · Computer Science 2018-02-06 Ryuta Arisaka , Jeremie Dauphin

We consider an extension of linear-time temporal logic (LTL) with both local and remote data constraints interpreted over a concrete domain. This extension is a natural extension of constraint LTL and the Temporal Logic of Repeating Values,…

Logic in Computer Science · Computer Science 2022-06-06 Ashwin Bhaskar

Many celebrate the Internet's ability to connect individuals and facilitate collective action toward a common goal. While numerous systems have been designed to support particular aspects of collective action, few systems support…

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

Propositional dynamic logic (PDL) is an important modal logic used to specify and reason about the behavior of software. A challenging problem in the context of PDL is solving fixed-point equations, i.e., formulae of the form $x \equiv…

Logic in Computer Science · Computer Science 2024-12-06 Tim S. Lyon