A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MiniSat / rank | |||
Normal rank | |||
Revision as of 14:14, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas |
scientific article |
Statements
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (English)
0 references
16 November 2009
0 references
Boolean satisfiability
0 references
infeasibility
0 references
MUS
0 references
SMUS
0 references
