返回Google圖書搜尋

Déjà Vu in Fixpoints of Logic Programs

出版	University of Wisconsin-Madison, Computer Sciences Department, 1989
URL	http://books.google.com.hk/books?id=MUQ0PwAACAAJ&hl=&source=gbs_api

註釋Abstract: "We investigate properties of logic programs that permit refinements in their fixpoint evaluation and shed light on the choice of control strategy. A fundamental aspect of a bottom-up computation is that we must constantly check to see if the fixpoint has been reached. If the computation iteratively applies all rules, bottom-up, until the fixpoint is reached, this amounts to checking if any new facts were produced after each iteration. Such a check also enhances efficiency in that duplicate facts need not be re-used in subsequent iterations, if we use the Seminaive fixpoint evaluation strategy