Linear-time algorithms for testing the satisfiability of propositional horn formulae (Q3723723): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55966922 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0743-1066(84)90014-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011992362 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:05, 20 March 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
