Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Preserving Regularity via Logic Programs
Angličtina
118 b
30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
35.66
€
/
Brožovaná
29.40
€
/
Brožovaná
44.45
€
/
Brožovaná
70.32
€
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.
Informácie o knihe
Angličtina
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Brožovaná
25.35
€
/
Brožovaná
20.20
€
/
Brožovaná
49.91
€
/
Brožovaná
59.00
€
