Well-Founded Semantics for Deductive Object-Oriented Database Languages

Abstract. We present awell-founded semantics for deductive objectoriented database (dood) languages by applying the alternating- xpoint characterization of the well-founded model to them. In order to compute the state sequence, states are explicitly integrated by making them rst-class citizens of the underlying language. The concept is applied to Florid, an implementation of F-Logic, previously supporting only inationary negation. Using our approach, well-founded models of F-Logic programs can be computed. The method is also applicable to arbitrary dood languages which provide a su ciently exible 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.