Verification and Simplification of DMN Decision Tables
Name
Ülari Laurson
Abstract
The Decision Model and Notation (DMN) is a standard notation to specify decision logic in business applications. A central construct in DMN is a decision table. The rising use of DMN decision tables to capture and to automate everyday business decisions raises the need to support analysis tasks on decision tables. This thesis provides scalable algorithms to tackle three analysis tasks: detection of overlapping rules, detection of missing rules and simplification of decision tables via rule merging. All proposed algorithms have been implemented in an open-source DMN editor and are tested on large decision tables derived from a credit lending data-set.
Graduation Thesis language
English
Graduation Thesis type
Master - Computer Science
Supervisor(s)
Marlon Dumas, Irene Teinemaa
Defence year
2016