Advanced Topics in Term Rewriting / Najlacnejšie knihy
Advanced Topics in Term Rewriting

Code: 01421662

Advanced Topics in Term Rewriting

by Enno Ohlebusch

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 fo ... more

71.04


Low in stock at our supplier
Shipping in 12 - 17 days

Potřebujete více kusů?Máte-li zájem o více kusů, prověřte, prosím, nejprve dostupnost titulu na naši zákaznické podpoře.


Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

More about Advanced Topics in Term Rewriting

You get 175 loyalty points

Book synopsis

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.Term rewriting techniques are applicable to various fields of computer science, including software engineering, programming languages, computer algebra, program verification, automated theorem proving and Boolean§algebra. These powerful techniques can be successfully applied in all areas that demand efficient methods for reasoning with equations.§One of the major problems encountered is the characterization of classes of rewrite systems that have a desirable property, like confluence or termination. 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 volume provides a comprehensive and unified presentation of termination and confluence, as well as related properties.§Topics and features:§unified presentation and notation for important advanced topics§comprehensive coverage of conditional term-rewriting systems§state-of-the-art survey of modularity in term rewriting§presentation of unified framework for term and graph rewriting§up-to-date discussion of transformational methods for proving termination of logic programs, including the TALP system§This unique book offers a comprehensive and unified§view of the subject that is suitable for all computer scientists, program designers, and software engineers who study and use term rewriting techniques. Practitioners, researchers and professionals will find the book an essential and authoritative resource and guide for the latest developments and results in the field.

Book details

Book category Books in English Computing & information technology Computer science Computer architecture & logic design

71.04

Trending among others



Collection points Bratislava a 2642 dalších

Copyright ©2008-24 najlacnejsie-knihy.sk All rights reservedPrivacyCookies


Account: Log in
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Shopping cart ( Empty )

For free shipping
shop for 59,99 € and more

You are here: