English
Related papers

Related papers: Satisfiability of Quantified Boolean Announcements

200 papers

Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, APAL. It contains a primitive language construct Box phi…

Logic in Computer Science · Computer Science 2023-06-22 Hans van Ditmarsch , Tim French

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

Arbitrary public announcement logic (APAL) reasons about how the knowledge of a set of agents changes after true public announcements and after arbitrary announcements of true epistemic formulas. We consider a variant of arbitrary public…

Logic in Computer Science · Computer Science 2021-11-30 Hans van Ditmarsch , Tim French , James Hales

Quantification over public announcements shifts the perspective from reasoning strictly about the results of a particular announcement to reasoning about the existence of an announcement that achieves some certain epistemic goal. Depending…

Logic in Computer Science · Computer Science 2021-06-23 Hans van Ditmarsch , Tim French , Rustam Galimullin

Arbitrary Public Announcement Logic with Common Knowledge (APALC) is an extension of Public Announcement Logic with common knowledge modality and quantifiers over announcements. We show that the satisfiability problem of APALC on S5-models,…

Logic in Computer Science · Computer Science 2023-07-12 Rustam Galimullin , Louwe B. Kuijer

In standard epistemic logic, knowing that p is the same as knowing that p is true, but it does not say anything about understanding p or knowing its meaning. In this paper, we present a conservative extension of Public Announcement Logic…

Logic in Computer Science · Computer Science 2019-07-23 Malvin Gattinger , Yanjing Wang

In this survey we review dynamic epistemic logics with modalities for quantification over information change. Of such logics we present complete axiomatizations, focussing on axioms involving the interaction between knowledge and such…

Logic in Computer Science · Computer Science 2023-03-22 Hans van Ditmarsch

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

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 2017-07-28 Rustam Galimullin , Natasha Alechina

We propose a multi-agent epistemic logic of asynchronous announcements, where truthful announcements are publicly sent but individually received by agents, and in the order in which they were sent. Additional to epistemic modalities the…

Artificial Intelligence · Computer Science 2021-01-19 Philippe Balbiani , Hans van Ditmarsch , Saúl Fernández González

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

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

We provide a simple proof of the completeness of arbitrary public announcement logic APAL. The proof is an improvement over the proof found in the publication Knowable as Known after an Announcement.

Logic in Computer Science · Computer Science 2018-02-06 Philippe Balbiani , Hans van Ditmarsch

Although Dynamic Epistemic Logic (DEL) is an influential logical framework for representing and reasoning about information change, little is known about the computational complexity of its associated decision problems. In fact, we only…

Logic in Computer Science · Computer Science 2013-10-29 Guillaume Aucher , Francois Schwarzentruber

Epistemic logics model how agents reason about their beliefs and the beliefs of other agents. Existing logics typically assume the ability of agents to reason perfectly about propositions of unbounded modal depth. We present DBEL, an…

Artificial Intelligence · Computer Science 2023-07-17 Farid Arthaud , Martin Rinard

Epistemic logics model how agents reason about their beliefs and the beliefs of other agents. Existing logics typically assume the ability of agents to reason perfectly about propositions of unbounded modal depth. We present DBEL, an…

Logic in Computer Science · Computer Science 2023-05-16 Farid Arthaud , Martin Rinard

Dynamic Epistemic Logic extends classical epistemic logic by modeling not only static knowledge but also its evolution through information updates. Among its various systems, Public Announcement Logic (PAL) provides one of the simplest and…

Logic in Computer Science · Computer Science 2026-05-18 Clara Lerouvillois , Francesca Poggiolesi

Communication within groups of agents has been lately the focus of research in dynamic epistemic logic (DEL). This paper studies a recently introduced form of partial (more precisely, topic-based) communication. This type of communication…

Logic in Computer Science · Computer Science 2023-02-24 Rustam Galimullin , Fernando R. Velázquez-Quesada

Quantified Boolean logic results from adding operators to Boolean logic for existentially and universally quantifying variables. This extends the reach of Boolean logic by enabling a variety of applications that have been explored over the…

Artificial Intelligence · Computer Science 2021-10-13 Adnan Darwiche , Pierre Marquis

Description logics are a powerful tool for describing ontological knowledge bases. That is, they give a factual account of the world in terms of individuals, concepts and relations. In the presence of uncertainty, such factual accounts are…

Artificial Intelligence · Computer Science 2021-08-31 Tim French , Tom Smoker
‹ Prev 1 2 3 10 Next ›