التفاصيل البيبلوغرافية
العنوان: |
A Parallelized Variant of Junker’s QUICKXPLAIN Algorithm |
المؤلفون: |
Vidal Silva, Cristian, Felfernig, Alexander, Galindo Duarte, José Ángel, Atas, Müslüm, Benavides Cuevas, David Felipe |
المساهمون: |
Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos, Ministerio de Economía y Competitividad (MINECO). España, Ministerio de Economia, Industria y Competitividad (MINECO). España |
بيانات النشر: |
Springer |
سنة النشر: |
2020 |
المجموعة: |
idUS - Deposito de Investigación Universidad de Sevilla |
الوصف: |
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. ; Ministerio de Economía y Competitividad RTI2018-101204-B-C22 ; Ministerio de Economía, Industria y Competitividad TIN2017-90644-REDT |
نوع الوثيقة: |
conference object |
اللغة: |
English |
Relation: |
ISMIS 2020: 25th International Symposium on Methodologies for Intelligent Systems (2020), p 457-468; RTI2018-101204-B-C22; TIN2017-90644-REDT; https://link.springer.com/chapter/10.1007%2F978-3-030-59491-6_44; Cham, Switzerland; https://idus.us.es/handle//11441/102461 |
الاتاحة: |
https://idus.us.es/handle//11441/102461 |
Rights: |
Attribution-NonCommercial-NoDerivatives 4.0 Internacional ; http://creativecommons.org/licenses/by-nc-nd/4.0/ ; info:eu-repo/semantics/openAccess |
رقم الانضمام: |
edsbas.371E1229 |
قاعدة البيانات: |
BASE |