Pages that link to "Item:Q5505540"
From MaRDI portal
The following pages link to Efficient Generation of Unsatisfiability Proofs and Cores in SAT (Q5505540):
Displayed 7 items.
- Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays (Q2108176) (← links)
- A logic-based Benders decomposition for microscopic railway timetable planning (Q2158004) (← links)
- A framework for certified Boolean branch-and-bound optimization (Q2429985) (← links)
- Faster Extraction of High-Level Minimal Unsatisfiable Cores (Q3007682) (← links)
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (Q3453224) (← links)
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (Q3637179) (← links)
- Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores (Q5015593) (← links)