Advertisement

Table of contents

  1. Front Matter
    Pages I-XI
  2. Leo Bachmair
    Pages 1-1
  3. Christopher Lynch, Wayne Snyder
    Pages 2-16
  4. J. Avenhaus, J. Denzinger
    Pages 62-76
  5. Soumen Chakrabarti, Katherine Yelick
    Pages 77-91
  6. Joachim Niehren, Andreas Podelski, Ralf Treinen
    Pages 106-120
  7. Rolf Backofen
    Pages 121-135
  8. Daniel J. Dougherty
    Pages 137-151
  9. Andrea Asperti, Cosimo Laneve
    Pages 152-167
  10. Femke van Raamsdonk
    Pages 168-182
  11. Nachum Dershowitz, Charles Hoot
    Pages 198-212
  12. M. C. F. Ferreira, H. Zantema
    Pages 213-227
  13. Aarl Middeldorp, Bernhard Gramlich
    Pages 228-242
  14. Ernst Lippe
    Pages 274-288
  15. Franz Baader, Klaus U. Schulz
    Pages 301-315
  16. Anne-Cécile Caron, Jean-Luc Coquide, Max Dauchet
    Pages 328-342
  17. Jean-Claude Raoult
    Pages 343-357
  18. Albert Rubio, Robert Nieuwenhuis
    Pages 374-388
  19. Ursula Martin
    Pages 421-433
  20. Pilar Nivela, Robert Nieuwenhuis
    Pages 436-440
  21. Reinhard Bündgen
    Pages 446-450
  22. Michael Löwe, Martin Beyer
    Pages 451-456
  23. Yexuan Gui, Mitsuhiro Okada
    Pages 462-466
  24. Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
    Pages 468-487
  25. Back Matter
    Pages 488-492

About these proceedings

Introduction

This volume contains the proceedings of RTA-93, the fifth International Conference on Rewriting Techniques and Applications, held in Montreal, Canada, in June 1993. The volume includes three invited lectures, "Rewrite techniques in theorem proving" (L. Bachmair), "Proving properties of typed lambda terms: realizability, covers, and sheaves" (J. Gallier), and "On some algorithmic problems for groups and monoids" (S.J. Adian), together with 29 selected papers, 6 system descriptions, and a list of open problems in the field. The papers covermany topics: term rewriting; termination; graph rewriting; constraint solving; semantic unification, disunification and combination; higher-order logics; and theorem proving, with several papers on distributed theorem proving, theorem proving with constraints and completion.

Keywords

Beweisverfahren Constraint Graph Rewriting Graphumformung Higher Order Logics Logiken höherer Ordnung Semantic Unification Semantische Unifikation Term Rewriting Termersetzung Theorem Proving algorithms

Editors and affiliations

  • Claude Kirchner
    • 1
  1. 1.INRIA Lorraine and CRINVillers les Nancy CedexFrance

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-21551-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 1993
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-56868-1
  • Online ISBN 978-3-662-21551-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site