A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642): Difference between revisions
From MaRDI portal
Latest revision as of 04:02, 2 July 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
0 references