登入選單

返回Google圖書搜尋

Kernel

Simon Fraser University. Centre for Systems Science

出版	Simon Fraser University, Centre for Systems Science, 1992
URL	http://books.google.com.hk/books?id=EAFIjwEACAAJ&hl=&source=gbs_api

註釋

This paper introduces a style of semantics for logic programs called kernel/congruence semantics. The kernel/congruence approach solves two problems in logic programming semantics: the problem of the Clark-Andreka-Nemeti anomaly that makes success and failure asymmetric, and more significantly, the problem of characterizing the gap between breadth-first and depth-first processing of queries. The essence of the approach is the definition of a kernel of queries which succeed or fail with respect to any program, and the definition of the set of successful or failing queries for a given program via the fold/unfold congruence suggested by that program. The paper presents the basic results about kernels and discusses the technical and philosophical ramifications of the kernel/congruence semantics. It also presents breadth-first semantics in a form which is very close to that of the depth-first semantics.