Algebraic evaluation of disjunctive deductive databases

Authors:
Rajshekhar Sunderraman
Affiliations:
Computer Science Department, The Wichita State University, Wichita, Kansas
Venue:
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Year:
1992

Citing 8
Cited 0

Design overview of the NAIL] system

Proceedings on Third international conference on logic programming
Compiling the GCWA in indefinite deductive databases

Foundations of deductive databases and logic programming
A logical language for data and knowledge bases

A logical language for data and knowledge bases
A fixpoint semantics for disjunctive logic programs

Journal of Logic Programming
An algebraic approach to indefinite deductive databases

Methodologies for intelligent systems, 5
A Generalized Relational Model for Indefinite and Maybe Information

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

Proceedings of the 6th Conference on Automated Deduction
The POSTGRES Papers

The POSTGRES Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algebraic approach to evaluate non-Horn rules in disjunctive databases is presented. Tabular structures, called C-tables, are used to represent disjunctive facts. Algebraic operations on C-tables are used to evaluate non-Horn rules. A new operator called Project-Or is introduced which enables us to compute disjunctive facts implied by the non-Horn rules.