Advanced Topics in Term Rewriting (Hardcover)

"The book Advanced Topics in Term Rewriting (ATITR) begins with an Abstract Reduction System ARS. a ] there are not many textbooks written in English on term rewriting. a ] 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. a ] contains a pleasant surprise in the form of a chapter on termination of logic programs. a ] it can be very well used for a seminar for advanced students who already know the basics of term rewriting. a ] it is written in a clear and rigorous way. a ] I very much recommend the book for researchers and advanced students a ] ." (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. a ~coffee can problema (TM)). a ] There are other books on TRSs but these are in fact introductory textbooks whereas Ohlebuscha (TM)s book covers several important fields in term rewriting that go beyond the scope of an introductory book a" 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 Description
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.

• Books > Computing & Internet > Computer Science > Architecture & Microprocessors
• Books > Computing & Internet > Computer Science > Artificial Intelligence > Robotics
• Books > Computing & Internet > Computer Science > Information Systems
• Books > Computing & Internet > Programming > Algorithms
• Books > Computing & Internet > Programming > Languages & Tools
• Books > Computing & Internet > Software & Graphics
• Books > Science & Nature > Engineering & Technology > Electronics & Communications Engineering > Robotics
• Books > Science & Nature > Mathematics > Mathematical Foundations > Mathematical Logic
• Books > Scientific, Technical & Medical > Engineering > Electronics & Telecommunications Engineering > Robotics & Automatic Control
• Books > Scientific, Technical & Medical > Mathematics > Mathematical Theory > Mathematical Logic

• Would you like to update product info or give feedback on images?
• I am the Author, and I want to comment on my book.
• I am the Publisher, and I want to comment on this book.