Transformation based bottom up computation of the well-founded model

Abstract: "We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by Brass and Dix [BD95b, BD95c]. However, their 'residual program' can grow to exponential...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Zukowski, Ulrich (VerfasserIn)
Weitere Verfasser:	Freitag, Burkhard (VerfasserIn), Brass, Stefan (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	Passau 1996
Schriftenreihe:	Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1996,20
Schlagworte:	Databases > Logic programming > Informatik > Theoretische Informatik > Mathematik
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Bestellen

Beschreibung
Zusammenfassung:	Abstract: "We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by Brass and Dix [BD95b, BD95c]. However, their 'residual program' can grow to exponential size, whereas for function-free programs our 'program remainder' is always polynomial in the size, i.e. the number of tuples, of the extensional database (EDB). As in the SLG-resolution of Chen and Warren [CS93, CSW95, CW96], we do not only delay negative but also positive literals if they depend on delayed negative literals. When disregarding goal-directedness, which needs additional concepts, our approach can be seen as a simplified bottom-up version of SLG-resolution applicable to range-restricted Datalog programs. Since our approach is also closely related to the alternating fixpoint procedure [VG89, VG93], it can possibly serve as a basis for an integration of the resolution-based, fixpoint-based, and transformation- based evaluation methods."
Beschreibung:	48, 5 S.