Explicit and default negation in databases and logic programs

Authors:
Navin Viswanath
Affiliations:
Georgia State University, Atlanta, GA
Venue:
Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research
Year:
2008

Citing 17
Cited 0

Incomplete Information in Relational Databases

Journal of the ACM (JACM)
A logic for default reasoning

Readings in nonmonotonic reasoning
On closed world data bases

Readings in nonmonotonic reasoning
Indefinite and maybe information in relational databases

ACM Transactions on Database Systems (TODS)
Logic programs with classical negation

Logic programming
Logic programming with strong negation

Proceedings of the international workshop on Extensions of logic programming
A database needs two kinds of negation

MFDBS 91 Proceedings of the 3rd symposium on Mathematical fundamentals of database and knowledge base systems
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Well founded semantics for logic programs with explicit negation

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Scenario semantics of extended logic programs

Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Semantics for disjunctive logic programs with explicit and default negation

Fundamenta Informaticae
Stable models and non-determinism in logic programs with negation

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A relational model of data for large shared data banks

Communications of the ACM
Logic knowledge bases with two default rules

Annals of Mathematics and Artificial Intelligence
A Generalized Relational Model for Indefinite and Maybe Information

IEEE Transactions on Knowledge and Data Engineering
Working Models for Uncertain Data

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Degrees of exclusivity in disjunctive databases

ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Both relational databases and logic programs adopt some form of nonmonotonic reasoning in order to infer negative information. Relational databases adopt the Closed World Assumption (CWA) of Reiter. It can be easily seen that much greater expressivity is gained if negative information can be explicitly stated. This turns out to be especially true in the presence of uncertain or incomplete information in the database. The aim of this work is to investigate the handling of incomplete information in an open world setting. For logic programs, the class of extended logic programs has already been defined and studied. Of the programs declared contradictory by most of the semantics proposed so far, some programs may in fact have an appropriate meaning. In this paper, we present a new semantics for logic programs with explicit negation where the derivation of a literal is tied to the derivation of its complement.