UNDECIDABLE GOALS FOR COMPLETED ACYCLIC PROGRAMS

被引：0
|
作者：
BEZEM, M [1 ]
KEUZENKAMP, J [1 ]
机构：
[1] PROJECTORG AI & AA,3500 GW UTRECHT,NETHERLANDS
来源：
NEW GENERATION COMPUTING | 1994年 / 12卷 / 02期
关键词：
LOGIC PROGRAMMING; AUTOMATIC THEOREM PROVING; THEORY OF COMPUTATION;
D O I：
10.1007/BF03037342
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We prove for a well-known acyclic logic program P that it is undecidable whether or not a given goal is a logical consequence of the completion of P. This complements recent decidability results for acyclic programs and bounded goals.
引用
收藏
页码：209 / 213
页数：5
相关论文
共 50 条
12345