Top-Down Query Processing in First Order Deductive Databases under the DWFS

Authors:
C. A. Johnson
Affiliations:
-
Venue:
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Year:
2000

Citing 8
Cited 0

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
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
A Tableau Calculus for Minimal Model Reasoning

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Semantics for disjunctive logic programs

Semantics for disjunctive logic programs
DisLoP: a research project on Disjunctive Logic Programming

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation of the DWFS in terms of the Gelfond-Lifschitz transformation, and employs a hyper-resolution like operator and quasi cyclic trees to handle minimal model processing. The method is correct and complete, and can be guaranteed to terminate given certain mild constraints on the format of database rules. The efficiency of the method may be enhanced by the application of partial compilation, subgoal re-ordering, and further constraints on the format of database rules. For finite propositional databases the method runs in polynomial space.