Home Online Resources Table of Contents

Journal of Logic and Computation, Volume 8, Issue 3: June 1998.

Decision procedures for BDI logics

AS Rao1 and MP Georgeff2

1Mitchell Madison Group, Level 49, 120 Collins Street, Melbourne, Victoria 3000, Australia, E-mail: anand_rao@mmg.net.au, 2Australian Artificial Intelligence Institute, Level 6, 171 La Trobe Street, Melbourne, Australia, E-mail: georgeff@aaii.oz.au

The study of computational agents capable of rational behaviour has received increasing attention in recent years. A number of theoretical formalizations for such multi-agent systems have been proposed. However, most of these formalizations do not have a strong semantic basis nor a sound and complete axiomatization. Hence, it has not been clear as to how these formalizations could assist in building agents in practice. This paper explores a particular type of multi-agent system, in which each agent is viewed as having the three mental attitudes of belief (B), desire (D), and intention (I). It provides a family of multi-modal branching-time BDI logics with a possible-worlds semantics, categorizes them, provides sound and complete axiomatizations, and gives constructive tableau-based decision procedures for testing the satisfiability and validity of formulas. The computational complexity of these decision procedures is no greater than the complexity of their underlying temporal logic component.

Keywords: Rational agents, belief-desire-intention (BDI) model, multi-modal logic, modal logic, theorem proving, tableaux methods, branching time temporal logic, temporal logic.

Pages 293-342


This page is run by Oxford University Press, Great Clarendon Street, Oxford OX2 6DP, UK
as part of the OUP Journals World Wide Web service.
Comments and feedback: www-admin@oup.co.uk
URL: http://www.oup.co.uk/logcom/hdb/Volume_08/Issue_03/080293.sgm.abs.html
Last modification: 22 July 1998.
Copyright© Oxford University Press, 1998.