English
Related papers

Related papers: Commonly Knowing Whether

200 papers

In this paper, we delve into the study of epistemic logics, interpreted through similarity models based on weighted graphs. We explore eight languages that extend the traditional epistemic language by incorporating modalities of common,…

Logic in Computer Science · Computer Science 2023-10-03 Xiaolong Liang , Yì N. Wáng

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

In standard epistemic logic, agent names are usually assumed to be common knowledge implicitly. This is unreasonable for various applications. Inspired by term modal logic and assignment operators in dynamic logic, we introduce a…

Artificial Intelligence · Computer Science 2018-06-26 Yanjing Wang , Jeremy Seligman

The paper suggests a definition of "know who" as a modality using Grove-Halpern semantics of names. It also introduces a logical system that describes the interplay between modalities "knows who", "knows", and "for all agents". The main…

Artificial Intelligence · Computer Science 2021-03-04 Sophia Epstein , Pavel Naumov

We introduce the concept of access-based intuitionistic knowledge which relies on the intuition that agent $i$ knows $\varphi$ if $i$ has found access to a proof of $\varphi$. Basic principles are distribution and factivity of knowledge as…

Logic in Computer Science · Computer Science 2021-02-25 Steffen Lewitzka

Reasoning about knowledge seems to play a fundamental role in distributed systems. Indeed, such reasoning is a central part of the informal intuitive arguments used in the design of distributed protocols. Communication in a distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 Joseph Y. Halpern , Yoram Moses

We consider the relation between knowledge and certainty, where a fact is known if it is true at all worlds an agent considers possible and is certain if it holds with probability 1. We identify certainty with probabilistic belief. We show…

Artificial Intelligence · Computer Science 2013-04-08 Joseph Y. Halpern

In this paper, we address the logic of knowing why, an example of a non-standard epistemic logic dealing with justified knowledge via a new epistemic operator, under the extensions with ideas from dynamic epistemic logic, namely public…

Logic · Mathematics 2018-09-24 Nicholas Pischke

A review of various definitions of "compatibility" expressed in terms of ordinary probability, and a discussion of the occurrence of incompatibility (and the related phenomenon of interference) in non-quantal probabilistic systems.

Quantum Physics · Physics 2007-05-23 K. A. Kirkpatrick

The relation between self awareness and intelligence is an open problem these days. Despite the fact that self awarness is usually related to Emotional Intelligence, this is not the case here. The problem described in this paper is how to…

Artificial Intelligence · Computer Science 2011-06-30 Nicolaie Popescu-Bodorin , Valentina E. Balas

Standard models of multi-agent modal logic do not capture the fact that information is often \emph{ambiguous}, and may be interpreted in different ways by different agents. We propose a framework that can model this, and consider different…

Artificial Intelligence · Computer Science 2014-01-10 Joseph Y. Halpern , Willemien Kets

This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation. A conditional knowledge base, consisting of a set of conditional assertions of the type "if ... then ...",…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann , Menachem Magidor

The purpose of this paper is to discuss the possibilities for computing machinery, or AI agents, to know and to possess knowledge. This is done mainly from a virtue epistemology perspective and definition of knowledge. However, this inquiry…

Artificial Intelligence · Computer Science 2020-12-15 Raymond Anneborg

We use a novel type of epistemic logic, employing comparative knowledge assertions, to analyze the relative epistemic powers of individuals or groups of agents. Such comparative assertions can express that a group has the potential to…

Logic in Computer Science · Computer Science 2025-12-09 Baltag Alexandru , Smets Sonja

Epistemic logics typically talk about knowledge of individual agents or groups of explicitly listed agents. Often, however, one wishes to express knowledge of groups of agents specified by a given property, as in `it is common knowledge…

Artificial Intelligence · Computer Science 2022-11-30 Merlin Humml , Lutz Schröder

Traditional game theory assumes that the players in the game are aware of the rules of the game. However, in practice, often the players are unaware or have only partial knowledge about the game they are playing. They may also have…

Computer Science and Game Theory · Computer Science 2014-02-20 Manoj Gopalkrishnan , Girish Varma

We introduce the Generalized Turing Test (GTT), a formal framework for comparing the capabilities of arbitrary agents via indistinguishability. For agents A and B, we define the Turing comparator A $\geq$ B to hold if B, acting as a…

Artificial Intelligence · Computer Science 2026-05-12 Daniel Mitropolsky , Susan S. Hong , Riccardo Neumarker , Emanuele Rimoldi , Tomaso Poggio

In this paper, we investigate knowledge reasoning within a simple framework called knowledge structure. We use variable forgetting as a basic operation for one agent to reason about its own or other agents\ knowledge. In our framework, two…

Logic in Computer Science · Computer Science 2014-01-16 Kaile Su , Abdul Sattar , Guanfeng Lv , Yan Zhang

User queries are often underspecified and may admit multiple valid interpretations. Rather than silently making assumptions about the user's intent, a helpful assistant should surface such ambiguity by asking a clarifying question. Doing so…

Computation and Language · Computer Science 2026-05-26 Jinyan Su , Claire Cardie

In a game of incomplete information, an infinite state space can create problems. When the space is uncountably large, the strategy spaces of the players may be unwieldly, resulting in a lack of measurable equilibria. When the knowledge of…

Logic · Mathematics 2011-10-17 Robert Samuel Simon