A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10601-008-9058-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966998067 / rank | |||
Normal rank | |||
Revision as of 01:58, 20 March 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
