Skip to Main content Skip to Navigation
Journal articles

Constraint logic programming with a relational machine

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal-mines-paristech.archives-ouvertes.fr/hal-01433373
Contributor : Claire Medrala <>
Submitted on : Thursday, January 12, 2017 - 4:18:17 PM
Last modification on : Thursday, September 24, 2020 - 4:36:02 PM

Identifiers

Citation

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

Share

Metrics

Record views

276