Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1997: Rewriting Techniques and Applications pp 8–22Cite as

Goal-Directed Completion using SOUR Graphs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1232))

Abstract

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.

This document was created using Xy-pic[17]. Thanks to Kristoffer Rose for his help with Xy-pic

Most of this work was done while I was at the PROTHEO group at INRIA Lorraine and CRIN in Nancy, France.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic Paramodulation. Information and Computation Vol. 121, No. 2 (1995) pp. 172–192.

    Article  Google Scholar 

  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. H. Comon. Solving Symbolic Ordering Constraints. International Journal of Foundations of Computer Science 1 (1990) pp. 387–411.

    Google Scholar 

  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. 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. 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. M. Hermann and R. Galbavý. Unification of Infinite Sets of Terms Schematized by Primal Grammars. To appear in Theoretical Computer Science.

    Google Scholar 

  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. D. Kozen. Complexity of Finitely Presented Algebras. PhD Thesis. Cornell University. 1977.

    Google Scholar 

  10. C. Lynch. Paramodulation without Duplication. In 10th Intl IEEE Symposium on Logic in Computer Science, (1995) pp. 167–177.

    Google Scholar 

  11. C. Lynch, and P. Strogova. SOUR Graphs for Efficient Completion. CRIN Technical Report (1995).

    Google Scholar 

  12. R. Nieuwenhuis. Simple LPO constraint solving methods. Information Processing Letters 47, (1993) pp. 65–69.

    Article  Google Scholar 

  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. 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.

    Article  Google Scholar 

  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. 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. K. Rose. Xy-pic Reference Manual 3.0 edition. DIKU, University of Copenhagen. Universitetsparken 1, DK-2100 København Ø. June, 1995.

    Google Scholar 

  18. W. Snyder. A Proof Theory for General Unification. Birkhauser Boston, Inc., Boston MA (1991).

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Math and Computer Science, Clarkson University, Box 5815, 13699, Potsdam, NY, USA

    Christopher Lynch

Authors
  1. Christopher Lynch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hubert Comon

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lynch, C. (1997). Goal-Directed Completion using SOUR Graphs. In: Comon, H. (eds) Rewriting Techniques and Applications. RTA 1997. Lecture Notes in Computer Science, vol 1232. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62950-5_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-62950-5_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62950-4

  • Online ISBN: 978-3-540-69051-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation