A variant of Reiter's hitting-set algorithm

DOI10.1016/S0020-0190(00)00166-6MaRDI QIDQ1603435zbMATH OpenWikidataFDO

Authors Franz Wotawa

Publication date 14 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

algorithmsmodel-based diagnosishitting-set algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• The computation of hitting sets: Review and new algorithms
• Parameterized algorithmics for \(d\)-HITTING SET
• A new method of computing hitting sets applied to diagnosis generation
• Algorithms for implicit hitting set problems
• Computing minimal hitting sets with a genetic algorithm

Cites work

• A correction to the algorithm in Reiter's theory of diagnosis
• A theory of diagnosis from first principles
• Diagnosing multiple faults
• Diagnosing tree-structured systems
• LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation

Cited in

(8)

• An improved algorithm for the red-blue hitting set problem with the consecutive ones property
• Memory-limited model-based diagnosis
• Bases and dimension of vector spaces over lattices
• Fault tolerance evaluation based on the lattice of system configurations
• The computation of hitting sets: Review and new algorithms
• Computational aspects of monotone dualization: a brief survey
• The minimal hitting set generation problem: algorithms and computation
• Merge, explain, iterate: a combination of MHS and MXP in an ABox abduction solver

Describes a project that uses

Uses Software

• Ltur

This page was built for publication: A variant of Reiter's hitting-set algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603435)