English
Related papers

Related papers: Modal Dependence Logics: Axiomatizations and Model…

200 papers

In this note, by integrating ideas concerning terminating tableaux-based procedures in modal logics and finite frame property of intuitionistic modal logic IK, we provide new and simpler decidability proofs for FIK and LIK.

Logic in Computer Science · Computer Science 2025-03-25 Philippe Balbiani , Cigdem Gencer

In this short paper we will discuss the similarities and differences between two semantic approaches to modal logics - non-deterministic semantics and restricted non-deterministic semantics. Generally speaking, both kinds of semantics are…

Logic in Computer Science · Computer Science 2025-01-03 Marcelo E. Coniglio , Paweł Pawłowski , Daniel Skurt

We present a game semantics for intuitionistic type theory. Specifically, we propose categories with families of a new variant of games and strategies for both extensional and intensional variants of the type theory with dependent function,…

Logic in Computer Science · Computer Science 2016-10-05 Norihiro Yamada

Modal automata are a classic formal model for component-based systems that comes equipped with a rich specification theory supporting abstraction, refinement and compositional reasoning. In recent years, quantitative variants of modal…

Logic in Computer Science · Computer Science 2013-06-13 Tingting Han , Christian Krause , Marta Kwiatkowska , Holger Giese

Autonomous agents are supposed to be able to finish tasks or achieve goals that are assigned by their users through performing a sequence of actions. Since there might exist multiple plans that an agent can follow and each plan might…

Artificial Intelligence · Computer Science 2022-04-12 Jieting Luo , Beishui Liao , Dov Gabbay

In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as a deterministic counterpart to the Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. A…

Logic · Mathematics 2007-05-23 Frederic Dambreville

Game semantics and winning strategies offer a potential conceptual bridge between semantics and proof systems of logics. We illustrate this link for hybrid logic -- an extension of modal logic that allows for explicit reference to worlds…

Logic in Computer Science · Computer Science 2022-06-02 Robert Freiman

In this paper, we propose a single-agent modal logic framework for reasoning about goal-direct "knowing how" based on ideas from linguistics, philosophy, modal logic and automated planning. We first define a modal language to express "I…

Artificial Intelligence · Computer Science 2015-07-10 Yanjing Wang

The paper introduces a basic logic of knowledge and abduction by extending Levesque logic of only-knowing with an abduction modal operator defined via the combination of basic epistemic concepts. The upshot is an alternative approach to…

Artificial Intelligence · Computer Science 2026-01-09 Sanderson Molick , Vaishak Belle

Probabilistic team semantics is a framework for logical analysis of probabilistic dependencies. Our focus is on the axiomatizability, complexity, and expressivity of probabilistic inclusion logic and its extensions. We identify a natural…

Logic in Computer Science · Computer Science 2021-12-22 Miika Hannula , Jonni Virtema

We consider multi-agent systems where agents actions and beliefs are determined aleatorically, or "by the throw of dice". This system consists of possible worlds that assign distributions to independent random variables, and agents who…

Logic in Computer Science · Computer Science 2019-01-01 Tim French , Andrew Gozzard , Mark Reynolds

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson

This work builds upon a well-established research tradition on modal logics of awareness. One of its aims is to export tools and techniques to other areas within modal logic. To this end, we illustrate a number of significant bridges with…

Logic in Computer Science · Computer Science 2023-07-12 Carlo Proietti , Fernando R. Velázquez-Quesada , Antonio Yuste-Ginel

In this paper we consider Modal Team Logic, a generalization of Classical Modal Logic in which it is possible to describe dependence phenomena between data. We prove that most known fragment of Full Modal Team Logic allow the elimination of…

Logic in Computer Science · Computer Science 2018-10-15 Giovanna D'Agostino

We present three examples of \textit{multi-topological} semantics for intuitionistic modal logic with one modal operator $\Box$ (which behaves in some sense like necessity). We show that it is possible to treat neighborhood models,…

Logic · Mathematics 2019-03-19 Tomasz Witczak

Languages may encode similar meanings using different sentence structures. This makes it a challenge to provide a single set of formal rules that can derive meanings from sentences in many languages at once. To overcome the challenge, we…

Computation and Language · Computer Science 2024-03-05 Laurestine Bradford , Timothy John O'Donnell , Siva Reddy

We analyze the causal-observational languages that were introduced in Barbero and Sandu (2018), which allow discussing interventionist counterfactuals and functional dependencies in a unified framework. In particular, we systematically…

Logic · Mathematics 2020-04-03 Fausto Barbero , Fan Yang

We consider propositional modal logic with two modal operators $\Box$ and $\D$. In topological semantics $\Box$ is interpreted as an interior operator and $\D$ as difference. We show that some important topological properties are…

Logic · Mathematics 2010-11-29 Kudinov Andrey

We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We…

Logic · Mathematics 2025-03-31 Aleksi Anttila , Søren Brinck Knudstorp

We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIME-complete. Furthermore, we show that the validity problem…

Logic in Computer Science · Computer Science 2016-06-21 Juha Kontinen , Antti Kuusisto , Jonni Virtema
‹ Prev 1 4 5 6 7 8 10 Next ›