Show simple item record

Derivation of an Efficient Rule System Pattern Matcher

dc.date.accessioned2004-10-20T20:12:04Z
dc.date.accessioned2018-11-24T10:22:44Z
dc.date.available2004-10-20T20:12:04Z
dc.date.available2018-11-24T10:22:44Z
dc.date.issued1989-02-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6979
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6979
dc.description.abstractFormalizing algorithm derivations is a necessary prerequisite for developing automated algorithm design systems. This report describes a derivation of an algorithm for incrementally matching conjunctive patterns against a growing database. This algorithm, which is modeled on the Rete matcher used in the OPS5 production system, forms a basis for efficiently implementing a rule system. The highlights of this derivation are: (1) a formal specification for the rule system matching problem, (2) derivation of an algorithm for this task using a lattice-theoretic model of conjunctive and disjunctive variable substitutions, and (3) optimization of this algorithm, using finite differencing, for incrementally processing new data.en_US
dc.format.extent9034855 bytes
dc.format.extent3382405 bytes
dc.language.isoen_US
dc.titleDerivation of an Efficient Rule System Pattern Matcheren_US


Files in this item

FilesSizeFormatView
AITR-1109.pdf3.382Mbapplication/pdfView/Open
AITR-1109.ps9.034Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record