Rotation based MSS/MCS enumeration

DOI10.29007/8BTBMaRDI QIDQ7024211zbMATH OpenFDO

Authors Jaroslav Bendík, I. Černá

Publication date 20 February 2025

Full work available at URL https://doi.org/10.29007/8BTB

zbMATH Keywords

MCSinfeasibility analysisdiagnosisminimal correction subsetsMSSmaximal satisfiable subsets

Mathematics Subject Classification ID

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

Cites work

• A theory of diagnosis from first principles
• Accelerated deletion-based extraction of minimal unsatisfiable cores
• Diagnosing multiple faults
• Ein Satz über Untermengen einer endlichen Menge.
• Enumerating infeasibility: finding multiple MUSes quickly
• Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets
• Fast, flexible MUS enumeration
• Finding a collection of MUSes incrementally
• Formula preprocessing in MUS extraction
• Improving MCS enumeration via caching
• MUS Extraction Using Clausal Proofs
• MUSer2: an efficient MUS extractor
• On computing the union of MUSes
• Online Enumeration of All Minimal Inductive Validity Cores
• Recursive online enumeration of all minimal unsatisfiable subsets
• Speeding up MUS extraction with preprocessing and chunking
• Theory and Applications of Satisfiability Testing
• Tunable online MUS/MSS enumeration

Cited in

(1)

• Explanations of unsatisfiability beyond minimal subsets

This page was built for publication: Rotation based MSS/MCS enumeration

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