Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373)
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: Approximating minimal unsatisfiable subformulae by means of adaptive core search |
scientific article; zbMATH DE number 1981502
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating minimal unsatisfiable subformulae by means of adaptive core search |
scientific article; zbMATH DE number 1981502 |
Statements
Approximating minimal unsatisfiable subformulae by means of adaptive core search (English)
0 references
15 September 2003
0 references
Consistency restoring
0 references
Enumeration
0 references
(Un)Satisfiability
0 references
0 references
0 references
0 references
0.9018133
0 references
0.89401037
0 references
0.8923466
0 references
0.88448083
0 references
0.8805711
0 references
0.8768095
0 references
0.8731401
0 references
