Algorithms for testing the satisfiability of propositional formulae (Q3826123): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0743-1066(89)90009-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084642537 / rank | |||
Normal rank | |||
Latest revision as of 01:01, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for testing the satisfiability of propositional formulae |
scientific article |
Statements
Algorithms for testing the satisfiability of propositional formulae (English)
0 references
1989
0 references
efficiency
0 references
satisfiability for Horn clauses algorithm
0 references
