Sophia Epstein, Pavel Naumov
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 technical result is a completeness theorem for the proposed system.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this paper we introduce Epistemic Strategy Logic (ESL), an extension of Strategy Logic with modal operators for individual knowledge. This enhanced framework allows us to represent explicitly and to reason about the knowledge agents have of their own and other agents' strategies. We provide a semantics to ESL in terms of epistemic concurrent game models, and consider the corresponding model checking problem. We show that the complexity of model checking ESL is not worse than (non-epistemic) Strategy Logic
An epistemic logic for modeling decisions in the context of incomplete knowledge
针对现有决策建模形式化体系无法捕捉不完备知识下决策认知本质的问题，提出结合分层、自认知逻辑与定义的新建模语言，构建层级认知理论知识库以支持认知推理与决策。
Epistemic logic has become a major field of philosophical logic ever since the groundbreaking work by Hintikka (1962). Despite its various successful applications in theoretical computer science, AI, and game theory, the technical development of the field has been mainly focusing on the propositional part, i.e., the propositional modal logics of "knowing that". However, knowledge is expressed in everyday life by using various other locutions such as "knowing whether", "knowing what", "knowing how" and so on (knowing-wh hereafter). Such knowledge expressions are better captured in quantified ep…
In this paper we consider Epistemic Logic Programs, which extend Answer Set Programming (ASP) with "epistemic operators" and "epistemic negation", and a recent approach to the semantics of such programs in terms of World Views. We propose some observations on the existence and number of world views. We show how to exploit an extended ASP semantics in order to: (i) provide a characterization of world views, different from existing ones; (ii) query world views and query the whole set of world views.
The existence of a coalition strategy to achieve a goal does not necessarily mean that the coalition has enough information to know how to follow the strategy. Neither does it mean that the coalition knows that such a strategy exists. The paper studies an interplay between the distributed knowledge, coalition strategies, and coalition "know-how" strategies. The main technical result is a sound and complete trimodal logical system that describes the properties of this interplay.
Recent years witnessed a growing interest in non-standard epistemic logics of knowing whether, knowing how, knowing what, knowing why and so on. The new epistemic modalities introduced in those logics all share, in their semantics, the general schema of $\exists x \Box ϕ$, e.g., knowing how to achieve $ϕ$ roughly means that there exists a way such that you know that it is a way to ensure that $ϕ$. Moreover, the resulting logics are decidable. Inspired by those particular logics, in this work, we propose a very general and powerful framework based on quantifier-free predicate language extended …
Epistemic Skills: Reasoning about Knowledge and Oblivion
本文提出一类认知逻辑，通过加权模型系统引入“认知技能”度量，将知识获取建模为技能提升、遗忘建模为技能下降，并研究可知性与可遗忘性以及de re与de dicto表达的区别，分析了模型检测和可满足性的计算复杂性。
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 lightweight modal predicate logic where names can be non-rigid. The language can handle various de dicto and de re distinctions in a natural way. The main technical result is a complete axiomatisation of this logic over S5 models.
Epistemic logics are a primary formalism for multi-agent systems but major reasoning tasks in such epistemic logics are intractable, which impedes applications of multi-agent epistemic logics in automatic planning. Knowledge compilation provides a promising way of resolving the intractability by identifying expressive fragments of epistemic logics that are tractable for important reasoning tasks such as satisfiability and forgetting. The property of logical separability allows to decompose a formula into some of its subformulas and thus modular algorithms for various reasoning tasks can be dev…
We propose a validity preserving translation from a subset of epistemic Alternating-time Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and decidable model-checking. This entails the decidability of validity but the implied algorithm is unfeasible. Reducing the validity problem to that in a corresponding system of CTL makes the techniques for automated deduction for that logic available for the handling of the apparently more complex system of ATL.
AGM's belief revision is one of the main paradigms in the study of belief change operations. In this context, belief bases (prioritised bases) have been largely used to specify the agent's belief state - whether representing the agent's `explicit beliefs' or as a computational model for her belief state. While the connection of iterated AGM-like operations and their encoding in dynamic epistemic logics have been studied before, few works considered how well-known postulates from iterated belief revision theory can be characterised by means of belief bases and their counterpart in a dynamic epi…
Gossip protocols aim at arriving, by means of point-to-point or group communications, at a situation in which all the agents know each other secrets. Recently a number of authors studied distributed epistemic gossip protocols. These protocols use as guards formulas from a simple epistemic logic, which makes their analysis and verification substantially easier. We study here common knowledge in the context of such a logic. First, we analyze when it can be reduced to iterated knowledge. Then we show that the semantics and truth for formulas without nested common knowledge operator are decidable.…
The existence of a coalition strategy to achieve a goal does not necessarily mean that the coalition has enough information to know how to follow the strategy. Neither does it mean that the coalition knows that such a strategy exists. The article studies an interplay between the distributed knowledge, coalition strategies, and coalition "know-how" strategies. The main technical result is a sound and complete trimodal logical system that describes the properties of this interplay.
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 among economists'. We introduce such a logic of common knowledge, which we term abstract-group epistemic logic (AGEL). That is, AGEL features a common knowledge operator for groups of agents given by concepts in a separate agent logic that we keep generic, with one possible agent logic being ALC. We show that AGEL is EXPTIME-complete, with the lower bound estab…
We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multi-agent epistemic logic CMAEL(CD) with operators for common and distributed knowledge for all coalitions of agents mentioned in the language. To that end, we introduce Hintikka structures for CMAEL(CD) and prove that satisfiability in such structures is equivalent to satisfiability in standard models. Using that result, we design an incremental tableau-building procedure that eventually constructs a satisfying Hintikka structure for every satisfiable input set of formulae of C…
Representations of Fact, Fiction and Forecast in Large Language Models: Epistemics and Attitudes
本文通过受控故事和认识情态类型学框架评估大型语言模型对不确定性语言知识的掌握，发现其生成认识情态表达的能力有限且不稳健，提出需丰富相关语义知识以构建不确定性感知模型。
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 Dynamic Epistemic Logic. Our "temporal action models" may be used to define a number of informational actions that can modify the "objective" temporal structure of a model along with the agents' basic and higher-order knowledge and beliefs about this structure, including their beliefs about the time. In essence, this approach provides one way to extend the …
Epistemic Syllogistic: First Steps
本文受自然逻辑启发，在认知语境下提出并研究模态三段论的若干变体，重点分析 de re 解释的认知必然三段论及其扩展，并给出若干公理化系统与完全性证明。
Academics and Generative AI: Empirical and Epistemic Indicators of Policy-Practice Voids
本研究构建了一个十条目间接诱导工具，嵌入结构化解释框架以揭示学术界AI政策与实践鸿沟，提取经验与认识论信号生成三个筛选指标，为机构规则与从业者AI使用对齐提供可审计依据。
Epistemic logic with non-standard knowledge operators, especially the "knowing-value" operator, has recently gathered much attention. With the "knowing-value" operator, we can express knowledge of individual variables, but not of the relations between them in general. In this paper, we propose a new operator Kf to express knowledge of the functional dependencies between variables. The semantics of this Kf operator uses a function domain which imposes a constraint on what counts as a functional dependency relation. By adjusting this function domain, different interesting logics arise, and in th…
Who Determines the Meaning of an Emotion? Affective Sovereignty as an Epistemic Consequence of Measurement Limits
本文提出情感主权规范，指出由于测量结构限制导致个体情绪意义分布存在不可约不确定性，情感AI无法权威地确定情绪意义，最终解释权应属于体验主体。
A Semantic Approach to Decidability in Epistemic Planning (Extended Version)
本文提出一种基于语义的公理扩充方法，通过在 S5$_n$ 逻辑中引入知识交换性公理限制智能体无限推理，实现了认知规划问题的可判定性，并证明了多种现有系统的可判定性。
We study dynamic changes of agents' observational power in logics of knowledge and time. We consider CTL*K, the extension of CTL* with knowledge operators, and enrich it with a new operator that models a change in an agent's way of observing the system. We extend the classic semantics of knowledge for perfect-recall agents to account for changes of observation, and we show that this new operator strictly increases the expressivity of CTL*K. We reduce the model-checking problem for our logic to that for CTL*K, which is known to be decidable. This provides a solution to the model-checking proble…
The Epistemic Planning Domain Definition Language: Official Guideline
本文提出EPDDL语言，通过抽象事件模型统一描述知识规划任务，解决现有规划器碎片化问题，提升可比性与可重复性。
Epistemic Deep Learning: Enabling Machine Learning Models to Know When They Do Not Know
本论文提出认知深度学习范式，通过随机集神经网络量化认知不确定性，使模型在不确定时弃权（不执行），并适配大语言模型及自动驾驶天气分类，经统一评估框架验证，提升可靠性。
The gossip problem, in which information (known as secrets) must be shared among a certain number of agents using the minimum number of calls, is of interest in the conception of communication networks and protocols. We extend the gossip problem to arbitrary epistemic depths. For example, we may require not only that all agents know all secrets but also that all agents know that all agents know all secrets. We give optimal protocols for various versions of the generalised gossip problem, depending on the graph of communication links, in the case of two-way communications, one-way communication…
Epistemic Artificial Intelligence is Essential for Machine Learning Models to Truly 'Know When They Do Not Know'
针对AI模型在不确定性和非训练数据下泛化能力不足的问题，提出向认识论人工智能的范式转变，利用二阶不确定性度量让模型在学习已知的同时承认无知，从而提升系统的弹性和稳健性。
Dynamic Epistemic Logic (DEL) is a family of multimodal logics that has proved to be very successful for epistemic reasoning in planning tasks. In this logic, the agent's knowledge is captured by modal epistemic operators whereas the system evolution is described in terms of (some subset of) dynamic logic modalities in which actions are usually represented as semantic objects called event models. In this paper, we study a variant of DEL, that wecall DEL[ASP], where actions are syntactically described by using an Answer Set Programming (ASP) representation instead of event models. This represen…
Do Large Language Models Know What They Don't Know? Kalshibench: A New Benchmark for Evaluating Epistemic Calibration via Prediction Markets
研究发现大型语言模型普遍存在过度自信问题，表明知识校准需要专门发展。
The standard semantics of multi-agent epistemic logic S5 is based on Kripke models whose accessibility relations are reflexive, symmetric and transitive. This one dimensional structure contains implicit higher-dimensional information beyond pairwise interactions, that we formalized as pure simplicial models in a previous work (Information and Computation, 2021). Here we extend the theory to encompass simplicial models that are not necessarily pure. The corresponding class of Kripke models are those where the accessibility relation is symmetric and transitive, but might not be reflexive. Such m…
Recent research in extensions of Answer Set Programming has included a renewed interest in the language of Epistemic Specifications, which adds modal operators K ("known") and M ("may be true") to provide for more powerful introspective reasoning and enhanced capability, particularly when reasoning with incomplete information. An epistemic logic program is a set of rules in this language. Infused with the research has been the desire for an efficient solver to enable the practical use of such programs for problem solving. In this paper, we report on the current state of development of epistemi…
Do LLM Agents Know How to Ground, Recover, and Assess? A Benchmark for Epistemic Competence in Information-Seeking Agents
本文提出SeekBench基准，通过步骤级分析190条轨迹和1800多个响应步骤，系统评估LLM搜索智能体在证据依据、搜索恢复和证据充分性校准三方面的认知能力。
It plays a central role in intelligent agent systems to model agent's epistemic state and its change. Asynchrony plays a key role in distributed systems, in which the messages transmitted may not be received instantly by the agents. To characterize asynchronous communications, asynchronous announcement logic (AAL) has been presented, which focuses on the logic laws of the change of epistemic state after receiving information. However AAL does not involve the interactive behaviours between an agent and its environment. Through enriching the well-known pi-calculus by adding the operators for pas…
LLM Doesn't Know What It Doesn't Know: Detecting Epistemic Blind Spots via Cross-Model Attribution Divergence on Clinical Tabular Data
研究大语言模型在结构化临床数据上的认知不确定性，通过跨模型归因分歧分析，发现其口头置信度空洞、存在逆难度效应，并提出基于归因分歧的校准方法，无需训练即可提升准确率并降低校准误差。
Know When to Trust the Skill: Delayed Appraisal and Epistemic Vigilance for Single-Agent LLMs
本文提出MESA-S框架，通过延迟评估和认知警惕机制提升单智能体LLM的可靠性，减少供应链漏洞并防止自信膨胀。
A General Framework of Epistemic Forgetting and its Instantiation by Ranking Functions
本文提出认知遗忘的一般框架，以Spohn排序函数实例化五类遗忘和七种具体操作，并结合逻辑程序设计与AGM公设系统评估其异同。
Saying More Than They Know: A Framework for Quantifying Epistemic-Rhetorical Miscalibration in Large Language Models
本文提出一种量化大语言模型认知与修辞失配的框架，通过设计三元认知-修辞标记分类法，发现LLM生成文本在修辞强度和认知基础之间存在系统性失配。
Do Large Language Models Know What They Don't Know II? A Fully Behavioral, Non-Cognitive Measure of Epistemic Honesty
提出 epistemic 诚实商数（EHQ）和 EHQ-3000 基准，通过行为度量评估 LLM 是否承认知识边界，发现模型间差异无法用能力解释，揭示传统评估不可见的行为差异。
Epistemic Foundation of Stable Model Semantics
稳定模型语义已经成为逻辑程序设计中管理否定的一种非常流行的方法。这种方法主要依赖于封闭世界假设来完成现有的知识，其公式化的基础是所谓的Gelfond-Lifschitz变换。这项工作的主要目标是提出一种替代和基于认识的表征稳定模型语义，Gelfond-Lifschitz变换。特别是，我们表明，稳定的模型语义可以完全定义为Kripke-Kleene语义的扩展。事实上，我们表明，封闭世界的假设可以被看作是一个额外的来源的“虚假”被累积添加到Kripke-Kleene语义。我们的方法是纯代数的，可以从特定的形式主义的选择，因为它是基于单调算子（知识秩序下）的双格。
While there have been many attempts, going back to BAN logic, to base reasoning about security protocols on epistemic notions, they have not been all that successful. Arguably, this has been due to the particular logics chosen. We present a simple logic based on the well-understood modal operators of knowledge, time, and probability, and show that it is able to handle issues that have often been swept under the rug by other approaches, while being flexible enough to capture all the higher- level security notions that appear in BAN logic. Moreover, while still assuming that the knowledge operat…
As the interest in Artificial Intelligence continues to grow it is becoming more and more important to investigate formalization and tools that allow us to exploit logic to reason about the world. In particular, given the increasing number of multi-agents systems that could benefit from techniques of automated reasoning, exploring new ways to define not only the world's status but also the agents' information is constantly growing in importance. This type of reasoning, i.e., about agents' perception of the world and also about agents' knowledge of her and others' knowledge, is referred to as e…
Who Sees What? Structured Thought-Action Sequences for Epistemic Reasoning in LLMs
针对基于LLM的智能体在视角采择任务中的挑战，本研究提出基于Fast Downward规划器解图的结构化思维-行动示例生成管道，发现其虽在部分场景有效，但需结合信念跟踪等技术才能实现稳健视角采择。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。