Efficient CNF simplification based on binary implication graphs (Q3007684)
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 5908747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient CNF simplification based on binary implication graphs |
scientific article; zbMATH DE number 5908747 |
Statements
Efficient CNF Simplification Based on Binary Implication Graphs (English)
0 references
17 June 2011
0 references
0 references
0.8302972912788391
0 references
0.8147175312042236
0 references
0.7838549613952637
0 references
0.7692971229553223
0 references
0.7654635906219482
0 references
