A fixpoint approach to state generation for stratifiable disjunctive deductive databases

Authors:
Andreas Behrend
Affiliations:
University of Bonn, Institute of Computer Science III, Bonn, Germany
Venue:
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Year:
2007

Citing 12
Cited 1

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs

Foundations of deductive databases and logic programming
A fixpoint semantics for disjunctive logic programs

Journal of Logic Programming
Logic programming

Handbook of theoretical computer science (vol. B)
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Foundations of disjunctive logic programming

Foundations of disjunctive logic programming
Adding disjunction to datalog (extended abstract)

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Possible World Semantics for Disjunctive Databases

IEEE Transactions on Knowledge and Data Engineering
On Indefinite Databases and the Closed World Assumption

Proceedings of the 6th Conference on Automated Deduction
Generalized Well-founded Semantics for Logic Programs (Extended Abstract)

Proceedings of the 10th International Conference on Automated Deduction
Working Models for Uncertain Data

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering

A transformation-based approach to view updating in stratifiable deductive databases

FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new fixpoint-based approach to bottom-up state generation for stratifiable disjunctive deductive databases. To this end, a new consequence operator based on hyperresolution is introduced which extends Minker's operator for positive disjunctive Datalog rules. In contrast to already existing model generation methods our approach for efficiently computing perfect models is based on state generation. Additionally, it enhances model state computation based on Minker's operator for positive disjunctive Datalog rules.