作者: Raghu Ramakrishnan , Divesh Srivastava , S. Sudarshan
DOI: 10.1007/978-1-4615-3506-5_11
关键词:
摘要: In recent years, much work has been directed towards evaluating logic programs and queries on deductive databases by using an iterative bottom-up fixpoint computation. The resulting techniques offer attractive alternative to Prolog-style top-down evaluation in several situations. They are sound complete for positive Horn clause programs, well-suited applications with large volumes of data (facts), can support a variety extensions the standard programming paradigm.