English
Related papers

Related papers: A discrete-time temporal deontic STIT logic based …

200 papers

This paper develops a logic based on causal inferences to formally capture the concept of instrumental obligation. We establish a causal deontic model that extends causal models with priority structures, allowing us to represent both the…

Logic · Mathematics 2025-05-13 Jialiang Yan , Qingyu He

Dynamic Topological Logic ($\mathcal{DTL}$) is a combination of $\mathcal{S}${\em 4}, under its topological interpretation, and the temporal logic $\mathcal{LTL}$ interpreted over the natural numbers. $\mathcal{DTL}$ is used to reason about…

Logic · Mathematics 2016-11-22 David Fernández-Duque

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized…

Logic in Computer Science · Computer Science 2021-03-30 Alexandru Baltag , Johan van Benthem

Many complex scenarios require the coordination of agents possessing unique points of view and distinct semantic commitments. In response, standpoint logic (SL) was introduced in the context of knowledge integration, allowing one to reason…

Artificial Intelligence · Computer Science 2023-04-28 Nicola Gigante , Lucia {Gomez Alvarez} , Tim S. Lyon

We propose four axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on Kripke frames or on dynamic topological systems. Our topological semantics…

The deontic logic DUS is a Deontic Update Semantics for prescriptive obligations based on the update semantics of Veltman. In DUS the definition of logical validity of obligations is not based on static truth values but on dynamic action…

Artificial Intelligence · Computer Science 2013-01-30 Leendert van der Torre , Yao-Hua Tan

The use of Dynamic Epistemic Logic (DEL) in multi-agent planning has led to a widely adopted action formalism that can handle nondeterminism, partial observability and arbitrary knowledge nesting. As such expressive power comes at the cost…

Artificial Intelligence · Computer Science 2023-07-31 Alessandro Burigana , Paolo Felli , Marco Montali , Nicolas Troquard

We consider the explicit fragment of the basic justification stit logic introduced in earlier publications. We define a Hilbert-style axiomatic system for this logic and show that this system is strongly complete relative to the intended…

Logic · Mathematics 2017-09-21 Grigory K. Olkhovikov

This paper is an appendix to the paper "Cut-free Calculi and Relational Semantics for Temporal STIT logics" by Berkel and Lyon, 2019. It provides the completeness proof for the basic STIT logic Ldm (relative to irreflexive, temporal Kripke…

Logic in Computer Science · Computer Science 2019-02-19 Kees van Berkel , Tim Lyon

We present a completeness result for a logical system which combines stit logic and justification logic in order to represent proving activity of the agents. This logic is interpreted over the semantics introduced in earlier publications.…

Logic · Mathematics 2017-07-12 Grigory Olkhovikov

We present Dynamic Epistemic Temporal Logic, a framework for reasoning about operations on multi-agent Kripke models that contain a designated temporal relation. These operations are natural extensions of the well-known "action models" from…

Logic in Computer Science · Computer Science 2014-11-25 Bryan Renne , Joshua Sack , Audrey Yap

We introduce a temporal logic to reason on global applications in an asynchronous setting. First, we define the Distributed States Logic (DSL), a modal logic for localities that embeds the local theories of each component into a theory of…

Logic in Computer Science · Computer Science 2016-08-31 Carlo Montangero , Laura Semini

We consider an extension of linear-time temporal logic (LTL) with both local and remote data constraints interpreted over a concrete domain. This extension is a natural extension of constraint LTL and the Temporal Logic of Repeating Values,…

Logic in Computer Science · Computer Science 2022-06-06 Ashwin Bhaskar

In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for…

Logic in Computer Science · Computer Science 2007-05-23 Clare Dixon , Michael Fisher , Boris Konev , Alexei Lisitsa

In temporal logics, a central question is about the choice of modalities and their relative expressive power, in comparison to the complexity of decision problems such as satisfiability. In this tutorial, we will illustrate the study of…

Logic in Computer Science · Computer Science 2017-03-08 Kamal Lodaya , Paritosh K. Pandya

We consider G\"odel temporal logic ($\sf GTL$), a variant of linear temporal logic based on G\"odel--Dummett propositional logic. In recent work, we have shown this logic to enjoy natural semantics both as a fuzzy logic and as a…

Logic in Computer Science · Computer Science 2022-12-05 Juan Pablo Aguilera , Martín Diéguez , David Fernández-Duque , Brett McLean

Bi-Intuitionistic Stable Tense Logics (BIST Logics) are tense logics with a Kripke semantics where worlds in a frame are equipped with a pre-order as well as with an accessibility relation which is 'stable' with respect to this pre-order.…

Logic in Computer Science · Computer Science 2017-03-08 Katsuhiko Sano , John G. Stell

One can find various temporal deontic logics in literature, most focusing on discrete time. The literature on real-time constraints and deontic norms is much sparser. Thus, many analysis techniques which have been developed for deontic…

Logic in Computer Science · Computer Science 2024-10-17 Shaun Azzopardi , Gordon Pace

Deontic logic is shown to be applicable for modelling human reasoning. For this the Wason selection task and the suppression task are discussed in detail. Different versions of modelling norms with deontic logic are introduced and in the…

Artificial Intelligence · Computer Science 2014-09-19 Ulrich Furbach , Claudia Schon

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…

Logic in Computer Science · Computer Science 2007-05-23 Pavel Naumov