The ISA expert system: a prototype system for failure diagnosis on the space station
IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1
TREAT: a new and efficient match algorithm for AI production systems
TREAT: a new and efficient match algorithm for AI production systems
The engineering of knowledge-based systems: theory and practice
The engineering of knowledge-based systems: theory and practice
Changing the rules: transformations for rule-based optimizers
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
The Organization and Performance of a TREAT-Based Production System Compiler
IEEE Transactions on Knowledge and Data Engineering
A Source-to-Source Transformation for Increasing Rule-Based System Parallelism
IEEE Transactions on Knowledge and Data Engineering
An Optimization Algorithm for Production Systems
IEEE Transactions on Knowledge and Data Engineering
Response Time Analysis of EQL Real-Time Rule-Based Systems
IEEE Transactions on Knowledge and Data Engineering
Optimization of Rule-Based Systems Using State Space Graphs
IEEE Transactions on Knowledge and Data Engineering
Analysis of Real-Time Rule-Based Systems with Behavioral Constraint Assertions Specified in Estella
IEEE Transactions on Software Engineering
An Algorithmic Basis for Integrating Production Systems and Large Databases
Proceedings of the Sixth International Conference on Data Engineering
A Performance Comparison of the Rete and TREAT Algorithms for Testing Database Rule Conditions
Proceedings of the Eighth International Conference on Data Engineering
Predicting the response time of OPS5-style production systems
CAIA '95 Proceedings of the 11th Conference on Artificial Intelligence for Applications
Dynamic Optimization for Real-Time Rule-Based Systems Using Predicate Dependency
RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
Analysis and Synthesis of Real-Time Rule-Based Decision Systems
Analysis and Synthesis of Real-Time Rule-Based Decision Systems
A distributed expert system for space shuttle flight control
A distributed expert system for space shuttle flight control
Shortening Matching Time in OPS5 Production Systems
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Priority-driven Coding and Transmission of Progressive JPEG Images for Real-Time Applications
Journal of VLSI Signal Processing Systems
| Hi-index | 0.00 |
Abstract--Analyzing and reducing the execution-time upper bound of real-time rule-based expert systems is a very important task because of the stringent timing constraints imposed on this class of systems. This paper presents a new runtime optimization to reduce the execution-time upper bound of real-time rule-based expert systems. In order to determine rules to be evaluated at runtime, a predicate dependency list, which consists of a predicate, its active rule set and corresponding inactive rule set, is created for each predicate in a real-time rule-based program. Based on the predicate dependency list and the current value of each variable, the new runtime optimization dynamically selects rules to be evaluated at runtime. For the timing analysis of the proposed algorithm, the paper introduces a predicate-based rule dependency graph, a predicate-based enable-rule graph, and their construction algorithm. The paper also discusses the bounded time of the equational logic rule-based program using the predicate-based rule dependency graph as well as the predicate-based enable-rule graph. The implementation and performance evaluation of the proposed algorithm using both synthetic and practical real-time rule-bases programs are also presented. The performance evaluation shows that the runtime optimizer reduces the number of rule evaluations and predicate evaluations as well as the response time upper bound significantly, and the new algorithm yields better execution-time upper bound compared to other optimization methods.