Goal-Directed Completion using SOUR Graphs

  • Christopher Lynch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1232)


We give the first Goal-Directed version of the Knuth Bendix Completion Procedure. Our procedure is based on Basic Completion and SOUR Graphs. There are two phases to the procedure. The first phase, which runs in polynomial time, compiles the equations and the goal into a constrained tree automata representing the completed system, and a set of constraints representing goal solutions. The second phase starts with the goal solutions and works its way back to the original equations, solving constraints along the way.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic Paramodulation. Information and Computation Vol. 121, No. 2 (1995) pp. 172–192.CrossRefGoogle Scholar
  2. 2.
    J. Chabin, and P. Réty. Narrowing directed by a graph of terms. In Proc. 4th Int. Conf. on Rewriting Techniques and Applications, Lect. Notes in Computer Science, vol. 488, pp. 112–123, Springer-Verlag.Google Scholar
  3. 3.
    H. Comon. Solving Symbolic Ordering Constraints. International Journal of Foundations of Computer Science 1 (1990) pp. 387–411.Google Scholar
  4. 4.
    N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen editor, Handbook of Theoretical Computer Science B: Formal Methods and Semantics, chapter 6, pp. 243–320. North-Holland, Amsterdam, 1990.Google Scholar
  5. 5.
    N. Dershowitz and G. Sivakumar. Solving goals in equational languages. In Proc. of the First Intl. Workshop on Conditional and Typed Rewriting Systems, Lect. Notes in Comput. Sci., vol. 308, (1987) pp. 45–55.Google Scholar
  6. 6.
    J. Gallier, P. Narendran, D. Plaisted, S. Raatz, and W. Snyder. Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. Journal of Association for Computing Machinery Vol 40, no. 1 (1993) pp. 1–16.Google Scholar
  7. 7.
    M. Hermann and R. Galbavý. Unification of Infinite Sets of Terms Schematized by Primal Grammars. To appear in Theoretical Computer Science.Google Scholar
  8. 8.
    D. Knuth and P. Bendix. Simple Word Problems in Universal Algebras. In J. Leech, Ed. Computational Problems in Abstract Algebras, Oxford, Pergamon Press.Google Scholar
  9. 9.
    D. Kozen. Complexity of Finitely Presented Algebras. PhD Thesis. Cornell University. 1977.Google Scholar
  10. 10.
    C. Lynch. Paramodulation without Duplication. In 10th Intl IEEE Symposium on Logic in Computer Science, (1995) pp. 167–177.Google Scholar
  11. 11.
    C. Lynch, and P. Strogova. SOUR Graphs for Efficient Completion. CRIN Technical Report (1995).Google Scholar
  12. 12.
    R. Nieuwenhuis. Simple LPO constraint solving methods. Information Processing Letters 47, (1993) pp. 65–69.CrossRefGoogle Scholar
  13. 13.
    R. Nieuwenhuis and A. Rubio. Basic Superposition is Complete. In Proc. European Symposium on Programming, Lect. Notes in Computer Science, vol. 582, pp. 371–390, (1992) Springer-Verlag.Google Scholar
  14. 14.
    R. Nieuwenhuis and A. Rubio. Theorem Proving with Ordering and Equality Constrained Clauses. Journal of Symbolic Computation Vol. 19 No. 4 (1995) pp. 321–352.CrossRefGoogle Scholar
  15. 15.
    R. Nieuwenhuis. On Narrowing, Refutation Proofs and Constraints. In Proc. 6th Int. Conf. on Rewriting Techniques and Applications, Lect. Notes in Computer Science, vol. 914, pp. 56–70, Berlin, 1995, Springer-Verlag.Google Scholar
  16. 16.
    D. Plaisted, and A. Sattler-Klein. Proof Lengths for Equational Completion. Information and Computation Vol. 125, No. 2 (1996) pp. 154–170.Google Scholar
  17. 17.
    K. Rose. Xy-pic Reference Manual 3.0 edition. DIKU, University of Copenhagen. Universitetsparken 1, DK-2100 København Ø. June, 1995.Google Scholar
  18. 18.
    W. Snyder. A Proof Theory for General Unification. Birkhauser Boston, Inc., Boston MA (1991).Google Scholar
  19. 19.
    W. Snyder. A Fast Algorithm for Generating Reduced Ground Rewriting Systems from a Set of Ground Equations. Journal of Symbolic Computation 15 (1993) pp. 415–450.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Christopher Lynch
    • 1
  1. 1.Department of Math and Computer ScienceClarkson UniversityPotsdamUSA

Personalised recommendations