Algorithms for computing minimal equivalent subformulas (Q460638)
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: Algorithms for computing minimal equivalent subformulas |
scientific article; zbMATH DE number 6355006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for computing minimal equivalent subformulas |
scientific article; zbMATH DE number 6355006 |
Statements
Algorithms for computing minimal equivalent subformulas (English)
0 references
13 October 2014
0 references
Boolean satisfiability
0 references
redundancy
0 references
irredundant subformula
0 references
minimal unsatisfiability
0 references
0 references
0 references
0.7515705823898315
0 references
0.7392669320106506
0 references
0.7329683899879456
0 references
0.7235740423202515
0 references
