Speeding up MUS Extraction with Preprocessing and Chunking

DOI10.1007/978-3-319-24318-4_3zbMath1471.68236OpenAlexW2227210622MaRDI QIDQ3453206

Alexander Ivrii, Valeriy Balabanov

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)

Uses Software

• MiniSat
• MUSer2

Cites Work

• Algorithms for computing minimal unsatisfiable subsets of constraints
• On Efficient Computation of Variable MUSes
• SAT-Based Preprocessing for MaxSAT
• On Improving MUS Extraction Algorithms
• Faster Extraction of High-Level Minimal Unsatisfiable Cores
• MUS Extraction Using Clausal Proofs
• Theory and Applications of Satisfiability Testing
• Formula Preprocessing in MUS Extraction
• Factoring Out Assumptions to Speed Up MUS Extraction
• A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
• Unnamed Item

This page was built for publication: Speeding up MUS Extraction with Preprocessing and Chunking