Partial semantics for disjunctive deductive databases

Extended abstract
  • Thomas Eiter
  • Nicola Leone
  • Domenico Saccà
Theoretical Aspects 1

DOI: 10.1007/BFb0034711

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)
Cite this paper as:
Eiter T., Leone N., Saccà D. (1996) Partial semantics for disjunctive deductive databases. In: Wagner R.R., Thoma H. (eds) Database and Expert Systems Applications. DEXA 1996. Lecture Notes in Computer Science, vol 1134. Springer, Berlin, Heidelberg

Abstract

We consider in this paper interesting subclasses of partial stable models which reduce the degree of undefinedness, namely M-stable (Maximal-stable) models, which coincide with regular models, preferred extension, and maximal stable classes, and L-stable (Least undefinedstable) models, and we extend them from normal to disjunctive deductive databases.

L-stable models are shown to be the natural relaxation of the notion of total stable model; on the other hand the less strict M-stable models, endowed with a modularity property, may be appealing from the programming and computational point of view. M-stable and L-stable models are also compared with regular models on disjunctive deductive databases. It appears that, unlike on normal deductive databases, M-stable models do not coincide with regular models. Moreover, both M-stable and L-stable models satisfy the CWA principle, while regular models do not.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Thomas Eiter
    • 1
  • Nicola Leone
    • 1
  • Domenico Saccà
    • 2
  1. 1.Christian Doppler Lab for Expert Systems Institut für InformationssystemeTU WienWienAustria
  2. 2.DEIS-UNICALUniversità della CalabriaRendeItaly

Personalised recommendations