Contatto
Come acquistare
Consegna
Guida all'acquisto
Preserving Regularity via Logic Programs
Inglese
131 b
30 giorni per il reso
I clienti hanno acquistato anche
/
In brossura
37.29
€
/
In brossura
30.79
€
/
In brossura
46.59
€
/
In brossura
73.59
€
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.
Informazioni sul libro
Inglese
Regala questo libro oggi stesso
È facile
1 Aggiungi il libro al carrello e scegli la consegna come regalo 2 Ti invieremo subito il buono 3 Il libro arriverà all'indirizzo del destinatarioPotrebbe interessarti anche
/
In brossura
27.69
€
/
In brossura
21.99
€
/
In brossura
51.99
€
/
In brossura
65.49
€
Ciao! Sono Libroamiko, il tuo consulente di libri.
Come posso aiutarti?