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 analysismaximal satisfiable subsetsminimal unsatisfiable 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

(11)

• Timed automata relaxation for reachability
• Fast, flexible MUS enumeration
• A new approach to partial MUS enumeration
• Enumerating infeasibility: finding multiple MUSes quickly
• Timed automata robustness analysis via model checking
• Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets
• Recursive online enumeration of all minimal unsatisfiable subsets
• Computing MUS-based inconsistency measures
• Hashing-based approximate counting of minimal unsatisfiable subsets
• Rotation based MSS/MCS enumeration
• Counting 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)