Constraint logic programming with a relational machine - Mines Paris Accéder directement au contenu
Article Dans Une Revue Formal Aspects of Computing Année : 2016

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 apart are completely elided in favor of manipulation of variable-free relation expressions. In this setting, term rewriting not only provides an operational semantics for logic programs, but also a simple framework for reasoning about program execution. We prove the translation sound, and the rewriting system complete with respect to traditional SLD semantics.
Fichier non déposé

Dates et versions

hal-01433373 , version 1 (12-01-2017)



Emilio Jesús Gallego Arias, Julio Mariño y Carballo, James Lipton. Constraint logic programming with a relational machine. Formal Aspects of Computing, 2016, 29 (Issue 1), pp.97-124. ⟨10.1007/s00165-016-0369-z⟩. ⟨hal-01433373⟩
78 Consultations
0 Téléchargements



Gmail Mastodon Facebook X LinkedIn More