Zobacz książki o podobnej tematyce

Więcej informacji o Preserving Regularity via Logic Programs

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 137 punkty

Opis

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.

Szczegóły książki

Kategoria Książki po angielsku Mathematics & science Mathematics

• Pełny tytuł: Preserving Regularity via Logic Programs
• Autor: Friedrich Neurauter
• Język: Angielski
• Oprawa: Miękka
• Liczba stron: 80
• EAN: 9783639008388
• ISBN: 3639008383
• ID: 06810920
• Wydawca: VDM Verlag Dr. Mueller E.K.
• Waga: 118 g
• Wymiary: 229 × 152 × 4 mm
• Data wydania: 05. May 2008

Ulubione w innej kategorii

---

---

---