SEMANTICS OF PREDICATE LOGIC AS A PROGRAMMING LANGUAGE

被引：657

作者：

VANEMDEN, MH ^{[1
]}

KOWALSKI, RA ^{[1
]}

机构：

[1] UNIV EDINBURGH,EDINBURGH EH10 5HF,SCOTLAND

来源：

JOURNAL OF THE ACM | 1976年 / 23卷 / 04期

关键词：

D O I：

10.1145/321978.321991

中图分类号：

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

学科分类号：

0812 ;

摘要：

Sentences in first-order predicate logic can be usefully interpreted as programs. In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated. It is concluded that operational semantics is a part of proof theory and that fixpoint semantics is a special case of model-theoretic semantics.

引用

页码：733 / 742

页数：10

共 24 条

[1] BEKIC H, 1971, DEFINABLE OPERATIONS
[2] SPLITTING AND REDUCTION HEURISTICS IN AUTOMATIC THEOREM PROVING
BLEDSOE, WW
[J]. ARTIFICIAL INTELLIGENCE, 1971, 2 (01) : 55 - 77
[3] BURSTALL RM, 1969, MACH INTELL, V5, P79
[4] CHURCH A, 1956, INTRO MATHEMATICAL L, V1
[5] COLMERAUER A, 1972, SYSTEME COMMUNICATIO
[6] DEBAKKER J, 1971, RECURSIVE PROCEDURES
[7] UTILITY OF INDEPENDENT SUBGOALS IN THEOREM PROVING
ERNST, GW
[J]. INFORMATION AND CONTROL, 1971, 18 (03): : 237 - &
[8] KANOUI H, 1973, APPLICATION DEMONSTR
[9] LINEAR RESOLUTION WITH SELECTION FUNCTION
KOWALSKI, R
KUEHNER, D
[J]. ARTIFICIAL INTELLIGENCE, 1971, 2 (3-4) : 227 - 260
[10] KOWALSKI R, 1974, 1974 P IFIP C, P569

← 1 2 3 →