DocumentCode
2388836
Title
Incremental binding-space match: the linearized matchbox algorithm
Author
Perlin, Mark
Author_Institution
Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
fYear
1991
fDate
10-13 Nov 1991
Firstpage
468
Lastpage
477
Abstract
A new binding-space algorithm conjunctive match is introduced. Known as the linearized match box, it improves on the parallel match box algorithm by reducing broadcast cost, better adapting it to serial computers. Cost estimates are presented that help determine the applicability of linearized match box for particular rule problems. Linearized match box has been implemented, and its utility in overcoming PRODIGY´s control knowledge bottleneck is discussed
Keywords
artificial intelligence; inference mechanisms; knowledge based systems; parallel algorithms; binding-space algorithm conjunctive match; cost estimates; linearized matchbox algorithm; parallel match box algorithm; Artificial intelligence; Broadcasting; Computer architecture; Computer science; Inference mechanisms; Knowledge based systems; Processor scheduling; Production facilities; Production systems; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Tools for Artificial Intelligence, 1991. TAI '91., Third International Conference on
Conference_Location
San Jose, CA
Print_ISBN
0-8186-2300-4
Type
conf
DOI
10.1109/TAI.1991.167028
Filename
167028
Link To Document