Skip to main content
SpringerLink
Log in

Clausal rewriting

  • Chapter 3 Extension Of Knuth-Bendix Completion
  • Conference paper
  • First Online:
Conditional and Typed Rewriting Systems (CTRS 1990)

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

Included in the following conference series:

Abstract

The techniques of clausal rewriting and completion are presented. The methods described provide several theorem proving techniques in first order logic with equality. The clausal completion procedure generates few new axioms and is compatible with the powerful clausal rewriting technique for simplification and deletion of redundant axioms.

This work has been partially supported by the ESPRIT Project PROSPECTRA ref. no. 390, under subcontract with Alcatel SESA.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Bachmair, N. Dershowitz, J. Hsiang: Orderings for equational proofs. In Proc. Symp. Logic in Computer Science, 346–357, Boston (Massachusetts USA), 1986.

    Google Scholar 

  2. D. Brand, J.A. Darringer, W.H. Joyner: Completeness of conditional reductions. IBM T.J. Watson Res. Center Report RC-7404 (1978).

    Google Scholar 

  3. L. Bachmair, H. Ganzinger: On restrictions of ordered paramodulation with simplification. In Proc. 10th Int. Conf. om Automated Deduction. LNCS, pp 427–441.

    Google Scholar 

  4. L. Bachmair, H. Ganzinger: Completion of first order clauses with equality. 2nd Intl. Workshop on Conditional and Typed Term Rewriting, Montreal (1987). to appear in LNCS.

    Google Scholar 

  5. H. Bertling, H. Ganzinger, R. Schafers: A collection of specifications completed by the CEC-system Report, PROSPECTRA-Project, U. Dortmund, 1988.

    Google Scholar 

  6. H. Bertling, H. Ganzinger, R. Schafers: CEC: A system for conditional equational completion — User Manual (Version 1.0). Report, PROSPECTRA-Project, U. Dortmund, 1988.

    Google Scholar 

  7. N. Dershowitz: Termination of rewriting. Journal of Symbolic Computation, 69–116, 1987.

    Google Scholar 

  8. H. Ganzinger: A completion procedure for conditional equations. 1st Intl. Workshop on Conditional Term Rewriting, Orsay (1987), also to appear in J. of Symb. Computation.

    Google Scholar 

  9. J. Hsiang, M. Rusinowitch: Proving refutational completeness of theorem proving strategies: The transfinite semantic tree method. Submitted for publication.

    Google Scholar 

  10. D.E. Knuth, P.B. Bendix: Simple word problems in universal algebras. J. Leech, editor, Computational Problems in Abstract Algebra, 263–297, Pergamon Press, Oxford, 1970.

    Google Scholar 

  11. E. Kounalis, M. Rusinowitch: On word problems in Horn logic. 1st Intl. Workshop on Conditional Term Rewriting, Orsay (1987).

    Google Scholar 

  12. S. Kaplan: Fair conditional term rewriting systems: unification, termination and confluence. Recent Trends in Data Type Specification, Springer IFB 116 (1985).

    Google Scholar 

  13. U. Martin, T. Nipkow: Ordered rewriting and confluence. In Proc. 10th Int. Conf. om Automated Deduction. LNCS, pp 366–380.

    Google Scholar 

  14. M.L. Navarro Gomez: Tecnicas de Reescritura para especificaciones condicionales. PhD Thesis, Barcelona, 1987.

    Google Scholar 

  15. R. Nieuwenhuis: Algunas técnicas de reescritura y su implementacion en el sistema TRIP. Master thesis, UPC Barcelona, 1988.

    Google Scholar 

  16. R. Nieuwenhuis: Theorem proving in first order logic with equality by clausal rewriting and completion. PhD thesis, UPC Barcelona, 1990.

    Google Scholar 

  17. R. Nieuwenhuis, F. Orejas, A. Rubio: TRIP: an implementation of clausal rewriting. In Proc. 10th Int. Conf. om Automated Deduction. LNCS 449, pp 667–668.

    Google Scholar 

  18. R. Nieuwenhuis, F. Orejas: Clausal Rewriting: Applications and Implementation. In Proc. Int. Workshop on Abstract Data Types. 1990, to appear in LNCS.

    Google Scholar 

  19. M. Rusinowitch: Theorem proving with resolution and superposition: An extension of the Knuth-Bendix completion procedure as a complete set of inference rules. Report 87-R-128, CRIN, Nancy, 1987.

    Google Scholar 

  20. J.L. Remy, H. Zhang: Contextual rewriting. Proc. Conf. on Rewriting Techniques and Applications, Dijon (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Lenguajes y Sistemas Informáticos, Universidad Politécnica de Cataluña, Pau Gargallo 5, 08028, Barcelona, Spain

    Robert Nieuwenhuis & Fernando Orejas

Authors
  1. Robert Nieuwenhuis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fernando Orejas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Kaplan M. Okada

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nieuwenhuis, R., Orejas, F. (1991). Clausal rewriting. In: Kaplan, S., Okada, M. (eds) Conditional and Typed Rewriting Systems. CTRS 1990. Lecture Notes in Computer Science, vol 516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54317-1_95

Download citation

  • DOI: https://doi.org/10.1007/3-540-54317-1_95

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54317-6

  • Online ISBN: 978-3-540-47558-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation