Computing minimally unsatisfiable subformulas: state of the art and future directions (Q4583686)
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: Computing minimally unsatisfiable subformulas: state of the art and future directions |
scientific article; zbMATH DE number 6930338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing minimally unsatisfiable subformulas: state of the art and future directions |
scientific article; zbMATH DE number 6930338 |
Statements
3 September 2018
0 references
Boolean satisfiability
0 references
minimally unsatisfiable subformulas
0 references
unsatisfiability proofs
0 references
extensions of Boolean satisfiability
0 references
0.7999690771102905
0 references
0.7941898703575134
0 references
0.7689497470855713
0 references
0.744435727596283
0 references
0.7430747747421265
0 references
