English
Related papers

Related papers: Complete Intuitionistic Temporal Logics in Topolog…

200 papers

Infinite-state reactive synthesis has attracted significant attention in recent years, which has led to the emergence of novel symbolic techniques for solving infinite-state games. Temporal logics featuring variables over infinite domains…

Logic in Computer Science · Computer Science 2024-11-12 Philippe Heim , Rayna Dimitrova

This paper describes a method for converting formulas in finite propositional linear-time temporal logic (Finite LTL) into finite-state automata whose languages are the models of the given formula. Finite LTL differs from traditional LTL in…

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

We present a hierarchical framework for analysing propositional linear-time temporal logic (PTL) to obtain standard results such as a small model property, decision procedures and axiomatic completeness. Both finite time and infinite time…

Logic in Computer Science · Computer Science 2007-05-23 Ben Moszkowski

We develop team semantics for Linear Temporal Logic (LTL) to express hyperproperties, which have recently been identified as a key concept in the verification of information flow properties. Conceptually, we consider an asynchronous and a…

Logic in Computer Science · Computer Science 2018-06-26 Andreas Krebs , Arne Meier , Jonni Virtema , Martin Zimmermann

This paper introduces robust differential dynamic logic (a fragment of differential dynamic logic) to specify and reason about robust hybrid systems. Practically meaningful syntactic restrictions naturally ensure that definable properties…

Logic in Computer Science · Computer Science 2026-02-27 Noah Abou El Wafa , André Platzer

We study dynamic changes of agents' observational power in logics of knowledge and time. We consider CTL*K, the extension of CTL* with knowledge operators, and enrich it with a new operator that models a change in an agent's way of…

Logic in Computer Science · Computer Science 2018-09-05 Aurèle Barrière , Bastien Maubert , Aniello Murano , Sasha Rubin

The paper studies problems of satisfiability, decidability and admissibility of inference rules, conceptions of knowledge and agent's knowledge in non-transitive temporal linear logic LTL(Past,m). We find algorithms solving mentioned…

Logic in Computer Science · Computer Science 2014-06-12 Vladimir Rybakov

We propose a validity preserving translation from a subset of epistemic Alternating-time Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and…

Logic in Computer Science · Computer Science 2013-03-05 Dimitar P. Guelev

This paper presents a bimodal logic for reasoning about knowledge during knowledge acquisition. One of the modalities represents (effort during) non-deterministic time and the other represents knowledge. The semantics of this logic are…

Logic in Computer Science · Computer Science 2007-05-23 Konstantinos Georgatos

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 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

In this paper we combine Answer Set Programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional…

Artificial Intelligence · Computer Science 2011-10-18 Laura Giordano , Alberto Martelli , Daniele Theseider Dupré

We introduce and develop a set-based semantics for asynchronous TeamLTL. We consider two canonical logics in this setting: the extensions of TeamLTL by the Boolean disjunction and by the Boolean negation. We establish fascinating…

Logic in Computer Science · Computer Science 2023-04-24 Juha Kontinen , Max Sandström , Jonni Virtema

An inductive logic can be formulated in which the elements are not propositions or probability distributions, but information systems. The logic is complete for information systems with binary hypotheses, i.e., it applies to all such…

Artificial Intelligence · Computer Science 2013-04-11 Norman C. Dalkey

Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal…

Logic in Computer Science · Computer Science 2016-03-09 Joelle Despeyroux , Kaustuv Chaudhuri

We investigate the completeness of intuitionistic logic with respect to Prawitz's proof-theoretic validity. As an intuitionistic natural deduction system, we apply atomic second-order intuitionistic propositional logic. By developing phase…

Logic · Mathematics 2025-05-19 Ryo Takemura

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

Temporal logics have been studied as an approach to the specification of hyperproperties, resulting in the conception of "hyperlogics". With a few recent exceptions, the hyperlogics thus far developed can only relate different traces of a…

Logic in Computer Science · Computer Science 2024-02-06 Jens Oliver Gutsfeld , Arne Meier , Christoph Ohrem , Jonni Virtema

Our paper investigates the linear logic of knowledge and time LTK_r with reflexive intransitive time relation. The logic is defined semantically, -- as the set of formulas which are true at special frames with intransitive and reflexive…

Logic in Computer Science · Computer Science 2014-07-29 Alexandra Lukyanchuk , Vladimir Rybakov

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka
‹ Prev 1 8 9 10 Next ›