English
Related papers

Related papers: Epistemic Logic with Functional Dependency Operato…

200 papers

Dependence is an important concept for many tasks in artificial intelligence. A task can be executed more efficiently by discarding something independent from the task. In this paper, we propose two novel notions of dependence in…

Artificial Intelligence · Computer Science 2019-06-13 Liangda Fang , Hai Wan , Xianqiao Liu , Biqing Fang , Zhaorong Lai

Many forms of dependence manifest themselves over time, with behavior of variables in dynamical systems as a paradigmatic example. This paper studies temporal dependence in dynamical systems from a logical perspective, by enriching a…

Logic in Computer Science · Computer Science 2024-03-29 Alexandru Baltag , Johan van Benthem , Dazhu Li

Epistemic planning is the sub-field of AI planning that focuses on changing knowledge and belief. It is important in both multi-agent domains where agents need to have knowledge/belief regarding the environment, but also the beliefs of…

Artificial Intelligence · Computer Science 2025-10-20 Guang Hu , Tim Miller , Nir Lipovetzky

Probability logic has contributed to significant developments in belief types for game-theoretical economics. We present a new probability logic for Harsanyi Type spaces, show its completeness, and prove both a de-nesting property and a…

Logic · Mathematics 2015-07-01 Chunlai Zhou

The importance of taking individual, potentially conflicting perspectives into account when dealing with knowledge has been widely recognised. Many existing ontology management approaches fully merge knowledge perspectives, which may…

Artificial Intelligence · Computer Science 2022-08-02 Lucía Gómez Álvarez , Sebastian Rudolph , Hannes Strass

Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a…

Logic in Computer Science · Computer Science 2023-08-01 Samuel Bucheli , Roman Kuznets , Thomas Studer

By using the abstract structures investigated in the first Part of this article, we develop a semantics for an epistemic language, which expresses sentences like "Alice knows that Bob does not understand that PI is irrational". One is…

Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various parameters. All the logics considered involve the discrete…

Logic in Computer Science · Computer Science 2007-05-23 Joseph Y. Halpern , Ron van der Meyden , Moshe Y. Vardi

The AI community is increasingly putting its attention towards combining symbolic and neural approaches, as it is often argued that the strengths and weaknesses of these approaches are complementary. One recent trend in the literature are…

Artificial Intelligence · Computer Science 2021-10-12 Emile van Krieken , Erman Acar , Frank van Harmelen

Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal…

Logic in Computer Science · Computer Science 2017-08-07 Wesley H. Holliday , Thomas F. Icard

In formal epistemology, group knowledge is often modelled as the knowledge that the group would have, if the agents shared all their individual knowledge. However, this interpretation does not account for relations between agents. In this…

Logic in Computer Science · Computer Science 2024-03-28 Christian Cachin , David Lehnherr , Thomas Studer

The knowledge base paradigm aims to express domain knowledge in a rich formal language, and to use this domain knowledge as a knowledge base to solve various problems and tasks that arise in the domain by applying multiple forms of…

Artificial Intelligence · Computer Science 2016-07-06 Pieter Van Hertum , Ingmar Dasseville , Gerda Janssens , Marc Denecker

Modular reasoning about class invariants is challenging in the presence of dependencies among collaborating objects that need to maintain global consistency. This paper presents semantic collaboration: a novel methodology to specify and…

Software Engineering · Computer Science 2014-05-08 Nadia Polikarpova , Julian Tschannen , Carlo A. Furia , Bertrand Meyer

When an agent can articulate why something works, we typically take this as evidence of genuine understanding. This presupposes that effective action and correct explanation covary, and that coherent explanation reliably signals both. I…

Computers and Society · Computer Science 2026-03-31 Camilo Chacón Sartori

The classical view of epistemic logic is that an agent knows all the logical consequences of their knowledge base. This assumption of logical omniscience is often unrealistic and makes reasoning computationally intractable. One approach to…

Artificial Intelligence · Computer Science 2018-05-09 Yijia Chen , Abdallah Saffidine , Christoph Schwering

Designing agents that reason and act upon the world has always been one of the main objectives of the Artificial Intelligence community. While for planning in "simple" domains the agents can solely rely on facts about the world, in several…

Artificial Intelligence · Computer Science 2020-09-23 Alessandro Burigana , Francesco Fabiano , Agostino Dovier , Enrico Pontelli

This paper presents a two-dimensional modal logic for reasoning about the changing patterns of knowledge and social relationships in networks organised on the basis of a symmetric 'friendship' relation, providing a precise language for…

Logic in Computer Science · Computer Science 2013-10-29 Jeremy Seligman , Fenrong Liu , Patrick Girard

We introduce an expressive probabilistic temporal epistemic logic PTEL suitable to reason about uncertain knowledge of a non-rigid set of agents that can be changed during time. We define semantics for PTEL as Kripke models with epistemic…

Logic · Mathematics 2021-05-27 Zoran Ognjanović , Angelina Ilić Stepić , Aleksandar Perović

We establish a correspondence between equivalence classes of agent-state policies for deterministic POMDPs and one-input process functions (the classical-deterministic limit of higher-order quantum operations). We use this correspondence to…

Artificial Intelligence · Computer Science 2026-02-10 Matt Wilson

While belief functions may be seen formally as a generalization of probabilistic distributions, the question of the interactions between belief functions and probability is still an issue in practice. This question is difficult, since the…

Logic in Computer Science · Computer Science 2011-10-03 Frederic Dambreville