LearnDiag: A direct diagnosis algorithm based on learned heuristics

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Configuration systems must be able to deal with inconsistencies which can occur in different contexts. Especially in interactive settings, where users specify requirements and a constraint solver has to identify solutions, inconsistencies may more often arise. Therefore, diagnosis algorithms are required to find solutions for these unsolvable problems. Runtime efficiency of diagnosis is especially crucial in real-time scenarios such as production scheduling, robot control, and communication networks. For such scenarios, diagnosis algorithms should determine solutions within predefined time limits. To provide runtime performance, direct or sequential diagnosis algorithms find diagnoses without the need of calculating conflicts. In this paper, we propose a new direct diagnosis algorithm LearnDiag which uses learned heuristics. It applies supervised learning to calculate constraint ordering heuristics for the diagnostic search. Our evaluations show that LearnDiag improves runtime performance of direct diagnosis besides improving the diagnosis quality in terms of minimality and precision.

Cite

CITATION STYLE

APA

Polat Erdeniz, S., Felfernig, A., & Atas, M. (2018). LearnDiag: A direct diagnosis algorithm based on learned heuristics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11117 LNAI, pp. 190–197). Springer Verlag. https://doi.org/10.1007/978-3-030-00111-7_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free