Vertel uw vrienden over dit artikel:
Preserving Regularity Via Logic Programs: Proving Regularity Preservation of Term Rewrite Systems with Logic Programming Techniques Friedrich Neurauter
Besteld in een afgelegen magazijn
Kerstcadeautjes kunnen tot en met 31 januari worden ingewisseld
Preserving Regularity Via Logic Programs: Proving Regularity Preservation of Term Rewrite Systems with Logic Programming Techniques
Friedrich Neurauter
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 algorithmthat 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.
| Media | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 5 mei 2008 |
| ISBN13 | 9783639008388 |
| Uitgevers | VDM Verlag |
| Pagina's | 80 |
| Afmetingen | 150 × 220 × 10 mm · 117 g |
| Taal en grammatica | Engels |