We present a well-founded semantics for deductive objectoriented database (dood) languages by applying the alternating-fixpoint characterization of the well-founded model to them. In order to compute the state sequence, states are explicitly integrated by making them first-class citizens of the underlying language. The concept is applied to FLORID, an implementation of F-Logic, previously supporting only inflationary negation. Using our approach, well-founded models of F-Logic programs can be computed.
展开▼
