English
Related papers

Related papers: Expressiveness of Metric modalities for continuous…

200 papers

This paper establishes relative expressiveness results for several modal mu-calculi interpreted over timed automata. These mu-calculi combine modalities for expressing passage of (real) time with a general framework for defining formulas…

Logic in Computer Science · Computer Science 2025-08-08 Rance Cleaveland , Jeroen J. A. Keiren , Peter Fontana

It is well known that MTL with integer endpoints is unable to express all of monadic first-order logic of order and metric (FO(<,+1)). Indeed, MTL is unable to express the counting modalities $C_n$ that assert a properties holds $n$ times…

Logic in Computer Science · Computer Science 2012-09-05 Paul Hunter

Metric Temporal Logic (MTL) is a generalisation of Linear Temporal Logic in which the Until and Since modalities are annotated with intervals that express metric constraints. A seminal result of Hirshfeld and Rabinovich shows that over the…

Logic in Computer Science · Computer Science 2013-02-19 Paul Hunter , Joël Ouaknine , James Worrell

Here we deal with the logic of [GuSh 533], which tries to capture polynomial time (for finite models). There it is proved that the logic cannot say much on models with equality only. Here we prove that it cannot say much on models for which…

Logic · Mathematics 2009-09-25 Saharon Shelah

Pnueli first noticed that certain simple 'counting' properties appear to be inexpressible in popular timed temporal logics such as Metric Interval Temporal Logic (MITL). This interesting observation has since been studied extensively,…

Logic in Computer Science · Computer Science 2024-10-02 Hsi-Ming Ho , Khushraj Madnani

It is known that Metric Temporal Logic (MTL) is strictly less expressive than the Monadic First-Order Logic of Order and Metric (FO[<, +1]) when interpreted over timed words; this remains true even when the time domain is bounded a priori.…

Logic in Computer Science · Computer Science 2023-06-22 Hsi-Ming Ho , Joël Ouaknine , James Worrell

Propositional temporal logic over the real number time flow is finitely axiomatisable, but its first-order counterpart is not recursively axiomatisable. We study the logic that combines the propositional axiomatisation with the usual axioms…

Logic · Mathematics 2025-08-13 Robert Goldblatt

The expressiveness of Metric Temporal Logic (MTL) has been extensively studied throughout the last two decades. In particular, it has been shown that the \emph{interval-based} semantics of MTL is strictly more expressive than the…

Logic in Computer Science · Computer Science 2026-03-20 Mohammed Aristide Foughali

A seminal result of Kamp is that over the reals Linear Temporal Logic (LTL) has the same expressive power as first-order logic with binary order relation < and monadic predicates. A key question is whether there exists an analogue of Kamp's…

Logic in Computer Science · Computer Science 2013-02-19 Paul Hunter , Joël Ouaknine , James Worrell

This paper argues that a combined treatment of probabilities, time and actions is essential for an appropriate logical account of the notion of probability; and, based on this intuition, describes an expressive probabilistic temporal logic…

Logic in Computer Science · Computer Science 2017-10-10 Bruno Woltzenlogel Paleo

We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We…

Logic · Mathematics 2025-03-31 Aleksi Anttila , Søren Brinck Knudstorp

In this short note we address the issue of expressing norms (such as obligations and prohibitions) in temporal logic. In particular, we address the argument from [Governatori 2015] that norms cannot be expressed in Linear Time Temporal…

Artificial Intelligence · Computer Science 2016-08-25 Natasha Alechina , Mehdi Dastani , Brian Logan

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…

Logic in Computer Science · Computer Science 2017-05-04 Shankara Narayanan Krishna , Khushraj Madnani , P. K. Pandya

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for…

Logic · Mathematics 2020-08-12 Robert Goldblatt , Ian Hodkinson

This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations…

Logic in Computer Science · Computer Science 2015-07-01 François Laroussinie , Antoine Meyer , Eudes Petonnet

Ability to count number of occurrences of events within a specified time interval is very useful in specification of resource bounded real time computation. In this paper, we study an extension of Metric Temporal Logic ($\mathsf{MTL}$) with…

Logic in Computer Science · Computer Science 2015-12-31 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh Pandya

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

Extending and generalizing the approach of 2-sequents (Masini, 1992), we present sequent calculi for the classical modal logics in the K, D, T, S4 spectrum. The systems are presented in a uniform way-different logics are obtained by tuning…

Logic in Computer Science · Computer Science 2020-01-08 Simone Martini , Andrea Masini , Margherita Zorzi

Irrespective of local conditions imposed on the metric, any extendible spacetime U has a maximal extension containing no closed causal curves outside the chronological past of U. We prove this fact and interpret it as impossibility (in…

General Relativity and Quantum Cosmology · Physics 2014-02-14 S. Krasnikov

We address the relative expressiveness of defeasible logics in the framework DL. Relative expressiveness is formulated as the ability to simulate the reasoning of one logic within another logic. We show that such simulations must be…

Artificial Intelligence · Computer Science 2021-02-16 Michael Maher
‹ Prev 1 2 3 10 Next ›