Title: Efficient Computation of the Well-Founded Model Using Update Propagation
Abstract: In this paper we present a bottom-up algorithm for computing the well-founded model of general normal logic programs by means of range-restricted Datalog ⌝ rules automatically generated from the source program. The drawback of repeated computation of facts from which Van Gelder’s alternating fixpoint procedure is sufiering is avoided by using update propagation rules, generalizing the difierential fixpoint computation well-known for stratifiable deductive databases.
Publication Year: 2001
Publication Date: 2001-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot