FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets

DOI10.1007/978-3-319-99957-9_7MaRDI QIDQ6108818zbMATH OpenOpenAlexFDO

Authors Jie Luo

Publication date 30 June 2023

Published in Artificial Intelligence and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99957-9_7

zbMATH Keywords

heuristic algorithmminimal unsatisfiable subsetsoptimization strategySAT

Mathematics Subject Classification ID

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

Recommendations

• On improving MUS extraction algorithms
• Towards efficient MUS extraction
• MUSer2: an efficient MUS extractor
• Theory and Applications of Satisfiability Testing
• Algorithms for computing minimal unsatisfiable subsets of constraints

Cites work

• \textbf{R}-calculus without the cut rule
• A theory of measurement in diagnosis from first principles
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Fast, flexible MUS enumeration
• Faster Extraction of High-Level Minimal Unsatisfiable Cores
• Finding a collection of MUSes incrementally
• The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
• Theory and Applications of Satisfiability Testing
• Towards efficient MUS extraction

Cited in

(5)

• Accelerating predicate abstraction by minimum unsatisfiable cores extraction
• Semantic relevance
• On computing the union of MUSes
• Computing minimally unsatisfiable subformulas: state of the art and future directions
• Theory and Applications of Satisfiability Testing

This page was built for publication: FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets

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