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.
Type de document :
Communication dans un congrès
Treizièmes Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA 2015), Jun 2015, Rennes, France
Liste complète des métadonnées

https://hal.inria.fr/hal-01178894
Contributeur : Sylvain Bouveret <>
Soumis le : mardi 21 juillet 2015 - 11:19:34
Dernière modification le : jeudi 11 janvier 2018 - 06:19:44

Identifiants

  • HAL Id : hal-01178894, version 1

Citation

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〉

Partager

Métriques

Consultations de la notice

95