Derivation of an Efficient Rule System Pattern Matcher

dc.creator	Wertheimer, Jeremy M.
dc.date	2004-10-20T20:12:04Z
dc.date	2004-10-20T20:12:04Z
dc.date	1989-02-01
dc.date.accessioned	2013-10-09T02:48:01Z
dc.date.available	2013-10-09T02:48:01Z
dc.date.issued	2013-10-09
dc.identifier	AITR-1109
dc.identifier	http://hdl.handle.net/1721.1/6979
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	Formalizing 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.
dc.format	9034855 bytes
dc.format	3382405 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AITR-1109
dc.title	Derivation of an Efficient Rule System Pattern Matcher

Files in this item

Files	Size	Format	View
There are no files associated with this item.