Speeding up MUS extraction with preprocessing and chunking

DOI10.1007/978-3-319-24318-4_3MaRDI QIDQ3453206zbMATH OpenOpenAlexFDO

Authors Valeriy Balabanov, Alexander Ivrii

Publication date 20 November 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Formula preprocessing in MUS extraction
• Towards efficient MUS extraction
• On improving MUS extraction algorithms
• MUSer2: an efficient MUS extractor
• MUS Extraction Using Clausal Proofs

Cites work

• A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Factoring Out Assumptions to Speed Up MUS Extraction
• Faster Extraction of High-Level Minimal Unsatisfiable Cores
• Formula preprocessing in MUS extraction
• MUS Extraction Using Clausal Proofs
• MUSer2: an efficient MUS extractor
• On efficient computation of variable MUSes
• On improving MUS extraction algorithms
• SAT-based preprocessing for MaxSAT
• Theory and Applications of Satisfiability Testing

Cited in

(4)

• Formula preprocessing in MUS extraction
• Parallel MUS extraction
• Factoring Out Assumptions to Speed Up MUS Extraction
• Rotation based MSS/MCS enumeration

Describes a project that uses

Uses Software

• MiniSat
• MUSer2

This page was built for publication: Speeding up MUS extraction with preprocessing and chunking

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