Results 1 
4 of
4
Arbitrary Public Announcement Logic with Mental Programs
"... rennes.fr We propose a variant of arbitrary public announcement logic which is decidable. In this variant, knowledge accessibility relations are defined by programs. Technically, programs are written in dynamic logic with propositional assignments. We prove that both the model checking problem and t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
rennes.fr We propose a variant of arbitrary public announcement logic which is decidable. In this variant, knowledge accessibility relations are defined by programs. Technically, programs are written in dynamic logic with propositional assignments. We prove that both the model checking problem and the satisfiability problem are decidable and AEXPpolcomplete where AEXPpol is the class of decision problems decided by alternating Turing machines running in exponential time where the number of alternations is polynomial. Whereas arbitrary public announcement logic is undecidable, our framework is decidable and we provide a proofofconcept to show its expressiveness: we use our framework to reason about epistemic properties and arbitrary announcements when agents are cameras located in the plane.
Proceedings of the TwentyThird International Joint Conference on Artificial Intelligence The Complexity of OneAgent Refinement Modal Logic ∗
"... We investigate the complexity of satisfiability for oneagent refinement modal logic (RML), an extension of basic modal logic (ML) obtained by adding refinement quantifiers on structures. RML is known to have the same expressiveness as ML, but the translation of RML into ML is of nonelementary comp ..."
Abstract
 Add to MetaCart
We investigate the complexity of satisfiability for oneagent refinement modal logic (RML), an extension of basic modal logic (ML) obtained by adding refinement quantifiers on structures. RML is known to have the same expressiveness as ML, but the translation of RML into ML is of nonelementary complexity, and RML is at least doubly exponentially more succinct than ML. In this paper we show that RMLsatisfiability is ‘only ’ singly exponentially harder than MLsatisfiability, the latter being a wellknown PSPACEcomplete problem.
6.1.1. Deciding Selective Declassification of Petri Nets 7
"... IN COLLABORATION WITH: Institut de recherche en informatique et systèmes aléatoires (IRISA) ..."
Abstract
 Add to MetaCart
IN COLLABORATION WITH: Institut de recherche en informatique et systèmes aléatoires (IRISA)