返回Google圖書搜尋

An Analysis of Loop Checking Mechanisms for Logic Programs

出版	University of Texas at Austin, Department of Computer Sciences, 1989
URL	http://books.google.com.hk/books?id=toPpHAAACAAJ&hl=&source=gbs_api

註釋Abstract: "We systematically study loop checking mechanisms for logic programs by considering their soundness, completeness, relative strength and related concepts. We introduce a natural concept of a simple loop check and prove that no sound and complete simple loop check exists, even for programs without function symbols. Then we introduce a number of sound simple loop checks and identify natural classes of PROLOG programs without function symbols for which they are complete. In these classes a limited form of recursion is allowed. As a by-product we obtain an implementation of the closed world assumption of Reiter [19] and a query evaluation algorithm for these classes of logic programs."