Query Compilation under the disjunctive well-founded semantics

Authors:
Chris A. Johnson
Affiliations:
School of Computing, Portland Square, University of Plymouth, Plymouth, PL4 8AA, England
Venue:
Fundamenta Informaticae
Year:
2004

Citing 15
Cited 0

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
Processing deductive databases under the disjunctive stable model semantics

Fundamenta Informaticae
Deduction Trees and the View Update Problem in Indefinite Deductive Databases

Journal of Automated Reasoning
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA

Journal of Automated Reasoning
On the Computation of the Disjunctive Well-Founded Semantics

Journal of Automated Reasoning
Duality for Goal-Driven Query Processing in Disjunctive 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
Nonmonotonic reasoning: towards efficient calculi and implementations

Handbook of automated reasoning
Top-Down Query Processing in First-Order Deductive Databases under the DWFS

Journal of Automated Reasoning
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
DisLoP: a research project on Disjunctive Logic Programming

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A top-down method is presented for compiling queries in unstratified propositional disjunctive deductive databases under the disjunctive well-founded semantics. Compilation entails the construction of a set of compilation trees, and the run-time processing of the compiled query then amounts to checking that some such tree can be extended within the extensional database to yield a tree that encapsulates a proof of the original query. Issues surrounding the extension of our techniques to the first order level are discussed.