Deduction systems for BDI logics using sequent calculus

Authors:
NIDE Naoyuki;Shiro Takata
Affiliations:
Nara Women's University;ATR Media Information Science Lab
Venue:
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Year:
2002

Citing 2
Cited 4

Formal methods in DAI: logic-based representation and reasoning

Multiagent systems
Branching time temporal logic

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop

Propositional planning in BDI agents

Proceedings of the 2004 ACM symposium on Applied computing
Mapping Mental States into Propositional Planning

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Decision Procedure for Temporal Logic of Belief and Actions

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

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present sound and complete deduction systems for propositional BDI logics by using Gentzen's sequent calculus. In these systems, we can construct the proof of a formula by using an extension of Wang's algorithm. Therefore, these systems are suitable for applications such as automatic proving and specification checking in BDI logics.