Theory and Compilation of Data Intensive Logic Programs

在过去的十年里，Horn子句逻辑程序设计作为一种关系数据库的查询语言的高效实现问题引起了人们的广泛关注，人工智能和数据库领域的研究人员已经提出了几种方法。该建议涉及如何有效地实现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.