Business Rule Sets as Programs: Turing-completeness and Structural Operational Semantics - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-01178894 , version 1 (21-07-2015)

Identifiants

  • HAL Id : hal-01178894 , version 1

Citer

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⟩
85 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More