Logo - springer
Slogan - springer

Computer Science - Communication Networks | Advanced Topics in Term Rewriting

Advanced Topics in Term Rewriting

Ohlebusch, Enno

2002, XVI, 414 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$69.95

(net) price for USA

ISBN 978-1-4757-3661-8

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$89.95

(net) price for USA

ISBN 978-0-387-95250-5

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$89.95

(net) price for USA

ISBN 978-1-4419-2921-1

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Term rewriting techniques are applicable in various fields of computer sci­ ence: in software engineering (e.g., equationally specified abstract data types), in programming languages (e.g., functional-logic programming), in computer algebra (e.g., symbolic computations, Grabner bases), in pro­ gram verification (e.g., automatically proving termination of programs), in automated theorem proving (e.g., equational unification), and in algebra (e.g., Boolean algebra, group theory). In other words, term rewriting has applications in practical computer science, theoretical computer science, and mathematics. Roughly speaking, term rewriting techniques can suc­ cessfully be applied in areas that demand efficient methods for reasoning with equations. One of the major problems one encounters in the theory of term rewriting is the characterization of classes of rewrite systems that have a desirable property like confluence or termination. If a term rewriting system is conflu­ ent, then the normal form of a given term is unique. A terminating rewrite system does not permit infinite computations, that is, every computation starting from a term must end in a normal form. Therefore, in a system that is both terminating and confluent every computation leads to a result that is unique, regardless of the order in which the rewrite rules are applied. This book provides a comprehensive study of termination and confluence as well as related properties.

Content Level » Professional/practitioner

Keywords » Automat - Boolean algebra - TAL - automated theorem proving - computer - formal method - logic - programming - programming language - theorem proving - verification

Related subjects » Communication Networks - Software Engineering - Theoretical Computer Science

Table of contents 

* Motivation * Abstract Reduction Systems * Term Rewriting Systems * Confluence * Termination * Relative Undecidability * Conditional Rewrite Systems * Modularity * Graph Rewriting * Termination of Logic Programs * Appendix-Kruskal's Theorem

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Computer System Implementation.