Polynomial-time inference of all valid implications for Horn and related formulae
- 1 September 1990
- journal article
- research article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 1 (1-4) , 21-32
- https://doi.org/10.1007/bf01531068
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- LTUR: a simplified linear-time unit resolution algorithm for horn formulae and computer implementationInformation Processing Letters, 1988
- A quantitative approach to logical inferenceDecision Support Systems, 1988
- Unification as a complexity measure for logic programmingThe Journal of Logic Programming, 1987
- 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
- Renaming a Set of Clauses as a Horn SetJournal of the ACM, 1978
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- A cascade algorithm for the logical closure of a set of binary relationsInformation Processing Letters, 1976
- On Cores and Prime Implicants of Truth FunctionsThe American Mathematical Monthly, 1959