Run-Time Elimination of Dead-Rules in Forward-Chaining Rule-Based Programs

Wael Mustafa

doi:https://doi.org/10.35552/anujr.a.13.1.382

English
العربيّة

Full text

Run-Time Elimination of Dead-Rules in Forward-Chaining Rule-Based Programs

DOI:

10.35552/anujr.a.13.1.382

Authors:

Wael Mustafa

Article info

Received 1998-08-29

Received in revised form

Accepted 1999-07-04

Availabe online 1999-07-04

Pages 37 - 56

Keywords

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.

Recommended Citation

BibTex RIS

Mustafa, W. (1999). Run-Time Elimination of Dead-Rules in Forward-Chaining Rule-Based Programs. An-Najah University Journal for Research - A (Natural Sciences), 13(1), 37–56. https://doi.org/10.35552/anujr.a.13.1.382

[1]W. Mustafa, “Run-Time Elimination of Dead-Rules in Forward-Chaining Rule-Based Programs,” An-Najah University Journal for Research - A (Natural Sciences), vol. 13, no. 1, pp. 37–56, Jan. 1999, doi: 10.35552/anujr.a.13.1.382.

Mustafa, Wael. “Run-Time Elimination of Dead-Rules in Forward-Chaining Rule-Based Programs.” An-Najah University Journal for Research - A (Natural Sciences), vol. 13, no. 1, Jan. 1999, pp. 37–56. Crossref, https://doi.org/10.35552/anujr.a.13.1.382.

1.Mustafa W. Run-Time Elimination of Dead-Rules in Forward-Chaining Rule-Based Programs. An-Najah University Journal for Research - A (Natural Sciences) [Internet]. 1999 Jan;13(1):37–56. Available from: http://dx.doi.org/10.35552/anujr.a.13.1.382

Mustafa, Wael. “Run-Time Elimination of Dead-Rules in Forward-Chaining Rule-Based Programs.” An-Najah University Journal for Research - A (Natural Sciences) 13, no. 1 (January 1999): 37–56. https://doi.org/10.35552/anujr.a.13.1.382.

ازالة القواعد بعد انتهاء تنفيذها في برامج القواعد المنتجة

DOI:

10.35552/anujr.a.13.1.382

المؤلفون:

وائل مصطفى

معلومات المقال

تاريخ التسليم 1998-08-29

تاريخ تسليم النسخة المعدلة

تاريخ القبول 1999-07-04

على شبكة الإنترنت 1999-07-04

الصفحات 37 - 56

الكلمات الإفتتاحية

الملخص

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.