A fast algorithm for renaming a set of clauses as a horn set
- 18 November 1985
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 21 (5) , 269-272
- https://doi.org/10.1016/0020-0190(85)90096-1
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Horn clauses and database dependenciesJournal of the ACM, 1982
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- Renaming a Set of Clauses as a Horn SetJournal of the ACM, 1978