Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Preserving Regularity via Logic Programs

Preserving Regularity via Logic Programs

Neurauter, Friedrich

Paperback

General ComputersGeneral Mathematics

ISBN10: 3639008383
ISBN13: 9783639008388
Publisher: Blues Kids Of Amer
Published: May 5 2008
Pages: 80
Weight: 0.26
Height: 0.17 Width: 6.00 Depth: 9.00
Language: 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.

Also in

General Mathematics

View All