Paper Info
Title
A Fast Pattern-matching Algorithm Using Matching Candidates for Production Systems
Abstract
Several fast pattern matching algorithms have been proposed to improve the inference speed of production systems. In almost all of these algorithms, conditions in rules are represented using a dataflow network and working memory elements propagates this network as tokens. These algorithms are effective, but excessive constant testing is unavoidable when the working memory must be frequently updated.
Year
DOI
Venue
1996
10.1007/3-540-61532-6_55
PRICAI
Keywords
Field
DocType
production systems,fast pattern-matching algorithm,matching candidates,pattern matching,production system,working memory
String searching algorithm,Pattern recognition,Computer science,Inference,Working memory,Dataflow,Artificial intelligence,Pattern matching,Machine learning
Conference
ISBN
Citations 
PageRank 
3-540-61532-6
1
0.38
References 
Authors
1
4
Name
Order
Citations
PageRank
Mitsunori Matsushita113829.70
Motohide Umano218328.91
Itsuo Hatono313318.38
Hiroyuki Tamura417630.79