Constraint logic programming with a relational machine

We present a declarative framework for the compilation of constraint logic programs into variable-free relational theories which are then executed by rewriting. This translation provides an algebraic formulation of the abstract syntax of logic programs. Logic variables, unification, and renaming apa...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Formal aspects of computing Ročník 29; číslo 1; s. 97 - 124
Hlavní autori:	Gallego Arias, Emilio Jesús, Lipton, James, Mariño, Julio
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Springer London 01.01.2017 Association for Computing Machinery Springer Verlag
Predmet:	Algebra Computer Science Formulations Logic programming Math Applications in Computer Science Mathematical models Original Article Semantics Sound Symbolic Computation Syntax Theory of Computation Translations Relation algebra Logic programming Semantics Constraint programming Rewriting
ISSN:	0934-5043, 1433-299X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!