[Skip Header and Navigation] [Jump to Main Content]
Faculty := "Information Technology"

Languages

  • العربية
  • English
  • Staff Website
  • E-Learning
  • Zajel

Primary Links

  • Home
  • Photo Gallery
  • Graduation Projects
  • Computer Science
  • Computerized Information Systems
  • Management Information Systems
  • College Academic Catalogue
  • Goals
  • Overview
  • Vision and Mission
Home

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

Authors
Faculty Authors: 
Wael Abdalleh Ahmad Mustafa

this paper presents an optimization method to improve execution time of Farward-Chaining Rule-Based Programs.The improvement is achieved by deleting rules that finish firing during run-time.The condition 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 analysis is utilized to determine when rules finish firing during run-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 a final step to other optimization methods.The results of applying the optimization to three CLIPS Rule-Based Programs are presented.These rules show significant improvement when the source program contains rules that require significant matching time and finish execution early during run-time.

Full Article: 
application/vnd.openxmlformats-officedocument.wordprocessingml.document iconDoc1.docx
[Jump to Top] [Jump to Main Content]