THE DEFINING POWER OF STRATIFIED AND HIERARCHICAL LOGIC PROGRAMS

被引：10

作者：

JAGER, G ^{[1
]}

STARK, RF ^{[1
]}

机构：

[1] INST INFORMAT & ANGEW MATH,CH-3012 BERN,SWITZERLAND

来源：

JOURNAL OF LOGIC PROGRAMMING | 1993年 / 15卷 / 1-2期

关键词：

D O I：

10.1016/0743-1066(93)90013-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We investigate the defining power of stratified and hierarchical logic programs. As an example for the treatment of negative information in the context of these structured programs we also introduce a stratified and hierarchical closed-world assumption. Our analysis tries to relate the defining power of stratified and hierarchical programs (with and without an appropriate closed-world assumption) very precisely to notions and hierarchies in classical definability theory.

引用

页码：55 / 77

页数：23

共 18 条

[1]

ANDREKA H, 1978, ACTA CYBERNET, V4, P3

[2]

Apt K., 1987, FDN DEDUCTIVE DATABA, P89

[3]

Apt K. R., 1991, Fundamenta Informaticae, V14, P339

[4]

Apt K. R., 1990, Fundamenta Informaticae, V13, P1

[5]

APT KR, 1990, HDB THEORETICAL COMP, P495

[6]

Barwise Jon., 1975, PERSPECTIVES MATH LO

[7]

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

[8] ON THE RELATIONSHIP BETWEEN CIRCUMSCRIPTION AND NEGATION AS FAILURE [J].

GELFOND, M ;

PRZYMUSINSKA, H ;

PRZYMUSINSKI, T .

ARTIFICIAL INTELLIGENCE, 1989, 38 (01) :75-94

[9]

Hinman PG, 1978, RECURSION THEORETIC

[10]

KUNEN K, 1987, 4TH P INT C LOG PROG, P219

← 1 2 →