Abstract
This chapter builds on the previous two chapters to define an abstract machine that describes the execution of a rule program. This machine is based on such concepts as the working memory and rule instances, which are introduced. The operational semantics that we define differs from previous formalizations of production systems in that we differentiate eligibility and applicability of a rule instance. The applicability of a rule instance relates to whether the rule guard is valid on the objects in the instance, whereas the eligibility of a rule instance is determined by the rule instances executed so far by the rule engine. This distinction between eligibility and applicability allows us to describe other execution strategies than the historical Rete algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
All URLs were successfully accessed on January 22, 2013.
References
All URLs were successfully accessed on January 22, 2013.
Berstel-Da Silva, B.: Formalizing both refraction-based and sequential executions of production rule programs. In: Bikakis, A., Giurca, A. (eds.) Rules on the Web: Research and Applications. Lecture Notes in Computer Science, vol. 7438, pp. 47–61. Springer, Berlin (2012)
Brownston, L., Farrell, R., Kant, E., Martin, N.: Programming Expert Systems in OPS5: An Introduction to Rule-Based Programming. Addison-Wesley, Boston (1985)
Cirstea, H., Kirchner, C., Moossen, M., Moreau, P.É.: Production systems and Rete algorithm formalisation. Research report, LORIA, Nancy (2004). http://hal.inria.fr/inria-00280938/PDF/rete.formalisation.pdf
Fages, F., Lissajoux, R.: Sémantique opérationnelle et compilation des systèmes de production. Revue d’Intelligence Artificielle 6(4), 431–456 (1992)
Fair, Isaac, and Company: High-volume batch processing with Blaze Advisor. Computer World UK (2007). http://www.computerworlduk.com/white-paper/business-process/5092/high-volume-batch-processing-with-blaze-advisor/
Forgy, C.: OPS5 User’s manual. Tech. Rep. CMU-CS-81-135, Carnegie-Mellon University, Pittsburgh (1981)
Forgy, C.: Rete: A fast algorithm for the many patterns/many objects match problem. Artif. Intell. 19(1), 17–37 (1982)
IBM: IBM Operational Decision Manager v8.0 User’s Manual (2012). http://publib.boulder.ibm.com/infocenter/dmanager/v8r0/
Mettrey, W.: A comparative evaluation of expert system tools. Computer 24, 19–31 (1991)
Plotkin, G.D.: A structural approach to operational semantics. J. Logic Algebr. Program. 60–61, 17–139 (2004). Reprint with corrections of the 1981 article
Red Hat: JBoss Rules 5 Reference Guide (2012). https://access.redhat.com/knowledge/docs/en-US/JBoss_Enterprise_BRMS_Platform/5/html-single/JBoss_Rules_5_Reference_Guide/index.html#Sequential_Mode
de Sainte Marie, C., Hallmark, G., Paschke, A.: Rule Interchange Format, Production Rule Dialect. Recommendation, W3C (2010). http://www.w3.org/TR/rif-prd/
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Berstel-Da Silva, B. (2014). Operational Semantics of Rule Programs. In: Verification of Business Rules Programs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40038-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-40038-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40037-7
Online ISBN: 978-3-642-40038-4
eBook Packages: Computer ScienceComputer Science (R0)