Parallel model-based diagnosis on multi-core computers
TL;DR: This work proposes and systematically evaluates parallelization schemes for Reiter's hitting set algorithm for finding all or a few leading minimal diagnoses using two different con flict detection techniques and tests the effects of parallelizing "direct encodings" of the diagnosis problem in a constraint solver.
read more
Abstract: Model-Based Diagnosis (MBD) is a principled and domain-independent way of analyzing why a system under examination is not behaving as expected. Given an abstract description (model) of the system's components and their behavior when functioning normally, MBD techniques rely on observations about the actual system behavior to reason about possible causes when there are discrepancies between the expected and observed behavior. Due to its generality, MBD has been successfully applied in a variety of application domains over the last decades.
In many application domains of MBD, testing different hypotheses about the reasons for a failure can be computationally costly, e.g., because complex simulations of the system behavior have to be performed. In this work, we therefore propose different schemes of parallelizing the diagnostic reasoning process in order to better exploit the capabilities of modern multi-core computers. We propose and systematically evaluate parallelization schemes for Reiter's hitting set algorithm for finding all or a few leading minimal diagnoses using two different con flict detection techniques. Furthermore, we perform initial experiments for a basic depth-first search strategy to assess the potential of parallelization when searching for one single diagnosis. Finally, we test the effects of parallelizing "direct encodings" of the diagnosis problem in a constraint solver.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Detecting hidden errors in an ontology using contextual knowledge
TL;DR: Experiments show that adding general ontologies like DBpedia as contextual knowledge in the ontology debugging process results in detecting contradictions in ontologies that are coherent.
14
On the Usefulness of Different Expert Question Types for Fault Localization in Ontologies
Patrick Rodler,Michael Eichholzer +1 more
- 09 Jul 2019
TL;DR: This work proposes a method for semi-automatic fault localization in ontologies that involves a human expert providing answers to system-generated questions about the intended (correct) ontology in order to reduce the possible fault locations.
12
FASTDIAGP: An Algorithm for Parallelized Direct Diagnosis
TL;DR: In this paper , the authors propose a parallelization mechanism that anticipates and pre-calculates consistency checks requested by FastDiag, which helps to provide consistency checks with fast answers and boosts the algorithm's runtime performance.
Memory-limited model-based diagnosis
TL;DR: In this article , the authors propose two diagnostic search algorithms, called RBF-HS (Recursive Best-First Hitting Set Search) and HBFHS (Hybrid Best First Hitting Sets Search), which can enumerate an arbitrary predefined finite number of fault explanations in best-first order within linear space bounds.
10
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
- 06 Dec 2004
TL;DR: This paper presents the implementation of MapReduce, a programming model and an associated implementation for processing and generating large data sets that runs on a large cluster of commodity machines and is highly scalable.
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
TL;DR: This presentation explains how the underlying runtime system automatically parallelizes the computation across large-scale clusters of machines, handles machine failures, and schedules inter-machine communication to make efficient use of the network and disks.
The Description Logic Handbook: Theory, Implementation and Applications
Franz Baader,Diego Calvanese,Deborah L. McGuinness,Daniele Nardi,Peter F. Patel-Schneider +4 more
- 01 Jan 2003
TL;DR: The Description Logic Handbook as mentioned in this paper provides a thorough account of the subject, covering all aspects of research in this field, namely: theory, implementation, and applications, and can also be used for self-study or as a reference for knowledge representation and artificial intelligence courses.
6.3K