English
Related papers

Related papers: The Temporal Logic of two dimensional Minkowski sp…

200 papers

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…

Logic in Computer Science · Computer Science 2021-09-20 Laura Bozzelli , 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…

Logic in Computer Science · Computer Science 2013-11-28 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh K. Pandya

We investigate the computational complexity of admissibility of inference rules in infinite-valued {\L}ukasiewicz propositional logic (\L). It was shown in [13] that admissibility in {\L} is checkable in PSPACE. We establish that this…

Logic in Computer Science · Computer Science 2013-05-22 Emil Jeřábek

We combine linear temporal logic (with both past and future modalities) with a deontic version of justification logic to provide a framework for reasoning about time and epistemic and normative reasons. In addition to temporal modalities,…

Logic in Computer Science · Computer Science 2025-01-17 Meghdad Ghari

Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…

Artificial Intelligence · Computer Science 2025-05-08 Luise Ge , Brendan Juba , Kris Nilsson

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…

Logic in Computer Science · Computer Science 2014-04-29 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh Pandya

It is shown that order-invariance of two-variable first-logic is decidable in the finite. This is an immediate consequence of a decision procedure obtained for the finite satisfiability problem for existential second-order logic with two…

Logic in Computer Science · Computer Science 2016-04-21 Thomas Zeume , Frederik Harwath

We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are…

Logic in Computer Science · Computer Science 2011-04-19 Juha Kontinen , Antti Kuusisto , Peter Lohmann , Jonni Virtema

The fact that in Minkowski space, space and time are both quantized does not have to be introduced as a new postulate in physics, but can actually be derived by combining certain features of General Relativity and Quantum Mechanics. This is…

General Relativity and Quantum Cosmology · Physics 2007-05-23 G. 't Hooft

In this paper, we construct and investigate a hierarchy of spatio-temporal formalisms that result from various combinations of propositional spatial and temporal logics such as the propositional temporal logic PTL, the spatial logics RCC-8,…

Artificial Intelligence · Computer Science 2011-10-13 D. Gabelaia , R. Kontchakov , A. Kurucz , F. Wolter , M. Zakharyaschev

In this two-part essay, we distinguish several senses in which general relativity has been regarded as "locally special relativistic". Here, in Part 1, we focus on senses in which a relativistic spacetime has been said to be "locally…

History and Philosophy of Physics · Physics 2023-05-17 Samuel C. Fletcher , James Owen Weatherall

In this paper, we address complexity issues for timeline-based planning over dense temporal domains. The planning problem is modeled by means of a set of independent, but interacting, components, each one represented by a number of state…

Logic in Computer Science · Computer Science 2018-09-11 Laura Bozzelli , Alberto Molinari , Angelo Montanari , Adriano Peron

This paper surveys main and recent studies on temporal logics in a broad sense by presenting various logic systems, dealing with various time structures, and discussing important features, such as decidability (or undecidability) results,…

Logic in Computer Science · Computer Science 2013-08-06 Savas Konur

We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…

Logic in Computer Science · Computer Science 2024-04-05 Michael Benedikt , Egor V. Kostylev , Tony Tan

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…

Logic in Computer Science · Computer Science 2012-10-10 Davide Bresolin , Dario Della Monica , Angelo Montanari , Pietro Sala , Guido Sciavicco

In this paper, we focus our attention on the interval temporal logic of the Allen's relations "meets", "begins", and "begun by" (ABBar for short), interpreted over natural numbers. We first introduce the logic and we show that it is…

Logic in Computer Science · Computer Science 2010-02-03 A. Montanari , G. Puppis , P. Sala , G. Sciavicco

We present a novel derivation of both the Minkowski metric and Lorentz transformations from the consistent quantification of a causally ordered set of events with respect to an embedded observer. Unlike past derivations, which have relied…

Mathematical Physics · Physics 2014-12-22 Kevin H. Knuth , Newshaw Bahreyni

Formalisms based on temporal logics interpreted over finite strict linear orders, known in the literature as finite traces, have been used for temporal specification in automated planning, process modelling, (runtime) verification and…

Logic in Computer Science · Computer Science 2022-02-02 Alessandro Artale , Andrea Mazzullo , Ana Ozaki

We study the finitary satisfiability problem for first order logic with two variables and two binary relations, corresponding to the induced successor relations of two finite linear orders. We show that the problem is decidable in NEXPTIME.

Logic in Computer Science · Computer Science 2015-03-20 Diego Figueira

In 1908, Minkowski put forward the idea that invariance under what we call today the Lorentz group, $GL(1,3, {\bf R})$, would be more meaningful in a four-dimensional space-time continuum. This suggestion implies that space and time are…

General Relativity and Quantum Cosmology · Physics 2009-12-02 Orfeu Bertolami