Decision procedure for a fragment of mutual belief logic with quantified agent variables

Authors:
Regimantas Pliuškevičius;Aida Pliuškevičienė
Affiliations:
Institute of Mathematics and Informatics, Vilnius, Lithuania;Institute of Mathematics and Informatics, Vilnius, Lithuania
Venue:
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Year:
2005

Citing 9
Cited 1

Gentzen style systems for K45 and K45D

Logic at Botik'89 Symposium on logical foundations of computer science
Reasoning about knowledge

Reasoning about knowledge
Deduction systems for BDI logics using sequent calculus

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Epistemic Logic for AI and Computer Science

Epistemic Logic for AI and Computer Science
Introduction to Multiagent Systems

Introduction to Multiagent Systems
Efficient Loop-Check for Backward Proof Search in Some Non-classical Propositional Logics

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
QLB: A Quantified Logic for Belief

ECAI '96 Proceedings of the Workshop on Intelligent Agents III, Agent Theories, Architectures, and Languages
Reasoning about common knowledge with infinitely many agents

Information and Computation
Rational Teams: Logical Aspects of Multi-Agent Systems

Fundamenta Informaticae - Multiagent Systems (FAMAS'03)

Termination of Derivations in a Fragment of Transitive Distributed Knowledge Logic

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

A deduction-based decision procedure is presented for a fragment of mutual belief logic with quantified agent variables (MBQL). The language of MBQL contains belief, everybody believes and mutual belief modalities, variables and constants for agents. The language of MBQL is convenient to describe the properties of rational agents when the number of agents is not known in advance. On the other hand, even if the exact number of agents is known, a language with quantified agent variables allows us to use more compact expressions. For the MBQL a sequent calculus MBQ* with invertible (in some sense) rules is proposed. The presented decision procedure is realized by means of the calculus MBQ* that allows us to simplify a procedure of loop-check sharply. For a fragment of MBQL (without positive occurrences of mutual belief modality), the loop-check-free sequent calculus is proposed. To this end, special rules for belief and everybody believes modalities (introducing marked modalities and indices) and special sequents serving as a termination criterion for non-derivability are introduced. For sequents containing positive occurrences of mutual belief modality sequents of special shape are used to specialize a loop-check and to find non-logical (loop-type) axioms.