- We will send in 10–14 business days.
/images/books/13170982/9783639008388.jpg)
- Author: Friedrich Neurauter
- Publisher: VDM Verlag Dr. Mueller E.K.
- Year: 2008
- Pages: 80
- ISBN-10: 3639008383
- ISBN-13: 9783639008388
- Format: 15.2 x 22.9 x 0.4 cm, softcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
This book is concerned with the presentation of a general translation of term rewrite systems to logic programs such that basic rewriting derivations become logic deductions. In particular, this work is a review of a recent research paper on this very subject written by S. Limet and G. Salzer in which they present an algorithm that imple-ments such a translation scheme for certain classes of term rewrite systems. Basically, their algorithm takes as input a term rewrite system that satisfies some syntactical restrictions and a regular tree language, transforms both inputs to logic programs and combines the resulting programs to a single logic program that allows to infer regularity preservation of the original term rewrite system. The transformation of certain term rewrite systems results in so-called cs-programs which were originally studied in the context of constraint systems and tree tuple languages. By applying known results of cs-programs new classes of regularity preserving term rewrite systems are obtained.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 19d.18:08:26
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Friedrich Neurauter
- Publisher: VDM Verlag Dr. Mueller E.K.
- Year: 2008
- Pages: 80
- ISBN-10: 3639008383
- ISBN-13: 9783639008388
- Format: 15.2 x 22.9 x 0.4 cm, softcover
- Language: English English
This book is concerned with the presentation of a general translation of term rewrite systems to logic programs such that basic rewriting derivations become logic deductions. In particular, this work is a review of a recent research paper on this very subject written by S. Limet and G. Salzer in which they present an algorithm that imple-ments such a translation scheme for certain classes of term rewrite systems. Basically, their algorithm takes as input a term rewrite system that satisfies some syntactical restrictions and a regular tree language, transforms both inputs to logic programs and combines the resulting programs to a single logic program that allows to infer regularity preservation of the original term rewrite system. The transformation of certain term rewrite systems results in so-called cs-programs which were originally studied in the context of constraint systems and tree tuple languages. By applying known results of cs-programs new classes of regularity preserving term rewrite systems are obtained.
Reviews