New advanced text/reference book on term rewriting theory and application. Essential, state-of-the-art reference for computer scientists and advanced graduates working in field of computational logic programming.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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)
* 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
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 29,20 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiEUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiDa: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. First book on advanced topics in term rewritingCovers the newest techniques for proving termination of rewrite systemsContains a comprehensive chapter on conditional term rewriting systemsContains a state-of-the-art survey of modularity in term . Codice articolo 4173390
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 432 pp. Englisch. Codice articolo 9781441929211
Quantità: 2 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 432 pp. Englisch. Codice articolo 9781441929211
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9781441929211_new
Quantità: Più di 20 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9781441929211
Quantità: 1 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 633. Codice articolo C9781441929211
Quantità: Più di 20 disponibili
Da: Chiron Media, Wallingford, Regno Unito
Paperback. Condizione: New. Codice articolo 6666-IUK-9781441929211
Quantità: 10 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Mar2411530294549
Quantità: Più di 20 disponibili
Da: Mispah books, Redhill, SURRE, Regno Unito
Paperback. Condizione: Like New. Like New. book. Codice articolo ERICA77314419292156
Quantità: 1 disponibili