A Parallelized Variant of Junker’s QuickXPlain Algorithm

Cristian Vidal Silva; Alexander Felfernig; Jose Galindo; Müslüm Atas; David Benavides

doi:10.1007/978-3-030-59491-6_44

A Parallelized Variant of Junker’s QuickXPlain Algorithm

Cristian Vidal Silva^*, Alexander Felfernig, Jose Galindo, Müslüm Atas, David Benavides

^*Corresponding author for this work

Institute of Software Technology (7160)

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

Abstract

Conflict detection is used in many scenarios ranging from interactive decision making to the diagnosis of potentially faulty hardware components or models. In these scenarios, the efficient identification of conflicts is crucial. Junker’s QuickXPlain is a divide-and-conquer based algorithm for the determination of preferred minimal conflicts. Motivated by the increasing size and complexity of knowledge bases, we propose a parallelization of the original algorithm that helps to significantly improve runtime performance especially in complex knowledge bases. In this paper, we introduce a parallelized version of QuickXPlain that is based on the idea of predicting and executing parallel consistency checks needed by QuickXPlain.

Original language	English
Title of host publication	Foundations of Intelligent Systems - 25th International Symposium, ISMIS 2020, Proceedings
Editors	Denis Helic, Martin Stettinger, Alexander Felfernig, Gerhard Leitner, Zbigniew W. Ras
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	457-468
Number of pages	12
ISBN (Print)	9783030594909
DOIs	https://doi.org/10.1007/978-3-030-59491-6_44
Publication status	Published - 1 Jan 2020
Event	25th International Symposium on Methodologies for Intelligent Systems - TU Graz, Virtuell, Austria Duration: 23 Sept 2020 → 25 Sept 2020

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12117 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	25th International Symposium on Methodologies for Intelligent Systems
Abbreviated title	ISMIS 2020
Country/Territory	Austria
City	Virtuell
Period	23/09/20 → 25/09/20

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-030-59491-6_44

Cite this

Silva, C. V., Felfernig, A., Galindo, J., Atas, M., & Benavides, D. (2020). A Parallelized Variant of Junker’s QuickXPlain Algorithm. In D. Helic, M. Stettinger, A. Felfernig, G. Leitner, & Z. W. Ras (Eds.), Foundations of Intelligent Systems - 25th International Symposium, ISMIS 2020, Proceedings (pp. 457-468). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12117 LNAI). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-59491-6_44

A Parallelized Variant of Junker’s QuickXPlain Algorithm. / Silva, Cristian Vidal; Felfernig, Alexander; Galindo, Jose et al.
Foundations of Intelligent Systems - 25th International Symposium, ISMIS 2020, Proceedings. ed. / Denis Helic; Martin Stettinger; Alexander Felfernig; Gerhard Leitner; Zbigniew W. Ras. Springer Science and Business Media Deutschland GmbH, 2020. p. 457-468 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12117 LNAI).

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

Silva, CV, Felfernig, A, Galindo, J, Atas, M & Benavides, D 2020, A Parallelized Variant of Junker’s QuickXPlain Algorithm. in D Helic, M Stettinger, A Felfernig, G Leitner & ZW Ras (eds), Foundations of Intelligent Systems - 25th International Symposium, ISMIS 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12117 LNAI, Springer Science and Business Media Deutschland GmbH, pp. 457-468, 25th International Symposium on Methodologies for Intelligent Systems, Virtuell, Austria, 23/09/20. https://doi.org/10.1007/978-3-030-59491-6_44

Silva CV, Felfernig A, Galindo J, Atas M, Benavides D. A Parallelized Variant of Junker’s QuickXPlain Algorithm. In Helic D, Stettinger M, Felfernig A, Leitner G, Ras ZW, editors, Foundations of Intelligent Systems - 25th International Symposium, ISMIS 2020, Proceedings. Springer Science and Business Media Deutschland GmbH. 2020. p. 457-468. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-59491-6_44

