English
Related papers

Related papers: Depth-bounded epistemic logic

200 papers

Humans intuitively solve complex problems by flexibly shifting among reasoning modes: they plan, execute, revise intermediate goals, resolve ambiguity through associative judgment, and apply formal procedures to well-specified subproblems.…

The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation. DeLP provides the possibility of representing information in the form of weak rules…

Artificial Intelligence · Computer Science 2007-05-23 Alejandro Javier Garcia , Guillermo Ricardo Simari

Logics for reasoning about knowledge and actions have seen many applications in various domains of multi-agent systems, including epistemic planning. Change of knowledge based on observations about the surroundings forms a key aspect in…

Artificial Intelligence · Computer Science 2025-08-14 Avijeet Ghosh , Sujata Ghosh , François Schwarzentruber

Modal description logics feature modalities that capture dependence of knowledge on parameters such as time, place, or the information state of agents. E.g., the logic S5-ALC combines the standard description logic ALC with an S5-modality…

Logic in Computer Science · Computer Science 2017-05-24 Paul Wild , Lutz Schröder

Strategic reasoning is a complex yet essential capability for intelligent agents. It requires Large Language Model (LLM) agents to adapt their strategies dynamically in multi-agent environments. Unlike static reasoning tasks, success in…

Computation and Language · Computer Science 2024-10-18 Yadong Zhang , Shaoguang Mao , Tao Ge , Xun Wang , Yan Xia , Man Lan , Furu Wei

Recently, there has been increasing interest in transparency and interpretability in Deep Reinforcement Learning (DRL) systems. Verbal explanations, as the most natural way of communication in our daily life, deserve more attention, since…

Artificial Intelligence · Computer Science 2020-12-25 Xinzhi Wang , Huao Li , Hui Zhang , Michael Lewis , Katia Sycara

As the length of sequential decision-making tasks increases, it becomes computationally impractical to keep full interaction histories in context. We introduce a general framework for LLM agents to maintain concise contexts through…

Computation and Language · Computer Science 2025-12-24 Aly Lidayan , Jakob Bjorner , Satvik Golechha , Kartik Goyal , Alane Suhr

Though a lot of work in multi-agent systems is focused on reasoning about knowledge and beliefs of artificial agents, an explicit representation and reasoning about the presence/absence of agents, especially in the scenarios where agents…

Multiagent Systems · Computer Science 2020-01-23 Shikha Singh , Deepak Khemani

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

We examine epistemological threats posed by human and LLM interaction. We develop collective epistemology as a theory of epistemic warrant distributed across human collectives, using bounded rationality and dual process theory as…

Human-Computer Interaction · Computer Science 2026-03-05 Angjelin Hila

How do people understand and evaluate claims about others' beliefs, even though these beliefs cannot be directly observed? In this paper, we introduce a cognitive model of epistemic language interpretation, grounded in Bayesian inferences…

Computation and Language · Computer Science 2025-04-21 Lance Ying , Tan Zhi-Xuan , Lionel Wong , Vikash Mansinghka , Joshua B. Tenenbaum

Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…

Logic · Mathematics 2021-09-07 Nicholas Pischke

Contemporary transformer architectures apply identical processing depth to all inputs, creating inefficiencies and limiting reasoning quality. Simple factual queries are subjected to the same multilayered computation as complex logical…

Computation and Language · Computer Science 2025-09-26 Sampurna Roy , Ayan Sar , Anurag Kaushish , Kanav Gupta , Tanupriya Choudhury , Abhijit Kumar

At the boundary between the known and the unknown, an agent inevitably confronts the dilemma of whether to explore or to exploit. Epistemic uncertainty reflects such boundaries, representing systematic uncertainty due to limited knowledge.…

Machine Learning · Computer Science 2026-03-03 Jianfei Ma , Wee Sun Lee

We present a domain-specific embedded language (DSEL) in Haskell that supports the philosophical study and practical explanation of causation. The language provides constructs for modeling situations comprised of events and functions for…

Programming Languages · Computer Science 2011-09-06 Eric Walkingshaw , Martin Erwig

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

Enhancing LLMs with the ability to actively search external knowledge is crucial for complex and real-world tasks. Current approaches either rely on prompting to elicit the model's innate agent capabilities, or suffer from performance…

Computation and Language · Computer Science 2026-03-20 Chenyang Gu , Yewen Pu , Bruce Yang , Xiaofan Li , Huan Gao

Evidential Deep Learning (EDL) has emerged as an efficient, sampling-free strategy for uncertainty estimation. A series of EDL variants have been proposed to address specific limitations of the original framework, achieving notable success.…

Machine Learning · Computer Science 2026-05-26 Yuanye Liu , Yibo Gao , Yuanyang Chen , Xiahai Zhuang

We propose a number of powerful dynamic-epistemic logics for multi-agent information sharing and acts of publicly or privately accessing other agents' information databases. The static base of our logics is obtained by adding to standard…

Logic in Computer Science · Computer Science 2021-09-16 Alexandru Baltag , Sonja Smets

This paper demonstrates the undecidability of a number of logics with quantification over public announcements: arbitrary public announcement logic (APAL), group announcement logic (GAL), and coalition announcement logic (CAL). In APAL we…

Logic in Computer Science · Computer Science 2024-06-07 Thomas Ågotnes , Hans van Ditmarsch , Tim French