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...

Full description

Saved in:
Bibliographic Details
Published in:Formal aspects of computing Vol. 29; no. 1; pp. 97 - 124
Main Authors: Gallego Arias, Emilio Jesús, Lipton, James, Mariño, Julio
Format: Journal Article
Language:English
Published: London Springer London 01.01.2017
Association for Computing Machinery
Springer Verlag
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0934-5043
1433-299X
DOI:10.1007/s00165-016-0369-z