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: Technological Challenges of the 1990's |
| Place of Publication | New York, NY, United States |
| Publisher | Publ by ACM |
| Pages | 353-362 |
| Number of pages | 10 |
| ISBN (Print) | 089791502X |
| Publication status | Published - 1992 |
| Externally published | Yes |
| Event | Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing - SAC '92 - Kansas City, KS, USA Duration: 1 Mar 1992 → 3 Mar 1992 |
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
On the construction of efficient match networks. / Tan, Jack S E; Srivastava, Jaideep; Shekhar, Sashi.
Applied Computing: Technological Challenges of the 1990's. New York, NY, United States : Publ by ACM, 1992. p. 353-362.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - On the construction of efficient match networks
AU - Tan, Jack S E
AU - Srivastava, Jaideep
AU - Shekhar, Sashi
PY - 1992
Y1 - 1992
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0026984914&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0026984914&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0026984914
SN - 089791502X
SP - 353
EP - 362
BT - Applied Computing: Technological Challenges of the 1990's
PB - Publ by ACM
CY - New York, NY, United States
ER -