Expressive power and complexity of partial models for disjunctive deductive databases

This paper investigates the expressive power and complexity of partial model semantics for disjunctive deductive databases. In particular, partial stable, regular model, maximal stable (M-stable), and least undefined stable (L-stable) semantics for function-free disjunctive logic programs are consid...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 206; H. 1; S. 181 - 218
Hauptverfasser: Eiter, Thomas, Leone, Nicola, Saccá, Domenico
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 06.10.1998
Elsevier
Schlagworte:
Applied sciences
Complexity
Computer science; control theory; systems
Deductive databases
Disjunctive logic programming
Exact sciences and technology
Expressive power
Information systems. Data bases
Memory organisation. Data processing
Partial model semantics
Programming languages
Software
Software engineering
Partial model semantics
Disjunctive logic programming
Expressive power
Deductive databases
Complexity
Disjunctive database
Query language
Deductive database
Decidability
Database query
Semantics
Database
Context free grammar
NP complete problem
Logical programming
Computational complexity
Inference rule
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper investigates the expressive power and complexity of partial model semantics for disjunctive deductive databases. In particular, partial stable, regular model, maximal stable (M-stable), and least undefined stable (L-stable) semantics for function-free disjunctive logic programs are considered, for which the expressiveness of queries based on possibility and certainty inference is determined. On the complexity side, we determine the data and expression complexity of query evaluation. The analysis pays particular attention to the impact of syntactical restrictions on programs in the form of limited use of disjunction and negation. It appears that the considered semantics capture complexity classes at the lower end of the polynomial hierarchy. In fact, each class ∑ i P , Π i P , 1 ⩽ i⩽ 3 is captured by some semantics using appropriate syntactical restrictions. Partial stable models have exactly the same expressive power and complexity as total stable models (∑ 2 P resp. Π 2 P ), while a higher degree of expressiveness is obtained by the semantics which minimize undefinedness (M-stable, regular, and L-stable semantics). In particular, L-stable semantics has the highest expressive power (∑ 3 P resp. Π 3 P ). An interesting result in this course is that, in contrast with total stable models, negation is for partial stable models more expressive than disjunction. For the data complexity of queries, we obtain completeness results for the classes ∑ i P , Π i P , i⩽3, and, for the expression complexity, completeness results for the analogous classes at the lower end of the weak exponential hierarchy. The results of this paper complement and extend previous results, and contribute to a more complete picture of the computational aspects of disjunctive logic programming and databases, which supports in choosing an appropriate setting that fits the needs in practice.
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(97)00129-1