We present a well-founded semantics for deductive object-oriented database languages by applying the alternating-fixpoint characterization of the well-founded model to them. In order to compute the state sequence, states are explicitely 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. The method is also applicable to arbitrary languages which provide a sufficiently flexible syntax and semantics. Given an implementation of the underlying database language, any program given in this language can be evaluated wrt. the well-founded semantics.

[PS-File]
[Extended set of slides]