Ponencia
A Parallelized Variant of Junker’s QUICKXPLAIN Algorithm
Autor/es | Vidal Silva, Cristian
Felfernig, Alexander Galindo Duarte, José Ángel Atas, Müslüm Benavides Cuevas, David Felipe |
Departamento | Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos |
Fecha de publicación | 2020 |
Fecha de depósito | 2020-11-04 |
Publicado en |
|
ISBN/ISSN | 978-3-030-59490-9 0302-9743 |
Resumen | 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 ... 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. |
Agencias financiadoras | Ministerio de Economía y Competitividad (MINECO). España Ministerio de Economia, Industria y Competitividad (MINECO). España |
Identificador del proyecto | RTI2018-101204-B-C22
TIN2017-90644-REDT |
Cita | Vidal Silva, C., Felfernig, A., Galindo Duarte, J.Á., Atas, M. y Benavides Cuevas, D.F. (2020). A Parallelized Variant of Junker’s QUICKXPLAIN Algorithm. En ISMIS 2020: 25th International Symposium on Methodologies for Intelligent Systems (457-468), Graz, Austria: Springer. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
A Parallelized Variant of Junker's ... | 260.4Kb | [PDF] | Ver/ | |