The computation of hitting sets: Review and new algorithms

DOI10.1016/S0020-0190(02)00506-9zbMath1173.68827OpenAlexW2008716852MaRDI QIDQ1007596

Yunfei Jiang, Li Lin

Publication date: 23 March 2009

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00506-9

zbMATH Keywords

algorithmsmodel-based diagnosishitting setBHS-treeBoolean algebraic algorithmsset cluster

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (5)

Memory-limited model-based diagnosis ⋮ Bases and dimension of vector spaces over lattices ⋮ The Minimal Hitting Set Generation Problem: Algorithms and Computation ⋮ Computational aspects of monotone dualization: a brief survey ⋮ How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms

Cites Work

• A theory of diagnosis from first principles
• A correction to the algorithm in Reiter's theory of diagnosis
• A theory of measurement in diagnosis from first principles
• Minimal approximate hitting sets and rule templates
• A variant of Reiter's hitting-set algorithm

This page was built for publication: The computation of hitting sets: Review and new algorithms