A theory of diagnosis from first principles
Artificial Intelligence
A correction to the algorithm in Reiter's theory of diagnosis
Artificial Intelligence
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
A variant of Reiter's hitting-set algorithm
Information Processing Letters
Generating Diagnoses from Conflict Sets
Proceedings of the Eleventh International Florida Artificial Intelligence Research Society Conference
The computation of hitting sets: review and new algorithms
Information Processing Letters
| Hi-index | 0.00 |
Many techniques in model-based diagnosis and other research fields find the hitting sets of a group of sets. Existing techniques apply to sets of finite elements only. This paper addresses the computation of the hitting sets of a group of sets whose elements are convex or non-convex, bounded or unbounded continuous regions. We assume the conflict sets are known and we present a novel procedure, the Continuous Hitting Set algorithm (CHS) for transforming conflict sets of continuous elements into minimal hitting sets.