Efficient Generation of Unsatisfiability Proofs and Cores in SAT
From MaRDI portal
Publication:5505540
DOI10.1007/978-3-540-89439-1_2zbMath1182.68215OpenAlexW1568765955MaRDI QIDQ5505540
Roberto Asín, Albert Oliveras, Robert Nieuwenhuis, Enric Rodríguez-Carbonell
Publication date: 27 January 2009
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_2
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API ⋮ A logic-based Benders decomposition for microscopic railway timetable planning ⋮ A framework for certified Boolean branch-and-bound optimization ⋮ Faster Extraction of High-Level Minimal Unsatisfiable Cores ⋮ Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates ⋮ Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores ⋮ Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays
Uses Software
This page was built for publication: Efficient Generation of Unsatisfiability Proofs and Cores in SAT
