Tableaux for Regular Grammar Logics of Agents Using Automaton-Modal Formulae
نویسندگان
چکیده
We present sound and complete tableau calculi for the class of regular grammar logics and a class eRG of extended regular grammar logics which contains useful epistemic logics for reasoning about beliefs of agents. Our tableau rules use a special feature called automaton-modal formulae which are similar to formulae of automaton propositional dynamic logic. Our calculi are cut-free and have the analytic superformula property so they give decision procedures. We show that the known EXPTIME upper bound for regular grammar logics can be obtained using our tableau calculus. We also prove that the general satisfiability problem of eRG logics is EXPTIME-complete.
منابع مشابه
A Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are similar to formulae of automaton propositional dynamic logic. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. We show that the known EXPTIME upper bound for regular gr...
متن کاملAnalytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
We present a sound and complete tableau calculus for a class BReg of extended regular grammar logics which contains useful epistemic logics for reasoning about agent beliefs. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. Applying sound global caching to the calculus, we obtain the first optimal (EXPTime) tableau decision procedure for BReg...
متن کاملGrammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures
A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal operator [a] comes with a converse [a]−1. Extending previous works on nested sequent systems for tense logics, we show all grammar logics (with or without conver...
متن کاملDeciding Modal Logics using Tableaux and Set Theory
We propose a tableau-like decision procedure for deciding the satisfiability of set-theoretical formulae with restricted universal quantifiers and the powerset operator. Our result apply to a rather large class of set theories. The procedure we define can be used as a subroutine to decide the same class of formulae both in Set Theory and in non well-founded set theories, since we assume neither...
متن کاملAn Algebraic Characterization of Temporal Logics on Finite Trees, Part 1
We associate a modal operator with each language belonging to a given class of regular tree languages and use the cascade product of tree automata to give an algebraic characterization of the expressive power of the resulting logic.
متن کامل