English
Related papers

Related papers: Expressibility of norms in temporal logic

200 papers

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

We address the problem of measuring inconsistency in declarative process specifications, with an emphasis on linear temporal logic on fixed traces (LTLff). As we will show, existing inconsistency measures for classical logic cannot provide…

Artificial Intelligence · Computer Science 2022-06-16 Carl Corea , John Grant , Matthias Thimm

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

In this article we study linear temporal logics with team semantics (TeamLTL) that are novel logics for defining hyperproperties. We define Kamp-type translations of these logics into fragments of first-order team logic and second-order…

Logic in Computer Science · Computer Science 2021-10-22 Juha Kontinen , Max Sandström

The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and…

Logic in Computer Science · Computer Science 2019-11-20 Laura Bozzelli , Aniello Murano , Adriano Peron

A new logic for verification of security policies is proposed. The logic, HyperLTL, extends linear-time temporal logic (LTL) with connectives for explicit and simultaneous quantification over multiple execution paths, thereby enabling…

Logic in Computer Science · Computer Science 2013-07-10 Masoud Koleini , Michael R. Clarkson , Kristopher K. Micinski

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

Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. We also…

Logic in Computer Science · Computer Science 2017-01-11 Joel Ouaknine , James Worrell

In this paper we propose a many-valued temporal conditional logic. We start from a many-valued logic with typicality, and extend it with the temporal operators of the Linear Time Temporal Logic (LTL), thus providing a formalism which is…

Logic in Computer Science · Computer Science 2024-09-17 Mario Alviano , Laura Giordano , Daniele Theseider Dupré

We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by the previous modalities, over the real line, or over the positive reals.…

Logic in Computer Science · Computer Science 2017-01-11 Yoram Hirshfeld , Alexander Rabinovich

Our aim is to investigate ontology-based data access over temporal data with validity time and ontologies capable of temporal conceptual modelling. To this end, we design a temporal description logic, TQL, that extends the standard ontology…

Logic in Computer Science · Computer Science 2013-05-01 Alessandro Artale , Roman Kontchakov , Frank Wolter , Michael Zakharyaschev

Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…

Artificial Intelligence · Computer Science 2009-09-29 Michael J. Maher

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

Normative reasoning is a type of reasoning that involves normative or deontic modality, such as obligation and permission. While large language models (LLMs) have demonstrated remarkable performance across various reasoning tasks, their…

Artificial Intelligence · Computer Science 2025-11-03 Kentaro Ozeki , Risako Ando , Takanobu Morishita , Hirohiko Abe , Koji Mineshima , Mitsuhiro Okada

Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent extensions of Linear Temporal Logic to specify properties about data languages. In this paper, we consider the class of data languages of non-monotonic…

Logic in Computer Science · Computer Science 2014-05-23 Claudia Carapelle , Shiguang Feng , Oliver Fernández Gil , Karin Quaas

We develop a timeout based extension of propositional linear temporal logic (which we call TLTL) to specify timing properties of timeout based models of real time systems. TLTL formulas explicitly refer to a running global clock together…

Logic in Computer Science · Computer Science 2010-12-20 Janardan Misra , Suman Roy

In this paper we discuss some reasons why temporal logic might not be suitable to model real life norms. To show this, we present a novel deontic logic contrary-to-duty/derived permission paradox based on the interaction of obligations,…

Artificial Intelligence · Computer Science 2022-09-13 Guido Governatori

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 show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e.,…

Logic in Computer Science · Computer Science 2019-01-23 Mikhail Rybakov , Dmitry Shkatov

This paper introduces a logic with a class of social network models that is based on standard Linear Temporal Logic (LTL), leveraging the power of existing model checkers for the analysis of social networks. We provide a short literature…

Social and Information Networks · Computer Science 2021-03-15 Vitor Machado , Mario Benevides