CONSTRAINT LOGIC PROGRAMMING-LANGUAGES

被引：88

作者：

COHEN, J

机构：

[1] Brandeis Univ., Waltham, MA

来源：

COMMUNICATIONS OF THE ACM | 1990年 / 33卷 / 07期

关键词：

D O I：

10.1145/79204.79209

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Constraint Logic Programming 1990 is an extension of Logic Programming aimed at replacing the pattern matching mechanism of unification, as used in Prolog, by a more general operation called constraint satisfaction. This aritcle provides a panoramic view of the recent work done in designing and implementing CLP languages. It also presents a summary of their theoretical foundations, discusses implementation issues, compares the major CLP languages, and suggests directions for further work. © 1990, ACM. All rights reserved.

引用

页码：52 / 68

页数：17

共 47 条

[1]

Aiba A., 1988, P INT C 5 GEN COMP S, P263

[2]

[Anonymous], 2016, LINEAR NONLINEAR PRO

[3]

APT KR, 1988, TR8735 U TEX AUST DE

[4] A BIBLIOGRAPHY OF QUANTIFIER ELIMINATION FOR REAL CLOSED FIELDS [J].

ARNON, DS .

JOURNAL OF SYMBOLIC COMPUTATION, 1988, 5 (1-2) :267-274

[5]

BOI JM, 1988, THESIS U AIX MARSEIL

[6]

BORNING A, 1981, ACM T PROGR LANG SYS, V3, P252

[7]

BOYER RS, 1988, COMPUTATIONAL LOGIC

[8]

BRUYNOOGHE M, 1988, 5TH P INT C S SEATTL, V1, P669

[9]

Buchberger B., 1985, MULTIDIMENSIONAL SYS, P184

[10] EMBEDDING BOOLEAN EXPRESSIONS INTO LOGIC PROGRAMMING [J].

BUTTNER, W ;

SIMONIS, H .

JOURNAL OF SYMBOLIC COMPUTATION, 1987, 4 (02) :191-205

← 1 2 3 4 5 →