Detecting embedded Horn structure in propositional logic
Authors:
- V. ChandruVCV. Chandru
- J.N. HookerJHJ.N. Hooker
- 1 May 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 42 (2) , 109-111
Abstract
No abstract availableKeywords
All Related Versions
This publication has 3 references indexed in Scilit:
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Recognizing disguised NR(1) instances of the satisfiability problemJournal of Algorithms, 1980