DDMin versus QuickXplain - An Experimental Comparison of two Algorithms for Minimizing Collections

Oliver A. Tazl; Christopher Tafeit; Franz Wotawa; Alexander Felfernig

doi:10.18293/SEKE2022-172

DDMin versus QuickXplain - An Experimental Comparison of two Algorithms for Minimizing Collections

Oliver A. Tazl, Christopher Tafeit, Franz Wotawa, Alexander Felfernig

Institute of Software Technology (7160)

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Abstract

About two decades ago, two algorithms, i.e., DDMin and QuickXPlain, for minimizing collections, were independently proposed and gained attention in the two research areas of Software Engineering and Artificial Intelligence, respectively. Whereas DDMin was developed for reducing a given test case, QuickXPlain was intended to be used for obtaining minimal conflicts efficiently. In this paper, we compare the performance of both algorithms with respect to their capabilities of minimizing collections. We found out that one algorithm outperforms the other under given prerequisites and vice versa. These findings help to select the suitable algorithm for a given task.

Original language	English
Title of host publication	SEKE 2022 - Proceedings of the 34th International Conference on Software Engineering and Knowledge Engineering
Publisher	Knowledge Systems Institute Graduate School
Pages	481-486
Number of pages	6
ISBN (Electronic)	1891706543, 9781891706547
DOIs	https://doi.org/10.18293/SEKE2022-172
Publication status	Published - 2022
Event	34th International Conference on Software Engineering and Knowledge Engineering: SEKE 2022 - Pittsburgh, United States Duration: 1 Jul 2022 → 10 Jul 2022

Conference

Conference	34th International Conference on Software Engineering and Knowledge Engineering
Abbreviated title	SEKE 2022
Country/Territory	United States
City	Pittsburgh
Period	1/07/22 → 10/07/22

Keywords

application to diagnosis
configuration
conflict minimization
software testing
test case minimization

ASJC Scopus subject areas

Software

Access to Document

10.18293/SEKE2022-172

Cite this

Tazl, O. A., Tafeit, C., Wotawa, F., & Felfernig, A. (2022). DDMin versus QuickXplain - An Experimental Comparison of two Algorithms for Minimizing Collections. In SEKE 2022 - Proceedings of the 34th International Conference on Software Engineering and Knowledge Engineering (pp. 481-486). Knowledge Systems Institute Graduate School. https://doi.org/10.18293/SEKE2022-172

DDMin versus QuickXplain - An Experimental Comparison of two Algorithms for Minimizing Collections. / Tazl, Oliver A.; Tafeit, Christopher; Wotawa, Franz et al.
SEKE 2022 - Proceedings of the 34th International Conference on Software Engineering and Knowledge Engineering. Knowledge Systems Institute Graduate School, 2022. p. 481-486.

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Tazl, OA, Tafeit, C, Wotawa, F & Felfernig, A 2022, DDMin versus QuickXplain - An Experimental Comparison of two Algorithms for Minimizing Collections. in SEKE 2022 - Proceedings of the 34th International Conference on Software Engineering and Knowledge Engineering. Knowledge Systems Institute Graduate School, pp. 481-486, 34th International Conference on Software Engineering and Knowledge Engineering, Pittsburgh, United States, 1/07/22. https://doi.org/10.18293/SEKE2022-172

