论文部分内容阅读
There have been active work to extend the Prolog style Horn Clause logic programming tonon-Horn clauses.In this paper,we will analyze the complexities of several such extensions.Thepurpose is to understand the computational complexity of these inference systems.The analyses do notprove that any one system is better than the others all the time.But they do suggest that one systemmay be better than the others for some particular problems.We also discuss the effect of caching.
There have been active work to extend the Prolog style Horn Clause logic programming tonon-Horn clauses.In this paper, we will analyze the complexities of several such extensions. Thispurpose is to understand the computational complexity of these inference systems.The analyzes do notprove that any one system is better than the others all the the time.But they do suggest that one systemmay be better than the others for some particular problems.We also discuss the effect of caching.