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!

Schreiben Sie den ersten Kommentar!