AN INTRODUCTION TO PROLOG-III

被引：155

作者：

COLMERAUER, A ^{[1
]}

机构：

[1] UNIV AIX MARSEILLE 2, F-13007 MARSEILLE, FRANCE

来源：

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

关键词：

Constraint Logic Programming (CLP) - PROLOG III - Unification Algorithm;

D O I：

10.1145/79204.79210

中图分类号：

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

学科分类号：

0812 ;

摘要：

The Prolog III programming language extends Prolog by redefining the fundamental process at its heart: unification. This article presents the specifications of this new language and illustrates its capabilities. © 1990, ACM. All rights reserved.

引用

页码：69 / 90

页数：22

共 25 条

[1]

[Anonymous], 2003, LINEAR PROGRAMMING

[2]

[Anonymous], 14TH P ACM S PRINC P

[3]

BALINSKI ML, 1963, RECENT ADV MATH PROG, P17

[4]

BENHAMOU F, 1988, THESIS U AIX MARSEIL

[5]

Bland R. G., 1977, Mathematics of Operations Research, V2, P103, DOI 10.1287/moor.2.2.103

[6]

BOOLE G, 1958, LAWS THOUGHT

[7]

Brown M., 1983, AM MATH MONTHLY, V90, P569

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

BUTTNER, W ;

SIMONIS, H .

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

[9]

Carroll L, 1958, SYMBOLIC LOGIC GAME

[10] PROLOG IN 10 FIGURES [J].

COLMERAUER, A .

COMMUNICATIONS OF THE ACM, 1985, 28 (12) :1296-1310

← 1 2 3 →