|
Descripción
|
|
|---|---|
| We present a new declarative compilation of logic programs with constraints into variable-free relational theories which are then executed by rewriting. This translation provides an algebraic formulation of the abstract syntax of logic programs. Management of logic variables, unification, and renaming apart is completely elided in favor of algebraic manipulation of variable-free relation expressions. We prove the translation is sound, and the rewriting system complete with respect to traditional SLD semantics. | |
|
Internacional
|
Si |
|
Nombre congreso
|
Logic-Based Program Synthesis and Transformation: 24th International Symposium |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Canterbury, UK |
|
Revisores
|
Si |
|
ISBN o ISSN
|
978-3-319-17822-6 |
|
DOI
|
|
|
Fecha inicio congreso
|
09/09/2014 |
|
Fecha fin congreso
|
11/09/2014 |
|
Desde la página
|
299 |
|
Hasta la página
|
316 |
|
Título de las actas
|
Logic-Based Program Synthesis and Transformation 24th International Symposium, LOPSTR 2014, Canterbury, UK, September 9-11, 2014. Revised Selected Papers |