Semantics, Analysis and Simplification of DMN Decision Tables

被引：36

作者：

Calvanese, Diego ^{[1
]}

Dumas, Marlon ^{[2
]}

Laurson, Ulari ^{[2
]}

Maggi, Fabrizio M. ^{[2
]}

Montali, Marco ^{[1
]}

Teinemaa, Irene ^{[2
]}

机构：

[1] Free Univ Bozen Bolzano, Piazza Domenicani 3, I-39100 Bolzano, Italy

[2] Univ Tartu, J Liivi 2, EE-50409 Tartu, Estonia

来源：

INFORMATION SYSTEMS | 2018年 / 78卷

关键词：

Decision Table; Decision Model; Notation; Sweep-Line; INTERSECTIONS; VERIFICATION; VALIDATION; CONVERSION; RULES;

D O I：

10.1016/j.is.2018.01.010

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The Decision Model and Notation (DMN) is a standard notation to capture decision logic in business applications. A central construct in DMN is that of a decision table. The increasing use of DMN decision tables to capture critical business knowledge raises the need to support analysis and refactoring tasks on these tables. This article puts forward a formal semantics for DMN decision tables and a formal definition of analysis tasks on such tables. The article then proposes a general approach to analyze and refactor decision tables based on a geometric interpretation thereof. This general approach is used to design efficient algorithms for two analysis tasks (detection of overlapping rules and of missing rules) and one refactoring task (simplification of tables via rule merging). The algorithms have been implemented in an open-source DMN editor and tested on large decision tables derived from a credit lending dataset. (C) 2018 Elsevier Ltd. All rights reserved.

引用

页码：112 / 125

页数：14

共 23 条

[1]

[Anonymous], 2009, SIGKDD Explorations, DOI DOI 10.1145/1656274.1656278

[2]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness

[3]

Batoulis K., 2015, P CAISE

[4] Discovering Decision Models from Event Logs [J].

Bazhenova, Ekaterina ;

Buelow, Susanne ;

Weske, Mathias .

BUSINESS INFORMATION SYSTEMS (BIS 2016), 2016, 255 :237-251

[5]

BENTLEY JL, 1979, IEEE T COMPUT, V28, P643, DOI 10.1109/TC.1979.1675432

[6] FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H] [J].

BRON, C ;

KERBOSCH, J .

COMMUNICATIONS OF THE ACM, 1973, 16 (09) :575-577

[7] Semantics and Analysis of DMN Decision Tables [J].

Calvanese, Diego ;

Dumas, Marlon ;

Laurson, Ulari ;

Maggi, Fabrizio M. ;

Montali, Marco ;

Teinemaa, Irene .

BUSINESS PROCESS MANAGEMENT, BPM 2016, 2016, 9850 :217-233

[8]

CODASYL Decision Table Task Group, 1982, MODERN APPRAISAL DEC

[9] Z3: An efficient SMT solver [J].

de Moura, Leonardo ;

Bjorner, Nikolaj .

TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 2008, 4963 :337-340

[10] RECTANGULAR PARTITION IS POLYNOMIAL IN 2 DIMENSIONS BUT NP-COMPLETE IN 3 [J].

DIELISSEN, VJ ;

KALDEWAIJ, A .

INFORMATION PROCESSING LETTERS, 1991, 38 (01) :1-6

← 1 2 3 →