Pages that link to "Item:Q1037642"
From MaRDI portal
The following pages link to A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642):
Displaying 12 items.
- On computing minimal independent support and its applications to sampling and counting (Q265701) (← links)
- Quantified maximum satisfiability (Q272016) (← links)
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases (Q459042) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Counting minimal unsatisfiable subsets (Q832272) (← links)
- Accelerating predicate abstraction by minimum unsatisfiable cores extraction (Q1980482) (← links)
- SAT-based rigorous explanations for decision lists (Q2118305) (← links)
- Computing smallest MUSes of quantified Boolean formulas (Q2694579) (← links)
- Faster Extraction of High-Level Minimal Unsatisfiable Cores (Q3007682) (← links)
- SAT-Based Formula Simplification (Q3453233) (← links)
- Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores (Q5015593) (← links)
- (Q5101345) (← links)
