Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation
The aim of Knuth-Bendix completion is to transform an input specification into another, equivalent specification such that a given set of inference rules becomes complete for the transformed specification. In the classical case, the specifications consist of unconditional equations, and the inference rule is term rewriting.
Here we investigate Knuth-Bendix completion methods for full Horn clause specifications and introduce a class of inference systems defined by an abstract concept of restrictions imposed on linear resolution and paramodulation.
The usual technical ingredients of Knuth-Bendix completion methods, e.g. critical pairs, a corresponding critical pair lemma, simplification and elimination methods and critical pair criteria are generalized with respect to the concept of restrictions. We show that for any concrete restriction, our completion methods produce specifications for which linear resolution and paramodulation under the given restriction are refutationally complete. Conventional completion methods are instances of completion with respect to restrictions.
Unable to display preview. Download preview PDF.
- [Bac87]L. Bachmair. Proof Methods for Equational Theories. PhD thesis, University of Illinois at Urbana-Champaign, USA, 1987.Google Scholar
- [BDH86]L. Bachmair, N. Dershowitz, and J. Hsiang. Orderings for equational proofs. In Proc. of the 1st IEEE Symposium on Logic in Computer Science, Boston, MA, pp. 346–357, 1986.Google Scholar
- [Ber90]H. Bertling. Knuth-Bendix Completion of Horn Clause Programs for Restricted Linear Resolution and Paramodulation. PhD thesis, FB Informatik, Universität Dortmund, 1990.Google Scholar
- [BG89]H. Bertling and H. Ganzinger. Completion-Time Optimization of Rewrite-Time Goal Solving. In Proc. of the 3rd International Conference on Rewriting Techniques and Applications, Chapel Hill, LNCS 355, pp. 45–58, Berlin-Heidelberg-New York, April 1989. Springer-Verlag.Google Scholar
- [DJ89]N. Dershowitz and J.P. Jounannaud. Rewrite Systems. In Handbook of Theoretical Computer Science, Volume B, Chapter 15. North-Holland, 1989.Google Scholar
- [DM79]N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Commun. ACM 22:465–476, 1979.Google Scholar
- [Gan88]H. Ganzinger. A completion procedure for conditional equations. In Proc. of the 1st International Workshop on Conditional Term Rewriting, Orsay, volume 308 of LNCS, pp. 62–83, Berlin-Heidelberg-New York, 1988. Springer-Verlag.Google Scholar
- [Höl89]S. Hölldobler. Foundations of Equational Logic Programming. Springer-Verlag, Berlin-Heidelberg-New York, 1989.Google Scholar
- [JW86]J.P. Jouannaud and B. Waldmann. Reductive conditional term rewriting systems. In Proc. of the 3rd TC2 Working Conference on the Formal Description of Programming Concepts, Ebberup, Denmark, August 25–28 1986.Google Scholar
- [Kap85]S. Kaplan. Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence, 1985.Google Scholar
- [KR88]E. Kounalis and M. Rusinowitch. On word problems in Horn logic. In N. Dershowitz and S. Kaplan, editors, Proc. of the 1st International Workshop on Conditional Term Rewriting, Orsay, LNCS 308, pp. 144–160, Berlin-Heidelberg-New York, 1988. Springer-Verlag.Google Scholar
- [Llo87]J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin-Heidelberg-New York, 1987.Google Scholar
- [Pad88]P. Padawitz. Computing in Horn Clause Theories. Springer-Verlag, Berlin-Heidelberg-New York, 1988.Google Scholar