Silva, Cristian Vidal ; Felfernig, Alexander ; Galindo, Jose et al. / A Parallelized Variant of Junker’s QuickXPlain Algorithm. Foundations of Intelligent Systems - 25th International Symposium, ISMIS 2020, Proceedings. editor / Denis Helic ; Martin Stettinger ; Alexander Felfernig ; Gerhard Leitner ; Zbigniew W. Ras. Springer Science and Business Media Deutschland GmbH, 2020. pp. 457-468 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8b2b390ce0b64da8b1b55b1288e78e42,

title = "A Parallelized Variant of Junker{\textquoteright}s QuickXPlain Algorithm",

abstract = "Conflict detection is used in many scenarios ranging from interactive decision making to the diagnosis of potentially faulty hardware components or models. In these scenarios, the efficient identification of conflicts is crucial. Junker{\textquoteright}s QuickXPlain is a divide-and-conquer based algorithm for the determination of preferred minimal conflicts. Motivated by the increasing size and complexity of knowledge bases, we propose a parallelization of the original algorithm that helps to significantly improve runtime performance especially in complex knowledge bases. In this paper, we introduce a parallelized version of QuickXPlain that is based on the idea of predicting and executing parallel consistency checks needed by QuickXPlain.",

author = "Silva, {Cristian Vidal} and Alexander Felfernig and Jose Galindo and M{\"u}sl{\"u}m Atas and David Benavides",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/978-3-030-59491-6_44",

language = "English",

isbn = "9783030594909",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "457--468",

editor = "Denis Helic and Martin Stettinger and Alexander Felfernig and Gerhard Leitner and Ras, {Zbigniew W.}",

booktitle = "Foundations of Intelligent Systems - 25th International Symposium, ISMIS 2020, Proceedings",

address = "Germany",

note = "25th International Symposium on Methodologies for Intelligent Systems, ISMIS 2020 ; Conference date: 23-09-2020 Through 25-09-2020",

}

TY - GEN

T1 - A Parallelized Variant of Junker’s QuickXPlain Algorithm

AU - Silva, Cristian Vidal

AU - Felfernig, Alexander

AU - Galindo, Jose

AU - Atas, Müslüm

AU - Benavides, David

PY - 2020/1/1

Y1 - 2020/1/1

N2 - Conflict detection is used in many scenarios ranging from interactive decision making to the diagnosis of potentially faulty hardware components or models. In these scenarios, the efficient identification of conflicts is crucial. Junker’s QuickXPlain is a divide-and-conquer based algorithm for the determination of preferred minimal conflicts. Motivated by the increasing size and complexity of knowledge bases, we propose a parallelization of the original algorithm that helps to significantly improve runtime performance especially in complex knowledge bases. In this paper, we introduce a parallelized version of QuickXPlain that is based on the idea of predicting and executing parallel consistency checks needed by QuickXPlain.

AB - Conflict detection is used in many scenarios ranging from interactive decision making to the diagnosis of potentially faulty hardware components or models. In these scenarios, the efficient identification of conflicts is crucial. Junker’s QuickXPlain is a divide-and-conquer based algorithm for the determination of preferred minimal conflicts. Motivated by the increasing size and complexity of knowledge bases, we propose a parallelization of the original algorithm that helps to significantly improve runtime performance especially in complex knowledge bases. In this paper, we introduce a parallelized version of QuickXPlain that is based on the idea of predicting and executing parallel consistency checks needed by QuickXPlain.

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

U2 - 10.1007/978-3-030-59491-6_44

DO - 10.1007/978-3-030-59491-6_44

M3 - Conference paper

AN - SCOPUS:85092085400

SN - 9783030594909

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 457

EP - 468

BT - Foundations of Intelligent Systems - 25th International Symposium, ISMIS 2020, Proceedings

A2 - Helic, Denis

A2 - Stettinger, Martin

A2 - Felfernig, Alexander

A2 - Leitner, Gerhard

A2 - Ras, Zbigniew W.

PB - Springer Science and Business Media Deutschland GmbH

T2 - 25th International Symposium on Methodologies for Intelligent Systems

Y2 - 23 September 2020 through 25 September 2020

ER -

A Parallelized Variant of Junker’s QuickXPlain Algorithm

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this