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 this page instead for the normal view: Linear-time algorithms for testing the satisfiability of propositional horn formulae |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time algorithms for testing the satisfiability of propositional horn formulae |
scientific article |
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
