A linear algorithm for renaming a set of clauses as a Horn set (Q1318709)
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: A linear algorithm for renaming a set of clauses as a Horn set |
scientific article; zbMATH DE number 540861
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear algorithm for renaming a set of clauses as a Horn set |
scientific article; zbMATH DE number 540861 |
Statements
A linear algorithm for renaming a set of clauses as a Horn set (English)
0 references
5 April 1994
0 references
renaming algorithm
0 references
Horn set
0 references
linear complexity
0 references
0.9233116
0 references
0 references
0.8581948
0 references
0 references
0.83641183
0 references
0.8346028
0 references
