Linear-time algorithms for testing the satisfiability of propositional horn formulae (Q3723723): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q55966922, #quickstatements; #temporary_batch_1706335038149 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55966922 / rank | |||
Normal rank | |||
Revision as of 07:13, 27 January 2024
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
