Constraint logic programming with a relational machine. (January 2017)

• Record Type: Journal Article
• Authors: Gallego Arias, Emilio; Lipton, James; Mariño, Julio
• Is Part Of: Formal aspects of computing. Volume 29:Number 1(2017)
• Page Start: 97
• Page End: 124
• Publication Date: 2017-01
• Subjects: Logic programming -- Constraint programming -- Relation algebra -- Rewriting -- Semantics; Computer science -- Periodicals; 004.05
• DOI: 10.1007/s00165-016-0369-z
• Languages: English
• ISSNs: 0934-5043

Abstract

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.