Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs

Authors:
Rajeev Goré;Linh Anh Nguyen
Affiliations:
The Australian National University and NICTA, Canberra, Australia ACT 0200;Institute of Informatics, University of Warsaw, Warsaw, Poland 02-097
Venue:
Computational Logic in Multi-Agent Systems
Year:
2008

Citing 14
Cited 0

A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Formal languages: an introduction and a synopsis

Handbook of formal languages, vol. 1
Normal multimodal logics with interaction axioms

Labelled deduction
Combining deduction and model checking into Tableaux and algorithms for converse-PDL

Information and Computation
Dynamic Logic

Dynamic Logic
A Tableau for Multimodal Logics and Some (Un)Decidability Results

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Deciding Regular Grammar Logics with Converse Through First-Order Logic

Journal of Logic, Language and Information
Multimodal logic programming

Theoretical Computer Science
Rational Teams: Logical Aspects of Multi-Agent Systems

Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Augmenting concept languages by transitive closure of roles: an alternative to terminological cycles

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Decidability of SHIQ with complex role inclusion axioms

Artificial Intelligence
A tableau calculus with automaton-labelled formulae for regular grammar logics

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Reasoning about epistemic states of agents by modal logic programming

CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a sound and complete tableau calculus for a class $\mathcal{BR}eg$ of extended regular modal 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 $\mathcal{BR}eg$. We demonstrate the usefulness of $\mathcal{BR}eg$ logics and our tableau calculus using the wise men puzzle and its modified version, which requires axiom (5) for single agents.