Contact
How to shop
Delivery
Shopping guide
Preserving Regularity via Logic Programs
English
125 b
30-day return policy
Customers also purchased
/
Paperback
35.66
€
/
Paperback
29.40
€
/
Paperback
44.45
€
/
Paperback
70.32
€
This book is concerned with the presentation of a general translation of termrewrite systems to logic programs such that basic rewriting derivations become logicdeductions. In particular, this work is a review of a recent research paper on this verysubject written by S. Limet and G. Salzer in which they present an algorithm that implements such a translation scheme for certain classes of term rewrite systems. Basically, their algorithm takes as input a term rewrite systemthat satisfies some syntactical restrictions and a regular tree language, transforms both inputs to logic programs and combines the resulting programsto 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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
26.67
€
/
Paperback
21.21
€
/
Paperback
49.91
€
/
Paperback
62.64
€
