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 条

[11]

Clark K. L., 1978, Logic and data bases, P293

[12] A VIEW OF THE ORIGINS AND DEVELOPMENT OF PROLOG [J].

COHEN, J .

COMMUNICATIONS OF THE ACM, 1988, 31 (01) :26-36

[13]

COLLINS GE, COMPUTER ALGEBRA SYM, P79

[14]

COLMERAUER A, 1984, NOV P C 5TH GEN COMP, P85

[15]

COLMERAUER A, 1987, BYTE MAG, V12, P9

[16]

Colmerauer A., 1982, PROLOG 2 REFERENCE M

[17]

Colmerauer A., 1982, LOGIC PROGRAMM, P231

[18]

COLMERAUER A, 1990, COMMUN ACM, V7

[19]

Cousot P., 1977, POPL, P238, DOI [DOI 10.1145/512950.512973, 10.1145/512950.512973]

[20]

DINCBAS M, 1988, P INT C 5 GEN COMP S, P693

← 1 2 3 4 5 →