✦ LIBER ✦
An O(n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentences
✍ Scribed by V. Arvind; S. Biswas
- Book ID
- 113163125
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 217 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.