UNDECIDABLE OPTIMIZATION PROBLEMS FOR DATABASE LOGIC PROGRAMS

被引：40
|
作者：
GAIFMAN, H
MAIRSON, H
SAGIV, Y
VARDI, MY
机构：
[1] BRANDEIS UNIV,DEPT COMP SCI,WALTHAM,MA 02254
[2] IBM CORP,ALMADEN RES CTR,SAN JOSE,CA 95120
[3] SRI INT,CTR ARTIFICIAL INTELLIGENCE,MENLO PK,CA 94025
[4] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305
来源：
JOURNAL OF THE ACM | 1993年 / 40卷 / 03期
关键词：
LANGUAGES; THEORY; BOUNDEDNESS; DATABASE; DATALOG; LOGIC PROGRAM; OPTIMIZATION; QUERY LANGUAGE; RECURSION; UNDECIDABILITY;
D O I：
10.1145/174130.174142
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Datalog is the language of logic programs without function symbols. It is used as a database query language. If it is possible to eliminate recursion from a Datalog program P, then P is said to be bounded. It is shown that the problem of deciding whether a given Datalog program is bounded is undecidable, even for linear programs (i.e., programs in which each rule contains at most one occurrence of a recursive predicate). It is then shown that every semantic property of Datalog programs is undecidable if it is stable, is strongly nontrivial, and contains
引用
收藏
页码：683 / 713
页数：31
相关论文
共 50 条
12345