Run-Time Elimination of Dead-Rules in Forward-Chaining Rule-Based Programs
| dc.contributor.author | Wael Mustafa | |
| dc.date.accessioned | 2016-09-07T10:16:45Z | |
| dc.date.available | 2016-09-07T10:16:45Z | |
| dc.date.issued | 1999 | |
| dc.description.abstract | This paper presents an optimization method to improve execution time of forward-chaining rule based programs. The improvement is achieved by deleting rules that finish firing during run-time. The conditions of the deleted rules are not matched against working memory in later execution cycles and hence the execution time is reduced. Information obtained from control and data-flow analyses is utilized to determine when rules finish firing during nm-time. Since rules are deleted during run-time only after they finish firing the optimization does not change the semantics of the source program. The optimization method can be n final step to other optimization methods. The results of applying the optimization to three CLIPS rule-based programs are presented. These results show significant improvement when the source program contains rules that require significant matching time and finish execution early during run-time. | en |
| dc.identifier | 1727-2114 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11888/1917 | |
| dc.title | Run-Time Elimination of Dead-Rules in Forward-Chaining Rule-Based Programs | en |
| dc.title | ازالة القواعد بعد انتهاء تنفيذها في برامج القواعد المنتجة | ar |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- run-time-elimination-dead-rules-forward-chaining-rule-based-programs.pdf
- Size:
- 1.04 MB
- Format:
- Adobe Portable Document Format
- Description: