Fixed point theorems in logic programming

被引：15

作者：

Khamsi, MA ^{[1
]}

Misane, D

机构：

[1] Univ Texas, Dept Math Sci, El Paso, TX 79968 USA

[2] Univ Mohammed 5, Fac Sci, Dept Math, Rabat, Morocco

来源：

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE | 1997年 / 21卷 / 2-4期

关键词：

Point Theorem; Logic Program; Logic Programming; Banach Contraction Principle; Disjunctive Program;

D O I：

10.1023/A:1018969519807

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We discuss two major fixed point theorems which are based on a notion of completeness. Although the spaces involved are of different nature, there is a similarity between the two theorems.

引用

页码：231 / 243

页数：13

共 11 条

[1]

[Anonymous], J METHODS LOGIC COMP

[2]

Baral C. R., 1992, Journal of Automated Reasoning, V8, P345, DOI 10.1007/BF02341854

[3]

FITTING M, 1993, IN PRESS J LOGIC PRO

[4]

Gelfound M., 1988, Logic Programming: Proceedings of the Fifth International Conference and Symposium, P1070

[5]

Kelley John L., 1975, GEN TOPOLOGY

[6]

KHAMSI MA, 1993, P ILPS 93 WORKSH LOG

[7]

KHAMSI MA, DISJUNCTIVE SIGNED L

[8] SIGNED DATA DEPENDENCIES IN LOGIC PROGRAMS [J].

KUNEN, K .

JOURNAL OF LOGIC PROGRAMMING, 1989, 7 (03) :231-245

[9]

LOYD JW, 1987, FDN LOGIC PROGRAMMIN

[10]

Tarski A., 1955, PAC J MATH, P285, DOI [10.2140/pjm.1955.5.285, DOI 10.2140/PJM.1955.5.285]

← 1 2 →