Finding all minimal covers of a set using implicit enumeration:

Abstract: "In diagnostic reasoning, an association exists between hypotheses and their observable consequences in a knowledge base. Now a diagnosis of a set of observations consists of a set of hypotheses, such that the union of their associated sets of consequences minimally covers this set of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Spee, J. W. (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Amsterdam 1990
Schriftenreihe:Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS 90,7
Schlagworte:
Online-Zugang:Volltext
Zusammenfassung:Abstract: "In diagnostic reasoning, an association exists between hypotheses and their observable consequences in a knowledge base. Now a diagnosis of a set of observations consists of a set of hypotheses, such that the union of their associated sets of consequences minimally covers this set of observations. We describe an algorithm that finds all such minimal covers. An implicit enumeration algorithm is used, which is an adapted version of similar algorithms used for the Set Covering Problem presented in the literature. Of this algorithm a correctness proof is given. We prove completeness properties for our minimal cover problem of two search space reductions that can be found in the literature
We also introduce another reduction, which is based on a partitioning of the search space. Finally, we show two heuristics, one of which can reduce the computation time of the algorithm considerably, and we prove it to be as [sic] least as strong as one of the search space reductions.
Beschreibung:24 S.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen