Applying a Modified EQL Optimization Method to MRL Rule-Based Programs

  • Authors:
  • A. M. K. Cheng;J. Wang

  • Affiliations:
  • -;-

  • Venue:
  • ASSET '98 Proceedings of the 1998 IEEE Workshop on Application - Specific Software Engineering and Technology
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We modify our previously developed optimization method for EQL (Equational Rule-based Language) systems [1] to optimize MRL (Macro Rule-based Language) systems. In particular, we show how the EQL optimization method can be applied to an MRL system after its corresponding state space graphs are constructed. Since the time and space complexity of bidirectional search (O(bd/2) is better than breadth-first search's (O(bd), we use bidirection and bidirectional breadth-first search strategies instead of the original bottom-up and breadth-first search strategies employed in [1]. As in [1], the resulting optimized MRL system (1) has in general better response time because it requires a fewer number of rule firings to reach the fixed point, (2) is stable because it has no cycles, and (3) has no redundant rules.