Linear-time algorithms for testing the satisfiability of propositional horn formulae (Q3723723)
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 3954300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear-time algorithms for testing the satisfiability of propositional horn formulae |
scientific article; zbMATH DE number 3954300 |
Statements
Linear-time algorithms for testing the satisfiability of propositional horn formulae (English)
0 references
1984
0 references
data flow problem
0 references
pebbling
0 references
context-free grammar
0 references
graph traversal
0 references
attribute grammar
0 references
parallel processors
0 references
0.883956789970398
0 references
0.8773417472839355
0 references
0.8559192419052124
0 references
0.8431435823440552
0 references
0.8330428600311279
0 references
