期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
On the Complexities of Non-Horn Clause Logic Programming
1
作者 聂旭民 《Journal of Computer Science & Technology》 SCIE EI CSCD 1992年第2期114-122,共9页
There have been active work to extend the Prolog style Horn Clause logic programming to non-Horn clauses.In this paper,we will analyze the complexities of several such extensions.The purpose is to understand the compu... There have been active work to extend the Prolog style Horn Clause logic programming to non-Horn clauses.In this paper,we will analyze the complexities of several such extensions.The purpose is to understand the computational complexity of these inference systems.The analyses do not prove that any one system is better than the others all the time.But they do suggest that one system may be better than the others for some particular problems.We also discuss the effect of caching. 展开更多
关键词 PROLOG On the complexities of Non-Horn clause Logic Programming
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部