or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Advanced Topics in Term Rewriting
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Advanced Topics in Term Rewriting [Hardcover]

Enno Ohlebusch (Author)

Price: $89.95 & this item ships for FREE with Super Saver Shipping. Details
  Special Offers Available
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 1 left in stock--order soon (more on the way).
Want it delivered Tuesday, January 31? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for Students. Learn more

Formats

Amazon Price New from Used from
Hardcover $89.95  
Paperback $71.97  

Book Description

0387952500 978-0387952505 April 12, 2002 1
Unlike current survey articles and textbooks, here the so-called confluence and termination hierarchies play a key role. Throughout, the relationships between the properties in the hierarchies are reviewed, and it is shown that for every implication X => Y in the hierarchies, the property X is undecidable for all term rewriting systems satisfying Y. Topics covered include: the newest techniques for proving termination of rewrite systems; a comprehensive chapter on conditional term rewriting systems; a state-of-the-art survey of modularity in term rewriting, and a uniform framework for term and graph rewriting, as well as the first result on conditional graph rewriting.

Special Offers and Product Promotions

  • Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)

Editorial Reviews

Review

From the reviews:

"The book Advanced Topics in Term Rewriting (ATITR) begins with an Abstract Reduction System ARS. … there are not many textbooks written in English on term rewriting. … if you like mathematics, already know the basics of term rewriting and you are a researcher or a postgraduate then this book is definitely recommended." (Nimish Shah, Journal of Functional Programming, Vol. 16 (2), 2006)

"A well-written overview of recent research with many references to the literature, and hence has clearly an added value over a collection of papers. … contains a pleasant surprise in the form of a chapter on termination of logic programs. … it can be very well used for a seminar for advanced students who already know the basics of term rewriting. … it is written in a clear and rigorous way. … I very much recommend the book for researchers and advanced students … ." (Femke van Raamsdonk, Theory and Practice of Logic Programming, Vol. 4 (4), 2004)

"The book starts with some motivating examples of Term Rewriting Systems (TRSs) (e.g. ‘coffee can problem’). … There are other books on TRSs but these are in fact introductory textbooks whereas Ohlebusch’s book covers several important fields in term rewriting that go beyond the scope of an introductory book – especially fields to which the author himself made essential contributions. In this way this monograph is an outstanding one, suitable for all Computer scientists who study and use term rewriting." (A. Widiger, Zentralblatt MATH, Vol. 999 (24), 2002)


Product Details


More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews


There are no customer reviews yet.
Video reviews
Video reviews
Amazon now allows customers to upload product video reviews. Use a webcam or video camera to record and upload reviews to Amazon.



Inside This Book (learn more)
First Sentence:
Equations were among the first mathematical achievements of mankind. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
confluence hierarchy, quicksort system, balanced derivation, one dependency pair, root rewrite step, conditional graph rewriting, confluent overlay system, subterni property, graph rewrite relation, monotone polynomial interpretation, relative undecidability, innermost termination, unique normal forms with respect, common redact, marked rewriting, conditional critical pair, termination hierarchy, dependency pair method, innermost terminating, estimated dependency graph, polynomial termination, parallel moves lemma, composable systems, dependency pairs, innermost dependency graph
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Proof Let, Krishna Rao, Proof Suppose, Proof First, Proof According, Let Var
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:

Citations (learn more)
This book cites 6 books:
See all 6 books this book cites
 
6 books cite this book:
See all 6 books citing this book



Tag this product

 (What's this?)
Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.
Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject