Abstract
The performance of rule based systems are limited by the multiple pattern multiple object (MPMO) matching problem. Various efficiency heuristics have been applied manually to speed-up the solutions to MPMO. We address the problem of automatically determining the best match network for rule matching. We contribute simple conditions to guarantee the optimality of given network in presence of updates to the working memory.
| Original language | English |
|---|---|
| Title of host publication | Applied Computing |
| Subtitle of host publication | Technological Challenges of the 1990's |
| Publisher | Publ by ACM |
| Pages | 353-362 |
| Number of pages | 10 |
| ISBN (Print) | 089791502X |
| Publication status | Published - 1 Dec 1992 |
| Event | Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing - SAC '92 - Kansas City, KS, USA Duration: 1 Mar 1992 → 3 Mar 1992 |
Publication series
| Name | Applied Computing: Technological Challenges of the 1990's |
|---|
Other
| Other | Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing - SAC '92 |
|---|---|
| City | Kansas City, KS, USA |
| Period | 1/3/92 → 3/3/92 |
Fingerprint
ASJC Scopus subject areas
- Engineering(all)
Cite this
Tan, J. S. E., Srivastava, J., & Shekhar, S. (1992). On the construction of efficient match networks. In Applied Computing: Technological Challenges of the 1990's (pp. 353-362). (Applied Computing: Technological Challenges of the 1990's). Publ by ACM.