English
Related papers

Related papers: A Semantic Approach to Decidability in Epistemic P…

200 papers

Dynamic epistemic logics which model abilities of agents to make various announcements and influence each other's knowledge have been studied extensively in recent years. Two notable examples of such logics are Group Announcement Logic and…

Logic in Computer Science · Computer Science 2018-10-08 Rustam Galimullin , Natasha Alechina

Quantum information has suggested new forms of quantum logic, called quantum computational logics, where meanings of sentences are represented by pieces of quantum information (generally, density operators of some Hilbert spaces), which can…

Quantum Physics · Physics 2016-02-25 Giuseppe Sergioli , Roberto Leporini

As multi-agent AI systems evolve from simple chatbots to autonomous swarms, debugging semantic failures requires reasoning about knowledge, belief, causality, and obligation, precisely what modal logic was designed to formalize. However,…

Artificial Intelligence · Computer Science 2026-02-13 Antonin Sulc

In this paper, we propose a single-agent logic of goal-directed knowing how extending the standard epistemic logic of knowing that with a new knowing how operator. The semantics of the new operator is based on the idea that knowing how to…

Artificial Intelligence · Computer Science 2017-05-16 Raul Fervari , Andreas Herzig , Yanjun Li , Yanjing Wang

I introduce PEDAL -- a probabilistic epistemic logic meant to capture, in propositional dynamic terms, the epistemic state of an agent engaged in checking whether a program meets its specification. Semantically, PEDAL is built `on top of'…

Logic in Computer Science · Computer Science 2026-04-27 Shay Allen Logan

There has been considerable work on reasoning about the strategic ability of agents under imperfect information. However, existing logics such as Probabilistic Strategy Logic are unable to express properties relating to information…

Artificial Intelligence · Computer Science 2025-01-07 Chunyan Mu , Nima Motamed , Natasha Alechina , Brian Logan

We observe some puzzling linguistic data concerning ordinary knowledge ascriptions that embed an epistemic (im)possibility claim. We conclude that it is untenable to jointly endorse both classical logic and a pair of intuitively attractive…

Logic in Computer Science · Computer Science 2023-07-12 Peter Hawke

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

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

This article presents a formalism inspired by Dennett's notion of the intentional stance. Whereas Dennett's treatment of these concepts is informal, we aim to provide a more formal analogue. We introduce a framework based on stochastic…

Optimization and Control · Mathematics 2025-01-10 Simon McGregor , timorl , Nathaniel Virgo

In this paper, we investigate the probabilistic variants of the strategy logics ATL and ATL* under imperfect information. Specifically, we present novel decidability and complexity results when the model transitions are stochastic and…

Multiagent Systems · Computer Science 2023-10-27 Francesco Belardinelli , Wojciech Jamroga , Munyque Mittelmann , Aniello Murano

Complete axiomatizations and exponential-time decision procedures are provided for reasoning about knowledge and common knowledge when there are infinitely many agents. The results show that reasoning about knowledge and common knowledge…

Logic in Computer Science · Computer Science 2007-05-23 Joseph Y. Halpern , Richard A. Shore

In this paper we study the solvability of the equality negation task in a simple wait-free model where processes communicate by reading and writing shared variables or exchanging messages. In this task, two processes start with a private…

Logic in Computer Science · Computer Science 2019-09-10 Eric Goubault , Marijana Lazic , Jeremy Ledent , Sergio Rajsbaum

Constrained decoding approaches aim to control the meaning or style of text generated by the pre-trained large language models (LLMs or also PLMs) for various tasks at inference time. However, these methods often guide plausible…

Computation and Language · Computer Science 2025-05-06 Chen Xu , Tian Lan , Yu Ji , Changlong Yu , Wei Wang , Jun Gao , Qunxi Dong , Kun Qian , Piji Li , Wei Bi , Bin Hu

We develop a framework for epistemic logic that combines relevant modal logic with classical propositional logic. In our framework the agent is modeled as reasoning in accordance with a relevant modal logic while the propositional fragment…

Logic in Computer Science · Computer Science 2022-06-08 Igor Sedlár , Pietro Vigiani

We propose a many-sorted modal logic for reasoning about knowledge in multi-agent systems. Our logic introduces a clear distinction between participating agents and the environment. This allows to express local properties of agents and…

Logic in Computer Science · Computer Science 2023-08-02 Eric Goubault , Roman Kniazev , Jérémy Ledent

We propose a new formalization of legal competences, and in particular for the Hohfeldian categories of power and immunity, through a deontic reinterpretation of dynamic epistemic logic. We argue that this logic explicitly captures the…

Logic in Computer Science · Computer Science 2021-10-12 Huimin Dong , Olivier Roy

The usual semantics of multi-agent epistemic logic is based on Kripke models, defined in terms of binary relations on a set of possible worlds. Recently, there has been a growing interest in using simplicial complexes rather than graphs, as…

Logic in Computer Science · Computer Science 2026-02-09 Éric Goubault , Jérémy Ledent , Sergio Rajsbaum

Non-deterministic planning aims to find a policy that achieves a given objective in an environment where actions have uncertain effects, and the agent - potentially - only observes parts of the current state. Hyperproperties are properties…

Logic in Computer Science · Computer Science 2024-05-24 Raven Beutner , Bernd Finkbeiner

This paper establishes a dual theory about knowledge and argumentation. Our idea is rooted at both epistemic logic and argumentation theory, and we aim to merge these two fields, not just in a superficial way but to thoroughly disclose the…

Logic in Computer Science · Computer Science 2022-09-28 Xinyu Wang , Momoka Fujieda
‹ Prev 1 4 5 6 7 8 10 Next ›