Tunable online MUS/MSS enumeration

DOI10.4230/LIPICS.FSTTCS.2016.50MaRDI QIDQ4636600zbMATH OpenFDO

Authors Jaroslav Bendík, Nikola Beneš, J. Barnat, I. Černá

Publication date 19 April 2018

Full work available at URL https://arxiv.org/abs/1606.03289

zbMATH Keywords

infeasibility analysisminimal unsatisfiable subsetsmaximal satisfiable subsetsunsatisfiability analysis

Mathematics Subject Classification ID

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

Recommendations

• Recursive online enumeration of all minimal unsatisfiable subsets
• Fast, flexible MUS enumeration
• Enumerating infeasibility: finding multiple MUSes quickly
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets

Cited in

(10)

• Fast, flexible MUS enumeration
• Counting minimal unsatisfiable subsets
• Computing MUS-based inconsistency measures
• Enumerating infeasibility: finding multiple MUSes quickly
• Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets
• A new approach to partial MUS enumeration
• Timed automata relaxation for reachability
• scientific article; zbMATH DE number 7577576 (Why is no real title available?)
• Hashing-based approximate counting of minimal unsatisfiable subsets
• Recursive online enumeration of all minimal unsatisfiable subsets

This page was built for publication: Tunable online MUS/MSS enumeration

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