On renamable Horn and generalized Horn functions
- 1 September 1990
- journal article
- research article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 1 (1-4) , 33-47
- https://doi.org/10.1007/bf01531069
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- HORNLOG: A graph-based interpreter for general Horn clausesThe Journal of Logic Programming, 1987
- A note on the complexity of the satisfiability of modal Horn clausesThe Journal of Logic Programming, 1987
- Some results and experiments in programming techniques for propositional logicComputers & Operations Research, 1986
- A fast algorithm for renaming a set of clauses as a horn setInformation Processing Letters, 1985
- 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
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- Linear programming is log-space hard for PInformation Processing Letters, 1979
- Renaming a Set of Clauses as a Horn SetJournal of the ACM, 1978
- Unit Refutations and Horn SetsJournal of the ACM, 1974