MUS Extraction Using Clausal Proofs

DOI10.1007/978-3-319-09284-3_5zbMath1423.68436OpenAlexW203799144MaRDI QIDQ3192054

Marijn J. H. Heule, Anton Belov, João P. Marques-Silva

Publication date: 26 September 2014

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-09284-3_5

Mathematics Subject Classification ID

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

Related Items (4)

Counting minimal unsatisfiable subsets ⋮ Speeding up MUS Extraction with Preprocessing and Chunking ⋮ SAT-Based Horn Least Upper Bounds ⋮ Accelerating predicate abstraction by minimum unsatisfiable cores extraction

This page was built for publication: MUS Extraction Using Clausal Proofs