A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
Nachum Dershowitz, Ziyad Hanna, Alexander Nadel
Abstract
We propose a new algorithm for minimal unsatisfiable core extraction, based on a deeper exploration of resolution-refutation properties. We provide experimental results on formal verification benchmarks confirming that our algorithm finds smaller cores than suboptimal algorithms; and that it runs faster than those algorithms that guarantee minimality of the core.
Create a lesson
Related papers
Challenging Benchmarks for Diagrammatic Equivalence of Circuits in TPTP and SMT-LIB
Julie Cailler, Noé Delorme, Sophie Tourret
Dynamic Polyhedral Logic
Nick Bezhanishvili, Laura Bussi, Vincenzo Ciancia et al.
Exact SAT and Constraint Programming for Job Shop Scheduling with Time-Varying Peak Power Constraints
Huy Tuan Nguyen, Duc Trung Kim Nguyen, Khanh To Van
Cycle time minimization for the simple assembly line balancing problem under peak power constraints
Bao Gia Hoang, Tuyen Van Kieu, Khanh Van To
Design and Empirical Characterization of a Hardware-Realized Turing Machine with Automated Card-Based Programming
Agrima Regmi, Jenish Pant, Pratistha Sapkota et al.
Comparison Invariants for Verifying Control Invariance
Promit Panja, André Platzer