Well-founded semantics for deductive object-oriented database languages
- Wolfgang MayAffiliated withInstitut für Informatik, Universität Freiburg
- , Bertram LudäscherAffiliated withInstitut für Informatik, Universität Freiburg
- , Georg LausenAffiliated withInstitut für Informatik, Universität Freiburg
We present a well-founded semantics for deductive object-oriented 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.
- Well-founded semantics for deductive object-oriented database languages
- Book Title
- Deductive and Object-Oriented Databases
- Book Subtitle
- 5th International Conference, DOOD'97 Montreux, Switzerland, December 8–12, 1997 Proceedings
- pp 320-336
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.