English
Related papers

Related papers: Modal Dependence Logics: Axiomatizations and Model…

200 papers

We characterize the expressive power of extensions of Dependence Logic and Independence Logic by monotone generalized quantifiers in terms of quantifier extensions of existential second-order logic.

Logic · Mathematics 2012-02-24 Fredrik Engström , Juha Kontinen

Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete…

Logic in Computer Science · Computer Science 2015-09-25 Lauri Hella , Johanna Stumpf

We give an overview of some developments in dependence and independence logic. This is a tiny selection, intended for a newcomer, from a rapidly growing literature on the topic. Furthermore, we discuss conditional independence atoms and we…

Logic · Mathematics 2013-05-28 Pietro Galliani , Jouko Väänänen

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino

In this thesis (modal) dependence logic is investigated. It was introduced in 2007 by Jouko V\"a\"aan\"anen as an extension of first-order (resp. modal) logic by the dependence operator =(). For first-order (resp. propositional) variables…

Logic in Computer Science · Computer Science 2012-06-21 Peter Lohmann

Inquisitive team logic is a variant of inquisitive logic interpreted in team semantics, which has been argued to provide a natural setting for the regimentation of dependence claims. With respect to sentences, this logic is known to be…

Logic · Mathematics 2026-03-10 Juha Kontinen , Ivano Ciardelli

In the article we investigate three classes of extended Boolean Connexive Logics. Two of them are extensions of Modal and non-Modal Boolean Connexive Logics with a property of closure under an arbitrary number of negations. The remaining…

Logic · Mathematics 2024-03-20 Tomasz Jarmuzek , Jacek Malinowski , Aleksander Parol , Nicolo Zamperlin

In this paper, we introduce $\textit{partial}$ dependency modality $\mathcal{D}$ into epistemic logic so as to reason about $\textit{partial}$ dependency relationship in Kripke models. The resulted dependence epistemic logic possesses…

Logic · Mathematics 2019-08-28 Xinyu Wang

We study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that…

Logic · Mathematics 2026-03-19 Zalán Gyenis , Zalán Molnár , Övge Öztürk

The paper investigates an evidence-based semantics for epistemic logics. It is shown that the properties of knowledge obtained from a potentially infinite body of evidence are described by modal logic S5. At the same time, the properties of…

Logic in Computer Science · Computer Science 2021-06-23 Pavel Naumov , Jia Tao

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

This paper from 2008 is the first in a series of three related papers on modal methods in interpretability logics and applications. In this first paper the foundations are laid for later results. These foundations consist of a thorough…

Logic · Mathematics 2020-04-16 Evan Goris , Joost J. Joosten

We introduce a new variant of dependence logic called Boolean dependence logic. In Boolean dependence logic dependence atoms are of the type =(x_1,...,x_n,\alpha), where \alpha is a Boolean variable. Intuitively, with Boolean dependence…

Logic · Mathematics 2014-06-30 Johannes Ebbing , Lauri Hella , Peter Lohmann , Jonni Virtema

We study propositional logical systems arising from the language of Johansson's minimal logic and obtained by weakening the requirements for the negation operator. We present their semantics as a variant of neighbourhood semantics. We use…

Logic · Mathematics 2020-02-27 Nick Bezhanishvili , Almudena Colacito , Dick de Jongh

Modal logics for reasoning about the power of coalitions capture the notion of effectivity functions associated with game forms. The main goal of coalition logics is to provide formal tools for modeling the dynamics of a game frame whose…

Logic · Mathematics 2017-03-01 Tomáš Kroupa , Bruno Teheux

This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted…

cmp-lg · Computer Science 2008-02-03 Suresh Manandhar

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

We present a family of minimal modal logics (namely, modal logics based on minimal propositional logic) corresponding each to a different classical modal logic. The minimal modal logics are defined based on their classical counterparts in…

Logic in Computer Science · Computer Science 2025-08-13 Tiziano Dalmonte

Existential rules, a.k.a. dependencies in databases, and Datalog+/- in knowledge representation and reasoning recently, are a family of important logical languages widely used in computer science and artificial intelligence. Towards a deep…

Artificial Intelligence · Computer Science 2020-01-24 Heng Zhang , Yan Zhang , Guifei Jiang

A specification given as a formula in linear temporal logic (LTL) defines a system by its set of traces. However, certain features such as information flow security constraints are rather modeled as so-called hyperproperties, which are sets…

Logic in Computer Science · Computer Science 2020-04-28 Martin Lück