Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems |
scientific article; zbMATH DE number 5633375
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems |
scientific article; zbMATH DE number 5633375 |
Statements
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (English)
0 references
16 November 2009
0 references
satisfiability
0 references
heuristics
0 references
minimal unsatisfiable subformulas (MUS)
0 references
0 references
0 references
0.9206457
0 references
0.9095314
0 references
0.9050843
0 references
0.89401037
0 references
0.89335513
0 references
0.88764715
0 references
