{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T12:40:52Z","timestamp":1698410452805},"reference-count":5,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":4462,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1995,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A production system is a typical tool for constructing an expert system. The Rete algorithm has been used as the condition match in the production system. The Rete algorithm features in that the condition match can executed efficiently by retaining the intermediate result of matching using the data\u2010flow graph (called Rete network). Efficiency is deteriorated, however, when most of the intermediate results are updated by a single recognition\u2010action cycle. Moreover, execution time for the condition match increases rapidly with an increase in the working memory elements. From such a viewpoint, this paper proposes a condition match algorithm wherein the intermediate result of matching is not retained, and the number of working memory tuples to be examined is reduced by connecting the common variables among the condition element. The proposed algorithm directly tries the condition match without using the Rete algorithm. The execution time does not increase so rapidly as in the Rete algorithm, but increases only slowly with the increase of the working memory elements. Consequently, the efficiency of the Rete algorithm is better when there are fewer working memory elements, and the efficiency of the proposed method is better when both the number of working memory elements and the computation cost for the condition match are increased. In other words, the proposed algorithm can handle high\u2010cost rules.<\/jats:p>","DOI":"10.1002\/scj.4690260105","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T03:19:06Z","timestamp":1183864746000},"page":"50-61","source":"Crossref","is-referenced-by-count":0,"title":["Direct match algorithm for production systems"],"prefix":"10.1002","volume":"26","author":[{"given":"Haruhiko","family":"Kimura","sequence":"first","affiliation":[]},{"given":"Shin\u2010Ya","family":"Kobayashi","sequence":"additional","affiliation":[]},{"given":"Tsuyoshi","family":"Takebe","sequence":"additional","affiliation":[]},{"given":"Kazuyuki","family":"Sumiyoshi","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-737550-2.50012-9"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(82)90020-0"},{"key":"e_1_2_1_4_2","unstructured":"D. P.Miranker.TREAT: A better match algorithm for AI production system.AAAI\u201087 pp.42\u201347(1987)."},{"issue":"1","key":"e_1_2_1_5_2","first-page":"168","article-title":"Data structure of working memory realizing high\u2010speed inference in production system","volume":"76","author":"Kimura H.","year":"1993","journal-title":"Trans. (D) I.E.I.C.E., Japan"},{"key":"e_1_2_1_6_2","volume-title":"Programming Expert System in OPS5: An Introduction to Rule\u2010Based Programming","author":"Brownston L.","year":"1985"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690260105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690260105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T05:09:42Z","timestamp":1698296982000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690260105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["10.1002\/scj.4690260105"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690260105","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}