论文信息 - Depth-Bounded Inference for Nonterminating Prologs - 字舞流文

Depth-Bounded Inference for Nonterminating Prologs

[1] Lutz Plüer. Termination proofs for logic programs based on predicate inequalities , 1990 .

[2] Teodor C. Przymusinski. On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[3] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.

[4] Hiroki Arimura. Completeness of Depth-bounded Resolution for Weakly Reducing Programs , 1991, Software Science and Engineering.

[5] Raymond Reiter. On Closed World Data Bases , 1977, Logic and Data Bases.