The computation of hitting sets: Review and new algorithms
From MaRDI portal
Recommendations
- A new method of computing hitting sets applied to diagnosis generation
- A method of combining SE-tree to compute all minimal hitting sets
- A variant of Reiter's hitting-set algorithm
- The minimal hitting set generation problem: algorithms and computation
- Computing minimal hitting sets with a genetic algorithm
Cites work
Cited in
(12)- Memory-limited model-based diagnosis
- A new method of computing hitting sets applied to diagnosis generation
- Bases and dimension of vector spaces over lattices
- A method of combining SE-tree to compute all minimal hitting sets
- Computational aspects of monotone dualization: a brief survey
- scientific article; zbMATH DE number 2114142 (Why is no real title available?)
- Hitting sets for multilinear read-once algebraic branching programs, in any order
- How to apply SAT-solving for the equivalence test of monotone normal forms
- A variant of Reiter's hitting-set algorithm
- Computing minimal hitting sets with a genetic algorithm
- Optimizations for the Boolean approach to computing minimal hitting sets
- The minimal hitting set generation problem: algorithms and computation
This page was built for publication: The computation of hitting sets: Review and new algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007596)