The undecidability of group announcements

T. Ågotnes, H.P. Van Ditmarsch, Tim French

    Research output: Chapter in Book/Conference paperConference paper

    5 Citations (Scopus)

    Abstract

    Copyright © 2014, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved. This paper addresses and solves the long-standing open problem of whether Group Announcement Logic (GAL) is de-cidable. GAL is a dynamic epistemic logic for reasoning about which states of knowledge a group of agents can make come about by sharing their knowledge, with an operator for quantifying over all truthful public announcements that can be made by the group. We show that the satisfiability problem for the logic is undecidable; it is co-RE complete.
    Original languageEnglish
    Title of host publicationProceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2014)
    PublisherInternational Foundation for Autonomous Agents and Multiagent Systems
    Pages893-900
    Volume2
    ISBN (Print)9781634391313
    Publication statusPublished - 2014
    EventThe undecidability of group announcements - Paris, France.
    Duration: 1 Jan 2014 → …

    Conference

    ConferenceThe undecidability of group announcements
    Period1/01/14 → …

    Fingerprint Dive into the research topics of 'The undecidability of group announcements'. Together they form a unique fingerprint.

    Cite this