A Rete-based algorithm for rule selection in P systems

Abstract

The Rete algorithm is a well-known pattern matching algorithm conceived to make rule-based production system implementa tions more efficient. It builds a directed acyclic graph, represent ing higher-level rule sets, that allows the implementation to avoid checking each step the applicability of all the rules. Instead, only those affected by a change in the collection of facts are checked. In this paper we study how the underlying ideas of this algorithm can be adapted to improve the design of computational simula tors within the framework of Membrane Computing.