Optimizations for the Boolean approach to computing minimal hitting sets

MaRDI QIDQ3455597zbMATH OpenFDO

Authors Ingo Pill, Thomas Quaritsch

Publication date 11 December 2015

Full work available at URL http://ebooks.iospress.nl/volumearticle/7047

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Computing minimal hitting sets with a genetic algorithm
• The computation of hitting sets: Review and new algorithms
• The minimal hitting set generation problem: algorithms and computation
• A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph
• Minimal approximate hitting sets and rule templates

Cited in

(6)

• Memory-limited model-based diagnosis
• Efficiently computing minimal sets of critical pairs
• The minimal hitting set generation problem: algorithms and computation
• Computing minimal hitting sets with a genetic algorithm
• Sequential model-based diagnosis by systematic search
• Compression with wildcards: all exact or all minimal hitting sets

This page was built for publication: Optimizations for the Boolean approach to computing minimal hitting sets

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