The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic
- 31 December 1983
- journal article
- Published by Elsevier in Information and Control
- Vol. 59 (1-3) , 1-12
- https://doi.org/10.1016/s0019-9958(83)80027-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Horn clause computabilityBIT Numerical Mathematics, 1977
- On the complexity of regular resolution and the Davis-Putnam procedureTheoretical Computer Science, 1977
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- Resolution Strategies as Decision ProceduresJournal of the ACM, 1976
- Unit Refutations and Horn SetsJournal of the ACM, 1974