Declarative Compilation for Constraint Logic Programming

被引：1

作者：

Gallego Arias, Emilio Jesus ^{[1
]}

Lipton, James ^{[2
]}

Marino, Julio ^{[3
]}

机构：

[1] Univ Penn, Philadelphia, PA 19104 USA

[2] Wesleyan Univ, Middletown, CT 06459 USA

[3] Univ Politecn Madrid, Madrid, Spain

来源：

LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION (LOPSTR 2014) | 2015年 / 8981卷

关键词：

Logic programming; Constraint programming; Relation algebra; Rewriting; Semantics; UNIFICATION;

D O I：

10.1007/978-3-319-17822-6_17

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We present a new declarative compilation of logic programs with constraints into variable-free relational theories which are then executed by rewriting. This translation provides an algebraic formulation of the abstract syntax of logic programs. Management of logic variables, unification, and renaming apart is completely elided in favor of algebraic manipulation of variable-free relation expressions. We prove the translation is sound, and the rewriting system complete with respect to traditional SLD semantics.

引用

页码：299 / 316

页数：18

共 22 条

[11] First-order unification using variable-free relational algebra * [J].

Gallego Arias, Emilio Jesus ;

Lipton, James ;

Marino, Julio ;

Nogueira, Pablo .

LOGIC JOURNAL OF THE IGPL, 2011, 19 (06) :790-820

[12] CONSTRAINT LOGIC PROGRAMMING - A SURVEY [J].

JAFFAR, J ;

MAHER, MJ .

JOURNAL OF LOGIC PROGRAMMING, 1994, 20 :503-581

[13]

KINOSHITA Y, 1996, LNCS, V1050, P177

[14]

Komendantskaya E., 2011, LIPICS, V12, P352

[15]

Lipton J., 1998, USING RELATIONAL MET, P1

[16]

Lloyd J. W., 1984, FDN LOGIC PROGRAMMIN

[17] UNIFORM PROOFS AS A FOUNDATION FOR LOGIC PROGRAMMING [J].

MILLER, D ;

NADATHUR, G ;

PFENNING, F ;

SCEDROV, A .

ANNALS OF PURE AND APPLIED LOGIC, 1991, 51 (1-2) :125-157

[18]

PFENNING F, 1988, SIGPLAN NOTICES, V23, P199, DOI 10.1145/960116.54010

[19]

RYDEHEARD DE, 1986, LECT NOTES COMPUT SC, V240, P493

[20]

Sterling L., 1986, THE ART OF PROLOG

← 1 2 3 →