Contacto
Cómo comprar
Entrega
Guía de compras
Preserving Regularity via Logic Programs
Inglés
131 b
Política de devolución de 30 días
Clientes que también han comprado
/
Tapa blanda
39.39
€
/
Tapa blanda
32.59
€
/
Tapa blanda
49.19
€
/
Tapa blanda
77.69
€
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.
Sobre el libro
Inglés
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa blanda
27.69
€
/
Tapa blanda
21.99
€
/
Tapa blanda
52.99
€
/
Tapa blanda
65.49
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?