Model checking against arbitrary public announcement logic: A first-order-logic prover approach for the existential fragment
Résumé
In this paper, we investigate the model checking problem of symbolic models against epis-temic logic with arbitrary public announcements and group announcements. We reduce this problem to the satisfiability of Monadic Monadic Second Order Logic (MMSO), the fragment of monadic-second order logic restricted to monadic predicates. In particular, for the case of epistemic formulas in which all arbitrary and group announcements are existential, the proposed reduction lands in monadic first-order logic. We take advantage of this situation to report on few experiments we made with first-order provers.
Domaines
Intelligence artificielle [cs.AI]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...