A COMPARISON OF 3 PROLOG EXTENSIONS

被引：9

作者：

REED, DW ^{[1
]}

LOVELAND, DW ^{[1
]}

机构：

[1] DUKE UNIV,DEPT COMP SCI,DURHAM,NC 27706

来源：

JOURNAL OF LOGIC PROGRAMMING | 1992年 / 12卷 / 1-2期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1016/0743-1066(92)90038-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present three extensions of PROLOG, discussing their similarities and differences. The systems-near-Horn PROLOG (Loveland), simplified problem reduction format (Plaisted), and N-PROLOG (Gabbay and Reyle) -differ in their approach to the extension of PROLOG, yet each utilizes case analysis as the mechanism for non-Horn reasoning. The fact that these systems, with quite different origins, purposes, and presentation forms, utilize the case-analysis method in a strikingly similar fashion suggests that their underlying reasoning is general and intuitive. This paper describes the three systems and outlines the close relationship between them. The systems also appear to have essential differences: properties of one system that cannot be incorporated in another without serious distortion of the unique properties of the receiving system. High-lighting those tradeoffs aids our understanding of the systems.

引用

页码：25 / 50

页数：26

共 11 条

[1] Clocksin W. F., 1984, PROGRAMMING PROLOG
[2] GABBAY DM, 1985, J LOGIC PROGRAM, V4, P251
[3] Loveland D. W., 1987, Logic Programming. Proceedings of the Fourth International Conference, P456
[4] LOVELAND DW, 1989, COMPUTATIONAL LOGIC
[5] LOVELAND DW, IN PRESS J AUTOMAT R
[6] LOVELAND DW, 1988, CS198825 DUK U TECHN
[7] Plaisted D. A., 1988, Journal of Automated Reasoning, V4, P287, DOI 10.1007/BF00244944
[8] A SIMPLIFIED PROBLEM REDUCTION FORMAT
PLAISTED, DA
[J]. ARTIFICIAL INTELLIGENCE, 1982, 18 (02) : 227 - 261
[9] REED DW, 1988, THESIS DUKE U
[10] Smith B. T., 1988, Logic Programming: Proceedings of the Fifth International Conference and Symposium, P794

← 1 2 →