English
Related papers

Related papers: Bisimulations for intuitionistic temporal logics

200 papers

ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions of agents in order to enforce a given property. In this…

Logic in Computer Science · Computer Science 2015-07-01 Francois Laroussinie , Nicolas Markey , Ghassan Oreiby

The usual reading of logical implication "A implies B" as "if A then B" fails in intuitionistic logic: there are formulas A and B such that "A implies B" is not provable, even though B is provable whenever A is provable. Intuitionistic…

Logic in Computer Science · Computer Science 2018-10-18 Andrea Condoluci , Matteo Manighetti

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

We introduce an intuitionistic modal logic strictly contained in the intuitionistic modal logic IK and being an appropriate candidate for the title of ``minimal normal intuitionistic modal logic''.

Logic · Mathematics 2025-02-27 Philippe Balbiani , Çigdem Gencer

Open bisimilarity is defined for open process terms in which free variables may appear. The insight is, in order to characterise open bisimilarity, we move to the setting of intuitionistic modal logics. The intuitionistic modal logic…

Logic in Computer Science · Computer Science 2023-06-22 Ki Yung Ahn , Ross Horne , Alwen Tiu

We are sometimes forced to use the Interrupted Time Series (ITS) design as an identification strategy for potential policy change, such as when we only have a single treated unit and no comparable controls. For example, with recent county-…

Methodology · Statistics 2020-02-17 Luke Miratrix

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

The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…

Logic in Computer Science · Computer Science 2026-05-08 Piotr Kozicki , Alex Kavvos

Many forms of dependence manifest themselves over time, with behavior of variables in dynamical systems as a paradigmatic example. This paper studies temporal dependence in dynamical systems from a logical perspective, by enriching a…

Logic in Computer Science · Computer Science 2024-03-29 Alexandru Baltag , Johan van Benthem , Dazhu Li

We show that a history-based variant of alternating bisimulation with imperfect information allows it to be related to a variant of Alternating-time Temporal Logic (ATL) with imperfect information by a full Hennessy-Milner theorem. The…

Logic in Computer Science · Computer Science 2020-06-29 Francesco Belardinelli , Catalin Dima , Vadim Malvone , Ferucio Tiplea

We extend the theory of labeled Markov processes with internal nondeterminism, a fundamental concept for the further development of a process theory with abstraction on nondeterministic continuous probabilistic systems. We define…

Logic in Computer Science · Computer Science 2015-03-17 Pedro D'Argenio , Pedro Sánchez Terraf , Nicolás Wolovick

This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze

We propose algorithms for performing model checking and control synthesis for discrete-time uncertain systems under linear temporal logic (LTL) specifications. We construct temporal logic trees (TLT) from LTL formulae via reachability…

Systems and Control · Electrical Eng. & Systems 2020-07-07 Yulong Gao , Alessandro Abate , Frank J. Jiang , Mirco Giacobbe , Lihua Xie , Karl H. Johansson

We study comparisons between interpretations in description logics with respect to "logical consequences" of the form of semi-positive concepts (like semi-positive concept assertions). Such comparisons are characterized by conditions…

Logic in Computer Science · Computer Science 2013-04-23 Ali Rezaei Divroodi , Linh Anh Nguyen

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…

Logic in Computer Science · Computer Science 2022-05-25 Luca Geatti , Alessandro Gianola , Nicola Gigante

We introduce a novel semantics for a multi-agent epistemic operator of knowing how, based on an indistinguishability relation between plans. Our proposal is, arguably, closer to the standard presentation of knowing that modalities in…

Logic in Computer Science · Computer Science 2023-04-04 Carlos Areces , Raul Fervari , Andrés R. Saravia , Fernando R. Velázquez-Quesada

We design temporal description logics suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions (ranging…

Logic in Computer Science · Computer Science 2014-05-05 Alessandro Artale , Roman Kontchakov , Vladislav Ryzhikov , Michael Zakharyaschev

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 introduce and investigate a number of fragments of propo- sitional temporal logic LTL over the flow of time (Z, <). The fragments are defined in terms of the available temporal operators and the structure of the clausal normal form of…

Logic in Computer Science · Computer Science 2013-10-11 A. Artale , R. Kontchakov , V. Ryzhikov , M. Zakharyaschev

We explore various semantic understandings of dual intuitionistic logic by exploring the relationship between co-Heyting algebras and topological spaces. First, we discuss the relevant ideas in the setting of Heyting algebras and…

Logic · Mathematics 2024-11-26 Safal Raman Aryal