中文
相关论文

相关论文: Decidability of the interval temporal logic ABBar …

200 篇论文

Interval temporal logics (ITLs) are logics for reasoning about temporal statements expressed over intervals, i.e., periods of time. The most famous ITL studied so far is Halpern and Shoham's HS, which is the logic of the thirteen Allen's…

计算机科学中的逻辑 · 计算机科学 2010-06-09 Davide Bresolin , Pietro Sala , Guido Sciavicco

In the plethora of fragments of Halpern and Shoham's modal logic of time intervals (HS), the logic AB of Allen's relations Meets and Started-by is at a central position. Statements that may be true at certain intervals, but at no…

计算机科学中的逻辑 · 计算机科学 2016-09-15 Laura Bozzelli , Alberto Molinari , Angelo Montanari , Adriano Peron , Pietro Sala

Interval temporal logics provide a natural framework for qualitative and quantitative temporal reason- ing over interval structures, where the truth of formulae is defined over intervals rather than points. In this paper, we study the…

计算机科学中的逻辑 · 计算机科学 2011-06-08 Davide Bresolin , Angelo Montanari , Pietro Sala , Guido Sciavicco

Interval temporal logics provide a general framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. In this paper, we identify all fragments…

计算机科学中的逻辑 · 计算机科学 2012-10-10 Davide Bresolin , Dario Della Monica , Angelo Montanari , Pietro Sala , Guido Sciavicco

We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theorem. We show that it has a PSPACE-complete satisfiability problem…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Stephane Demri , Alexander Rabinovich

The choice of the right trade-off between expressiveness and complexity is the main issue in interval temporal logic. In their seminal paper, Halpern and Shoham showed that the satisfiability problem for HS (the temporal logic of Allen's…

计算机科学中的逻辑 · 计算机科学 2021-09-20 Laura Bozzelli , Angelo Montanari , Adriano Peron , Pietro Sala

We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled temporal algebra and its reasoning algorithms. The labeled…

人工智能 · 计算机科学 2011-06-01 F. Barber

We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point…

计算机科学中的逻辑 · 计算机科学 2021-06-17 Jan Triska , Vilem Vychodil

Allen's Interval Algebra constitutes a framework for reasoning about temporal information in a qualitative manner. In particular, it uses intervals, i.e., pairs of endpoints, on the timeline to represent entities corresponding to actions,…

人工智能 · 计算机科学 2019-09-04 Tomi Janhunen , Michael Sioutis

In temporal logics, a central question is about the choice of modalities and their relative expressive power, in comparison to the complexity of decision problems such as satisfiability. In this tutorial, we will illustrate the study of…

计算机科学中的逻辑 · 计算机科学 2017-03-08 Kamal Lodaya , Paritosh K. Pandya

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,…

计算机科学中的逻辑 · 计算机科学 2022-06-06 Ashwin Bhaskar

Metric Temporal Logic $\mathsf{MTL}[\until_I,\since_I]$ is one of the most studied real time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of…

计算机科学中的逻辑 · 计算机科学 2014-04-29 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh Pandya

We consider Minkowski spacetime, the set of all point-events of spacetime under the relation of causal accessibility. That is, ${\sf x}$ can access ${\sf y}$ if an electromagnetic or (slower than light) mechanical signal could be sent from…

逻辑 · 数学 2017-06-13 Robin Hirsch , Mark Reynolds

The expressive power of interval temporal logics (ITLs) makes them one of the most natural choices in a number of application domains, ranging from the specification and verification of complex reactive systems to automated planning.…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Laura Bozzelli , Alberto Molinari , Angelo Montanari , Adriano Peron , Pietro Sala

Metric Temporal Logic, $\mtlfull$ is amongst the most studied real-time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval…

计算机科学中的逻辑 · 计算机科学 2013-11-28 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh K. Pandya

In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times…

人工智能 · 计算机科学 2024-11-20 Arvid Becker , Pedro Cabalar , Martín Diéguez , Torsten Schaub , Anna Schuhmann

Our manuscript studies linear temporal (with UNTIL and NEXT) logic based at a conception of intransitive time. non-transitive time. In particular, we demonstrate how the notion of knowledge might be represented in such a framework (here we…

计算机科学中的逻辑 · 计算机科学 2015-03-31 Vladimir Rybakov

Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running systems. One can consider more general models for linear time,…

计算机科学中的逻辑 · 计算机科学 2011-01-11 Julien Cristau

We study an extension of $\mtl$ in pointwise time with rational expression guarded modality $\reg_I(\re)$ where $\re$ is a rational expression over subformulae. We study the decidability and expressiveness of this extension ($\mtl$+$\varphi…

计算机科学中的逻辑 · 计算机科学 2017-05-04 Shankara Narayanan Krishna , Khushraj Madnani , P. K. Pandya

The paper presents probabilistic extensions of interval temporal logic (ITL) and duration calculus (DC) with infinite intervals and complete Hilbert-style proof systems for them. The completeness results are a strong completeness theorem…

计算机科学中的逻辑 · 计算机科学 2019-03-14 Dimitar P. Guelev
‹ 上一页 1 2 3 10 下一页 ›