Kontakt
Jak kupować
Dostawa
Doradca ds. zakupów
Preserving Regularity via Logic Programs
Angielski
124 b
30 dni na zwrot towaru
Klienci kupili także
/
Miękka
151.14
zł
/
Miękka
124.95
zł
/
Miękka
188.68
zł
/
Miękka
298.38
zł
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.
Informacje o książce
Angielski
Podaruj tę książkę jeszcze dziś
To łatwe
1 Dodaj książkę do koszyka i wybierz „dostarczyć jako prezent” 2 W odpowiedzi wyślemy Ci bon 3 Książka dotrze na adres obdarowanegoMogłoby Cię także zainteresować
/
Miękka
113.31
zł
/
Miękka
211.77
zł
/
Miękka
265.76
zł
