Well-founded semantics for deductive object-oriented database languages

Wolfgang May, Bertram Ludäscher, Georg Lausen

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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. The method is also applicable to arbitrary dood 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.

Original languageEnglish (US)
Title of host publicationDeductive and Object-Oriented Databases - 5th International Conference, DOOD 1997, Proceedings
EditorsFrancois Bry, Raghu Ramakrishnan, Kotagiri Ramamohanarao
Number of pages17
ISBN (Print)3540637923, 9783540637929
StatePublished - 1997
Externally publishedYes
Event5th International Conference on Deductive and Object-Oriented Databases, DOOD 1997 - Montreux, Switzerland
Duration: Dec 8 1997Dec 12 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other5th International Conference on Deductive and Object-Oriented Databases, DOOD 1997

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Well-founded semantics for deductive object-oriented database languages'. Together they form a unique fingerprint.

Cite this