Skip to Main content Skip to Navigation
Conference papers

Business Rule Sets as Programs: Turing-completeness and Structural Operational Semantics

Abstract : Production Rules or Business Rules are of the form 'if (condition) then (action)'. Sets of such rules can be executed on input data according to execution algorithms, or analyzed semantically using operational semantics, but the universality of systems or sets of such rules has never been characterized formally, to the best of our knowledge. Our goal is to show that for a simple execution algorithm, sets of Business Rule form a universal programming language. In other words, we show that Business Rules are Turing-complete. The proof consists in showing that a Business Rule program can be transformed in a WHILE program using additional variables. The implications of such a WHILE form include a type of structural operational semantics which may facilitate semantic analysis of Business Rule Sets.
Document type :
Conference papers
Complete list of metadata
Contributor : Sylvain Bouveret Connect in order to contact the contributor
Submitted on : Tuesday, July 21, 2015 - 11:19:34 AM
Last modification on : Friday, June 4, 2021 - 8:28:01 PM


  • HAL Id : hal-01178894, version 1



Olivier Wang, Changhai Ke, Leo Liberti, Christian de Sainte Marie. Business Rule Sets as Programs: Turing-completeness and Structural Operational Semantics. Treizièmes Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA 2015), Jun 2015, Rennes, France. ⟨hal-01178894⟩



Record views