[Next] [Previous] [Top] [Contents]
Efficient Forward Chaining for Declarative Rules in a Multi-Agent Modelling Language
This section describes some benchmarks which can be used to compare the efficiency of different rule-based systems. Measurements of speed and memory usage, for SDML and an imperative system, are shown. The imperative system that SDML is compared with is an implementation of OPS5 which uses the standard RETE [6] match algorithm to decide which rules can fire. These measurements show that declarative rules are viable for efficient forward chaining.
- 6.1 - Benchmarks
-
- 6.2 - Measurements
-
Efficient Forward Chaining for Declarative Rules in a Multi-Agent Modelling Language - 16 FEB 95
[Next] [Previous] [Top] [Contents]
Generated with CERN WebMaker