Editors:
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1103)
Conference series link(s): RTA: International Conference on Rewriting Techniques and Applications
Conference proceedings info: RTA 1996.
Buying options
This is a preview of subscription content, access via your institution.
Table of contents (37 papers)
-
Front Matter
About this book
The 27 revised full papers presented in this volume were selected from a total of 84 submissions, also included are six system descriptions and abstracts of three invited papers. The topics covered include analysis of term rewriting systems, string and graph rewriting, rewrite-based theorem proving, conditional term rewriting, higher-order rewriting, unification, symbolic and algebraic computation, and efficient implementation of rewriting on sequential and parallel machines.
Keywords
- Automatische Deduktion
- Ersetzungssysteme
- Höherstufige Logiken
- automated deduction
- graph rewriting
- higher-order logics
- proving
- rewriting systems
- term rewriting
- theorem proving
Bibliographic Information
Book Title: Rewriting Techniques and Applications
Book Subtitle: 7th International Conference, RTA-96, New Brunswick, NJ, USA July 27 - 30, 1996. Proceedings
Editors: Harald Ganzinger
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-61464-8
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1996
Softcover ISBN: 978-3-540-61464-7Published: 01 July 1996
eBook ISBN: 978-3-540-68596-8Published: 14 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 440
Topics: Software Engineering, Theory of Computation, Compilers and Interpreters, Computer Science Logic and Foundations of Programming, Formal Languages and Automata Theory, Artificial Intelligence