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

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review


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 languageEnglish
Title of host publicationFoundations of Intelligent Systems - 25th International Symposium, ISMIS 2020, Proceedings
EditorsDenis Helic, Martin Stettinger, Alexander Felfernig, Gerhard Leitner, Zbigniew W. Ras
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages12
ISBN (Print)9783030594909
Publication statusPublished - 1 Jan 2020
Event25th International Symposium on Methodologies for Intelligent Systems - TU Graz, Virtuell, Austria
Duration: 23 Sept 202025 Sept 2020

Publication series

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


Conference25th International Symposium on Methodologies for Intelligent Systems
Abbreviated titleISMIS 2020

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this