A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5633630
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas |
scientific article; zbMATH DE number 5633630 |
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
0 references
0 references
0.9186183214187622
0 references
0.8398414254188538
0 references
0.822430431842804
0 references
0.8182911276817322
0 references
