Efficient Forward Chaining for Declarative Rules in a Multi-Agent Modelling Language

CPM Report No.: 94-04
By: Steve Wallis and Scott Moss
Date: 21 October 1994 (Revised: 16 February 1995)

A version is published as: Wallis, S., Edmonds, B. and Moss, S., (1995): The Implementation and Logic of a Strictly Declarative Modelling Language. Expert Systems '95, Cambridge, 1995. In Macintosh, A. and Cooper, C. (eds.), (1995): Applications and Innovations in Expert Systems III. SGES Publications, Oxford. 351-360.


Most rule-based systems are imperative, or, if they are mainly declarative, also provide some imperative features. It is argued that a strictly declarative formalism with a sound logical basis is preferable. This paper addresses the task of implementing forward chaining efficiently for declarative rulebases. Deductions that can be invalidated by new information are particularly difficult to deal with consistently and efficiently. The paper shows that efficient forward chaining is possible, by utilising the implicit structure of the rulebases to optimise the most common circumstances. A language, called SDML, which utilises such declarative rulebases to simulate multi-agent models, is described.

Click to retrieve the report:

SM Home | SW Home | Other CPM Reports | CPM home page |