Canonical sets of horn clauses
Author:
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 267-278
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A rationale for conditional equational programmingTheoretical Computer Science, 1990
- Simplifying conditional term rewriting systems : Unification, termination and confluenceJournal of Symbolic Computation, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- On the descriptive power of term rewriting systemsJournal of Symbolic Computation, 1986
- A new method for establishing refutational completeness in theorem proving1986
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- A complete proof of correctness of the Knuth-Bendix completion algorithmJournal of Computer and System Sciences, 1981
- Equations and Rewrite Rules: A Survey1980
- Proving termination with multiset orderingsCommunications of the ACM, 1979