Theory and Compilation of Data Intensive Logic Programs

Horn子句逻辑程序设计的有效实现问题 作为关系数据库的查询语言， 在过去的十年里，人们注意到了一些方法， 人工智能和数据库领域的研究人员。 这 一项提案涉及霍恩条款的有效实施 编程作为关系数据库的查询语言。 重点 是保持逻辑完整性，并在 大量事实的存在。 在本建议中，我们审查了一系列重要问题：（1）编制- 时间规则重写策略;（2）安全性和有效的可计算性 （3）并行评估问题，以及（4） 设计和使用基于逻辑的查询语言。

The problem of efficient implementation of Horn clause logic programming as a query language for relational databases has attracted much attention in the past decade, and several methods have been proposed by researchers in the areas of Artificial Intelligence and Databases. This proposal is concerned with the efficient implementation of Horn clause programming as a query language for relational databases. The emphasis is on preserving logical completeness and performing efficiently in the presence of large numbers of facts. In this proposal, we examine a range of important issues: (1) Compile- time rule rewriting strategies, (2) Safety and effective computability of queries, (3) Parallel evaluation issues, and (4) Language issues in designing and using a logic-based query language.