@inproceedings{8dea13b8d9934fca8613327382ee7701,

title = "DDMin versus QuickXplain - An Experimental Comparison of two Algorithms for Minimizing Collections",

abstract = "About two decades ago, two algorithms, i.e., DDMin and QuickXPlain, for minimizing collections, were independently proposed and gained attention in the two research areas of Software Engineering and Artificial Intelligence, respectively. Whereas DDMin was developed for reducing a given test case, QuickXPlain was intended to be used for obtaining minimal conflicts efficiently. In this paper, we compare the performance of both algorithms with respect to their capabilities of minimizing collections. We found out that one algorithm outperforms the other under given prerequisites and vice versa. These findings help to select the suitable algorithm for a given task.",

keywords = "application to diagnosis, configuration, conflict minimization, software testing, test case minimization",

author = "Tazl, {Oliver A.} and Christopher Tafeit and Franz Wotawa and Alexander Felfernig",

note = "Funding Information: ACKNOWLEDGEMENT The research was supported by ECSEL JU under the project H2020 826060 AI4DI - Artificial Intelligence for Digitising Industry. AI4DI is funded by the Austrian Federal Ministry of Transport, Innovation and Technology (BMVIT) under the program ”ICT of the Future” between May 2019 and April 2022. More information can be retrieved from https://iktderzukunft.at/en/ . Publisher Copyright: {\textcopyright} 2022 Knowledge Systems Institute Graduate School. All rights reserved.; 34th International Conference on Software Engineering and Knowledge Engineering : SEKE 2022, SEKE 2022 ; Conference date: 01-07-2022 Through 10-07-2022",

year = "2022",

doi = "10.18293/SEKE2022-172",

language = "English",

pages = "481--486",

booktitle = "SEKE 2022 - Proceedings of the 34th International Conference on Software Engineering and Knowledge Engineering",

publisher = "Knowledge Systems Institute Graduate School",

}

TY - GEN

T1 - DDMin versus QuickXplain - An Experimental Comparison of two Algorithms for Minimizing Collections

AU - Tazl, Oliver A.

AU - Tafeit, Christopher

AU - Wotawa, Franz

AU - Felfernig, Alexander

N1 - Funding Information: ACKNOWLEDGEMENT The research was supported by ECSEL JU under the project H2020 826060 AI4DI - Artificial Intelligence for Digitising Industry. AI4DI is funded by the Austrian Federal Ministry of Transport, Innovation and Technology (BMVIT) under the program ”ICT of the Future” between May 2019 and April 2022. More information can be retrieved from https://iktderzukunft.at/en/ . Publisher Copyright: © 2022 Knowledge Systems Institute Graduate School. All rights reserved.

PY - 2022

Y1 - 2022

N2 - About two decades ago, two algorithms, i.e., DDMin and QuickXPlain, for minimizing collections, were independently proposed and gained attention in the two research areas of Software Engineering and Artificial Intelligence, respectively. Whereas DDMin was developed for reducing a given test case, QuickXPlain was intended to be used for obtaining minimal conflicts efficiently. In this paper, we compare the performance of both algorithms with respect to their capabilities of minimizing collections. We found out that one algorithm outperforms the other under given prerequisites and vice versa. These findings help to select the suitable algorithm for a given task.

AB - About two decades ago, two algorithms, i.e., DDMin and QuickXPlain, for minimizing collections, were independently proposed and gained attention in the two research areas of Software Engineering and Artificial Intelligence, respectively. Whereas DDMin was developed for reducing a given test case, QuickXPlain was intended to be used for obtaining minimal conflicts efficiently. In this paper, we compare the performance of both algorithms with respect to their capabilities of minimizing collections. We found out that one algorithm outperforms the other under given prerequisites and vice versa. These findings help to select the suitable algorithm for a given task.

KW - application to diagnosis

KW - configuration

KW - conflict minimization

KW - software testing

KW - test case minimization

UR - http://www.scopus.com/inward/record.url?scp=85137164918&partnerID=8YFLogxK

U2 - 10.18293/SEKE2022-172

DO - 10.18293/SEKE2022-172

M3 - Conference paper

AN - SCOPUS:85137164918

SP - 481

EP - 486

BT - SEKE 2022 - Proceedings of the 34th International Conference on Software Engineering and Knowledge Engineering

PB - Knowledge Systems Institute Graduate School

T2 - 34th International Conference on Software Engineering and Knowledge Engineering

Y2 - 1 July 2022 through 10 July 2022

ER -

DDMin versus QuickXplain - An Experimental Comparison of two Algorithms for Minimizing Collections

Abstract

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this