Constraint logic programming with a relational machine-Reference-Cited by-同舟云学术

Constraint logic programming with a relational machine

Published:2017-01 Issue:1 Volume:29 Page:97-124
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Gallego Arias Emilio Jesús¹,Lipton James²,Mariño Julio³

Affiliation:

1. CRI, Mines ParisTech, 35 rue St Honoré, Fontainebleau, Seine-et-Marne, France

2. Department of Mathematics and Computer Science, Wesleyan University, 06459, MiddleTown, CT, USA

3. ETSI Informáticos, Universidad Politécnica de Madrid, Campus de Montegancedo s/n, 28660, Boadilla del Monte, Spain

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.

Funder

Wesleyan University Research Grant

Comunidad de Madrid

MINECO

ANR

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-016-0369-z.pdf

Reference24 articles.

1. Amato G Lipton J McGrail R (2009) On the algebraic structure of declarative programming languages. Theor Comput Sci 410(46):4626–4671. (Abstract of professor Giorgio Levi)

2. Asperti A Martini S (1989) Projections instead of variables: a category theoretic interpretation of logic programs. In: ICLP pp 337–352

3. Broome P Lipton J (1994) Combinatory logic programming: computing in relation calculi. In: Proceedings of the 1994 international symposium on logic programming (ILPS’94). MIT Press Cambridge pp 269–285

4. C-expressions: a variable-free calculus for equational logic programming

5. Clark KL (1977) Negation as failure. In: Gallaire H Minker J (eds) Logic and data bases. Plenum Press New York pp 293–322

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving Quantifier-Free First-Order Constraints Over Finite Sets and Binary Relations;Journal of Automated Reasoning;2019-04-08