A Parallelized Variant of Junker’s QuickXPlain Algorithm

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

*Korrespondierende/r Autor/in für diese Arbeit

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem Konferenzband


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.

TitelFoundations of Intelligent Systems - 25th International Symposium, ISMIS 2020, Proceedings
Redakteure/-innenDenis Helic, Martin Stettinger, Alexander Felfernig, Gerhard Leitner, Zbigniew W. Ras
Herausgeber (Verlag)Springer Science and Business Media Deutschland GmbH
ISBN (Print)9783030594909
PublikationsstatusVeröffentlicht - 1 Jan 2020
Veranstaltung25th International Symposium on Methodologies for Intelligent Systems - TU Graz, Virtuell, Österreich
Dauer: 23 Sep 202025 Sep 2020


NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band12117 LNAI
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349


Konferenz25th International Symposium on Methodologies for Intelligent Systems
KurztitelISMIS 2020

ASJC Scopus subject areas

  • !!Theoretical Computer Science
  • !!Computer Science(all)

Dieses zitieren