BOUNDEDNESS IS UNDECIDABLE FOR DATALOG PROGRAMS WITH A SINGLE RECURSIVE RULE

被引：19

作者：

ABITEBOUL, S

机构：

来源：

关键词：

D O I：

10.1016/0020-0190(89)90019-7

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：281 / 287

页数：7

共 11 条

[1]

COSMADAKIS SS, 1986, 5TH P ACM S PRINC DA, P280

[2]

COSMADAKIS SS, 1988, 20TH P ACM S THEOR C, P477

[3]

GAIFMAN H, 1987, 2ND P IEEE S LOG COM, P106

[4]

IOANNIDIS YE, 1985, 11TH P INT C VER LAR, P219

[5] ON THE FOUNDATIONS OF THE UNIVERSAL RELATION MODEL [J].

MAIER, D ;

ULLMAN, JD ;

VARDI, MY .

ACM TRANSACTIONS ON DATABASE SYSTEMS, 1984, 9 (02) :283-308

[6]

NAUGHTON JF, 1986, 5TH P ACM S PRINC DA, P267

[7]

NAUGHTON JF, 1986, 6TH P ACM PODS, P227

[8]

SAGIV Y, 1985, 4TH P ACM SIGACT SIG, P171

[9]

SHMUELI O, 1987, 6TH P ACM S PRINC DA, P237

[10]

VARDI MY, 1988, 7TH P ACM S PRINC DA, P341