An O(n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentences
- 15 January 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 24 (1) , 67-69
- https://doi.org/10.1016/0020-0190(87)90200-6
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logicInformation and Control, 1983