Finding a collection of MUSes incrementally

DOI10.1007/978-3-319-33954-2_3MaRDI QIDQ2815093zbMATH OpenOpenAlexFDO

Authors Fahiem Bacchus, George Katsirelos

Publication date 27 June 2016

Published in Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-33954-2_3

Mathematics Subject Classification ID

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

Recommendations

• Fast, flexible MUS enumeration
• Enumerating infeasibility: finding multiple MUSes quickly
• Finding Guaranteed MUSes Fast
• On computing preferred MUSes and MCSes
• MUSer2: an efficient MUS extractor

Cited in

(13)

• Accelerating predicate abstraction by minimum unsatisfiable cores extraction
• Debugging unsatisfiable constraint models
• Timed automata relaxation for reachability
• Local-search extraction of mUSes
• On computing preferred MUSes and MCSes
• Finding Guaranteed MUSes Fast
• Timed automata robustness analysis via model checking
• FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets
• Efficiently explaining CSPs with unsatisfiable subset optimization
• Hashing-based approximate counting of minimal unsatisfiable subsets
• Explanations of unsatisfiability beyond minimal subsets
• Rotation based MSS/MCS enumeration
• Counting minimal unsatisfiable subsets

This page was built for publication: Finding a collection of MUSes incrementally

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