English
Related papers

Related papers: A Sequent Calculus for Dynamic Topological Logic

200 papers

We introduce a new Gentzen-style framework of grafted hypersequents that combines the formalism of nested sequents with that of hypersequents. To illustrate the potential of the framework, we present novel calculi for the modal logics…

Logic in Computer Science · Computer Science 2023-08-01 Roman Kuznets , Björn Lellmann

This paper revisits the classical notion of sampling in the setting of real-time temporal logics for the modeling and analysis of systems. The relationship between the satisfiability of Metric Temporal Logic (MTL) formulas over…

Logic in Computer Science · Computer Science 2015-03-13 Carlo A. Furia , Matteo Rossi

A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal…

Logic in Computer Science · Computer Science 2012-04-12 Alwen Tiu , Egor Ianovski , Rajeev Gore

We give a linear nested sequent calculus for the basic normal tense logic Kt. We show that the calculus enables backwards proof-search, counter-model construction and syntactic cut-elimination. Linear nested sequents thus provide the…

Logic in Computer Science · Computer Science 2019-07-03 Rajeev Goré , Björn Lellmann

We introduce a sequent calculus for the propositional team logic with both the split disjunction and the inquisitive disjunction consisting of a Gentzen-style system (G3-like) for classical propositional logic together with two…

Logic · Mathematics 2025-08-12 Aleksi Anttila , Rosalie Iemhoff , Fan Yang

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…

Logic in Computer Science · Computer Science 2019-03-14 Dimitar P. Guelev

This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains.…

Logic · Mathematics 2023-11-09 Tim S. Lyon , Eugenio Orlandelli

We consider an extension of the modal logic of transitive closure K+ with some inifinitary derivations and present a sequent calculus for this extension, which allows non-well-founded proofs. For the given calculus, we obtain the…

Logic · Mathematics 2024-11-25 Daniyar Shamkanov

The language of linear temporal logic can be interpreted over the class of dynamic topological systems, giving rise to the intuitionistic temporal logic ${{\sf ITL}^{\sf c}}_{\Diamond,\forall}$, recently shown to be decidable by…

Logic in Computer Science · Computer Science 2019-10-03 Joseph Boudou , Martín Diéguez , David Fernández-Duque

Temporal logic is a very powerful formalism deeply investigated and used in formal system design and verification. Its application usually reduces to solving specific decision problems such as model checking and satisfiability. In these…

Logic in Computer Science · Computer Science 2016-09-15 Gaëlle Fontaine , Fabio Mogavero , Aniello Murano , Giuseppe Perelli , Loredana Sorrentino

Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computational framework for modeling dynamic applications. In this…

Artificial Intelligence · Computer Science 2024-01-23 Pedro Cabalar , Martín Diéguez , François Laferrière , Torsten Schaub

We investigate a recent proposal for modal hypersequent calculi. The interpretation of relational hypersequents incorporates an accessibility relation along the hypersequent. These systems give the same interpretation of hypersequents as…

Logic · Mathematics 2021-12-22 Samara Burns , Richard Zach

This paper describes a technique for inferring temporal-logic properties for sets of finite data streams. Such data streams arise in many domains, including server logs, program testing, and financial and marketing data; temporal-logic…

Logic in Computer Science · Computer Science 2020-06-09 Samuel Huang , Rance Cleaveland

Data-aware modal logics offer a powerful formalism for reasoning about semi-structured queries in languages such as DataGL, XPath, and GQL. In brief, these logics can be viewed as modal systems capable of expressing both reachability…

Logic in Computer Science · Computer Science 2025-10-03 Carlos Areces , Valentin Cassano , Danae Dutto , Raul Fervari

We consider modal logic extended with the well-known temporal operator 'eventually' and provide a cut-elimination procedure for a cyclic sequent calculus that captures this fragment. The work showcases an adaptation of the reductive…

Logic in Computer Science · Computer Science 2025-11-05 Bahareh Afshari , Johannes Kloibhofer

We present cut-free labelled sequent calculi for a central formalism in logics of agency: STIT logics with temporal operators. These include sequent systems for Ldm, Tstit and Xstit. All calculi presented possess essential structural…

Logic in Computer Science · Computer Science 2019-04-23 Kees van Berkel , Tim Lyon

The aim of this work is to provide a family of qualitative theories for spatial change in general, and for motion of spatial scenes in particular. To achieve this, we consider a spatio-temporalisation MTALC(Dx), of the well-known ALC(D)…

Artificial Intelligence · Computer Science 2020-03-02 Amar Isli

Dynamic Topological Logic (DTL) is a multimodal system for reasoning about dynamical systems. It is defined semantically and, as such, most of the work done in the field has been model-theoretic. In particular, the problem of finding a…

Logic · Mathematics 2012-01-26 David Fernández Duque

We introduce a weighted linear dynamic logic (weighted LDL for short) and show the expressive equivalence of its formulas to weighted rational expressions. This adds a new characterization for recognizable series to the fundamental…

Logic in Computer Science · Computer Science 2016-09-15 Manfred Droste , George Rahonis

We establish a correspondence between (fragments of) $\mathcal{TEL}^\bigcirc$, a temporal extension of the $\mathcal{EL}$ description logic with the LTL operator $\bigcirc^k$, and some specific kinds of formal grammars, in particular,…

Logic in Computer Science · Computer Science 2025-08-04 Camille Bourgaux , Anton Gnatenko , Michaël Thomazo