Kontakt
Kako nakupovati
Dostava
Svetovalec pri nakupu
Preserving Regularity via Logic Programs
Angleščina
118 b
30 dni za vračilo blaga
Drugi so kupili tudi
/
Mehka
33.57
€
/
Mehka
27.71
€
/
Mehka
66.25
€
/
Mehka
17.29
€
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.
O knjigi
Angleščina
Podarite to knjigo še danes
To je povsem preprosto
1 Dodajte knjigo v košarico in izberite dostavo kot darilo 2 V zameno vam bomo poslali kupon 3 Knjiga bo dostavljena na naslov obdarovancaMorda bi vas zanimalo tudi
/
Mehka
25.38
€
/
Mehka
44.70
€
/
Mehka
59.07
€
Pozdravljeni! Sem Libroamiko, vaš knjižni svetovalec.
Kako vam lahko pomagam?