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...
Gespeichert in:
1. Verfasser: | |
---|---|
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. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008974446 | ||
003 | DE-604 | ||
005 | 20220207 | ||
007 | t | ||
008 | 940206s1990 |||| 00||| eng d | ||
035 | |a (OCoLC)23933122 | ||
035 | |a (DE-599)BVBBV008974446 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T |a DE-91G | ||
100 | 1 | |a Spee, J. W. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Finding all minimal covers of a set using implicit enumeration |c J. W. Spee |
264 | 1 | |a Amsterdam |c 1990 | |
300 | |a 24 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |v 90,7 | |
520 | 3 | |a 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 | |
520 | 3 | |a 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. | |
650 | 4 | |a Künstliche Intelligenz | |
650 | 4 | |a Artificial intelligence | |
650 | 4 | |a Inference | |
650 | 4 | |a Reasoning | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |
830 | 0 | |a Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |v 90,7 |w (DE-604)BV008928356 |9 90,7 | |
856 | 4 | 1 | |u https://ir.cwi.nl/pub/5760 |x Verlag |z kostenfrei |3 Volltext |
912 | |a ebook | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-005926020 |
Datensatz im Suchindex
_version_ | 1804123312479010816 |
---|---|
any_adam_object | |
author | Spee, J. W. |
author_facet | Spee, J. W. |
author_role | aut |
author_sort | Spee, J. W. |
author_variant | j w s jw jws |
building | Verbundindex |
bvnumber | BV008974446 |
collection | ebook |
ctrlnum | (OCoLC)23933122 (DE-599)BVBBV008974446 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02212nam a2200373 cb4500</leader><controlfield tag="001">BV008974446</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220207 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23933122</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008974446</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Spee, J. W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding all minimal covers of a set using implicit enumeration</subfield><subfield code="c">J. W. Spee</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS</subfield><subfield code="v">90,7</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Inference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reasoning</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS</subfield><subfield code="v">90,7</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">90,7</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://ir.cwi.nl/pub/5760</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005926020</subfield></datafield></record></collection> |
id | DE-604.BV008974446 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:27:46Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005926020 |
oclc_num | 23933122 |
open_access_boolean | 1 |
owner | DE-29T DE-91G DE-BY-TUM |
owner_facet | DE-29T DE-91G DE-BY-TUM |
physical | 24 S. |
psigel | ebook |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
record_format | marc |
series | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |
series2 | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |
spelling | Spee, J. W. Verfasser aut Finding all minimal covers of a set using implicit enumeration J. W. Spee Amsterdam 1990 24 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS 90,7 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. Künstliche Intelligenz Artificial intelligence Inference Reasoning Erscheint auch als Online-Ausgabe Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS 90,7 (DE-604)BV008928356 90,7 https://ir.cwi.nl/pub/5760 Verlag kostenfrei Volltext |
spellingShingle | Spee, J. W. Finding all minimal covers of a set using implicit enumeration Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS Künstliche Intelligenz Artificial intelligence Inference Reasoning |
title | Finding all minimal covers of a set using implicit enumeration |
title_auth | Finding all minimal covers of a set using implicit enumeration |
title_exact_search | Finding all minimal covers of a set using implicit enumeration |
title_full | Finding all minimal covers of a set using implicit enumeration J. W. Spee |
title_fullStr | Finding all minimal covers of a set using implicit enumeration J. W. Spee |
title_full_unstemmed | Finding all minimal covers of a set using implicit enumeration J. W. Spee |
title_short | Finding all minimal covers of a set using implicit enumeration |
title_sort | finding all minimal covers of a set using implicit enumeration |
topic | Künstliche Intelligenz Artificial intelligence Inference Reasoning |
topic_facet | Künstliche Intelligenz Artificial intelligence Inference Reasoning |
url | https://ir.cwi.nl/pub/5760 |
volume_link | (DE-604)BV008928356 |
work_keys_str_mv | AT speejw findingallminimalcoversofasetusingimplicitenumeration |