Computing smallest MUSes of quantified Boolean formulas (Q2694579)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7671896
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing smallest MUSes of quantified Boolean formulas |
scientific article; zbMATH DE number 7671896 |
Statements
Computing smallest MUSes of quantified Boolean formulas (English)
0 references
4 April 2023
0 references
quantified Boolean formulas
0 references
minimum unsatisfiability
0 references
abstract argumentation
0 references
strong explanations
0 references
0 references
0.8888445
0 references
0.8888445
0 references
0.8768777
0 references
0.8706266
0 references
0.86931556
0 references
0.8601879
0 references
0.8582091
0 references
0.8571855
0 references
