A Possible World Semantics for Disjunctive Databases

@article{Chan1993APW,
  title={A Possible World Semantics for Disjunctive Databases},
  author={Edward P. F. Chan},
  journal={IEEE Trans. Knowl. Data Eng.},
  year={1993},
  volume={5},
  pages={282-292}
}
We investigate the fundamental problem of when a ground atom in a disjunctive database is assumed false. There are basically two diierent approaches for inferring negative information for disjunctive databases; they are Minker's Generalized Closed World Assumption (GCWA) and Ross and Topor's Disjunctive Database Rule (DDR). A problem with the GCWA is that disjunctive clauses are sometimes interpreted exclusively, even when they are intended for inclusive interpretation. On the other hand, the… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
27 Extracted Citations
27 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 27 references

Alternating Fixpoint of Logic Programs with Negation," Pro- ceedings of the 8th ACM Symposium on Principles of Database Systems

  • Van Gelder, A. The
  • Philadel- phia,
  • 1989
1 Excerpt

Compiling the GCWA," Foundation of Deductive Databases and Logic Programming

  • L. J. Henschen, H. S. Park
  • 1988
2 Excerpts

Similar Papers

Loading similar papers…