Processing Deductive Databases under the Disjunctive Stable Model Semantics

Authors:
C.A. Johnson
Affiliations:
(Correspd.) Department of Computer Science, University of Keele, Staffordshire, England. chrisj@cs.keele.ac.uk
Venue:
Fundamenta Informaticae
Year:
1999

Citing 10
Cited 0

On the declarative semantics of deductive databases and logic programs

Foundations of deductive databases and logic programming
Compiling the GCWA in indefinite deductive databases

Foundations of deductive databases and logic programming
Foundations of disjunctive logic programming

Foundations of disjunctive logic programming
View updates in stratified disjunctive databases

Journal of Automated Reasoning
Top-down query processing in indefinite stratified databases

Data & Knowledge Engineering
On cyclic covers and perfect models

Data & Knowledge Engineering
Deduction Trees and the View Update Problem in Indefinite Deductive Databases

Journal of Automated Reasoning
WF³: A Semantics for Negation in Normal Disjunctive Logic Programs

ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
Semantics for disjunctive logic programs

Semantics for disjunctive logic programs
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cyclic covers are shown to characterise disjunctive stable models of unstratified deductive databases, and to facilitate top-down query processing, query compilation and view updating under the disjunctive stable model semantics. Such processing is shown to be more complex than comparable processing of stratified databases.