A hitting set tree implementation /

Prior to Raymond Reiter's article 'A Theory of Diagnosis from First Principles', approaches to structural diagnosis were oriented towards boolean and electronic systems. While these methods helped solve many real problems, a general theory of diagnosis remained undiscovered. === Reite...

Full description

Bibliographic Details
Main Author: Mahal, Dalip Singh
Format: Others
Language:en
Published: McGill University 1994
Subjects:
Online Access:http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=68210
id ndltd-LACETR-oai-collectionscanada.gc.ca-QMM.68210
record_format oai_dc
spelling ndltd-LACETR-oai-collectionscanada.gc.ca-QMM.682102014-02-13T03:44:16ZA hitting set tree implementation /Mahal, Dalip SinghComputer Science.Prior to Raymond Reiter's article 'A Theory of Diagnosis from First Principles', approaches to structural diagnosis were oriented towards boolean and electronic systems. While these methods helped solve many real problems, a general theory of diagnosis remained undiscovered.Reiter's paper presented a general theory of diagnostic reasoning based on behavior and structure. He developed an algorithm for diagnosis but did not produce an implementation.This thesis reviews the theoretical and algorithmic results of Reiter's paper, and then derives the data structures and procedures necessary to implement the theory. We motivate and develop the algorithm based on a correction to Reiter's algorithm and the discovery of other exceptions not apparent in the general theory. We conclude by noting some interesting relationships that could be the basis for further study.McGill University1994Electronic Thesis or Dissertationapplication/pdfenalephsysno: 001394152proquestno: AAIMM94468Theses scanned by UMI/ProQuest.All items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated.Master of Science (School of Computer Science.) http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=68210
collection NDLTD
language en
format Others
sources NDLTD
topic Computer Science.
spellingShingle Computer Science.
Mahal, Dalip Singh
A hitting set tree implementation /
description Prior to Raymond Reiter's article 'A Theory of Diagnosis from First Principles', approaches to structural diagnosis were oriented towards boolean and electronic systems. While these methods helped solve many real problems, a general theory of diagnosis remained undiscovered. === Reiter's paper presented a general theory of diagnostic reasoning based on behavior and structure. He developed an algorithm for diagnosis but did not produce an implementation. === This thesis reviews the theoretical and algorithmic results of Reiter's paper, and then derives the data structures and procedures necessary to implement the theory. We motivate and develop the algorithm based on a correction to Reiter's algorithm and the discovery of other exceptions not apparent in the general theory. We conclude by noting some interesting relationships that could be the basis for further study.
author Mahal, Dalip Singh
author_facet Mahal, Dalip Singh
author_sort Mahal, Dalip Singh
title A hitting set tree implementation /
title_short A hitting set tree implementation /
title_full A hitting set tree implementation /
title_fullStr A hitting set tree implementation /
title_full_unstemmed A hitting set tree implementation /
title_sort hitting set tree implementation /
publisher McGill University
publishDate 1994
url http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=68210
work_keys_str_mv AT mahaldalipsingh ahittingsettreeimplementation
AT mahaldalipsingh hittingsettreeimplementation
_version_ 1716638088700100608