{"product_id":"9783639008388","title":"Preserving Regularity Via Logic Programs","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.","brand":"VDM Verlag Dr. Mueller E.K.","offers":[{"title":"Default Title","offer_id":47036687745264,"sku":"9783639008388","price":64.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0737\/7593\/9824\/files\/9783639008388_p0.jpg?v=1763738629","url":"https:\/\/shop-qa.barnesandnoble.com\/products\/9783639008388","provider":"Barnes \u0026 Noble (DEV)","version":"1.0","type":"link"}