A variant of Reiter's hitting-set algorithm

In this paper we introduce a variant of Reiter's hitting-set algorithm. This variant produces a hitting-set tree instead of an acyclic directed graph. As an advantage some subset checks necessary for reducing the graph during search can be avoided.

[1]  Markus Stumptner,et al.  Diagnosing tree-structured systems , 2001, Artif. Intell..

[2]  J. Dekleer.  An assumption-based TMS , 1986 .

[3]  Rina Dechter,et al.  Diagnosing Tree-Decomposable Circuits , 1995, IJCAI.

[4]  J. Riedesel.  Diagnosing Multiple Faults in SSM/PMAD , 1990, Proceedings of the 25th Intersociety Energy Conversion Engineering Conference.

[5]  Michel Minoux,et al.  LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation , 1988, Inf. Process. Lett..

[6]  Russell Greiner,et al.  A Correction to the Algorithm in Reiter's Theory of Diagnosis , 1989, Artif. Intell..

[7]  Raymond Reiter.  A theory of diagnosis from first principles , 1986 .

[8]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[9]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[10]  Kenneth D. Forbus,et al.  Focusing the ATMS , 1988, AAAI.

[11]  Johan de Kleer.  Focusing on Probable Diagnoses , 1991, AAAI.

[12]  P. Pandurang Nayak,et al.  A Model-Based Approach to Reactive Self-Configuring Systems , 1996, AAAI/IAAI, Vol. 2.

[13]  Adam Farquhar,et al.  Putting the Problem Solver Back in the Driver's Seat: Contextual Control of the AMTS , 1990, Truth Maintenance Systems.

[14]  Peter Fröhlich,et al.  A Static Model-Based Engine for Model-Based Reasoning , 1997, IJCAI.

[15]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[16]  Brian C. Williams,et al.  Diagnosing Multiple Faults , 1987, Artif. Intell..