Algebraic evaluation of disjunctive deductive databases
Pages 415 - 422
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.
References
[1]
Jose Alberto Fernandes and Jack Minker. Bottom-up evaluation of hierarchical disjunctive deductive databases. In Koichi Furukaws, editor, Logic Progeamming: Proceedings of the Eighth internationel Conference. MIT Press, 1991.
[2]
John Grant and Jack Minker. Answering queries in indefinite data~ and the null value problem. In Advances in Competing Research, Volume 5, pages 247-267. JAI Press inc., 1986.
[3]
John Grant and Jack Minker. Deductive database theories. UMIACS-TR-89-'~7, CS- TR-2293, Department of Computer Science, University of Maryland, College Park, MD 20742, 1989.
[4]
Lawrence Henschen and Hyuing-Sik Park. Compiling the GCWA in indefinite deductive databases. In Jack Minker, editor, Foundations of Deductive Databases and Logic Progeamming, pages 395-438. Morgan Kttufmann, Los Altos, CA, 1988.
[5]
Tomass Imieli6ski and Witold Lipski J r. On representing incomplete information in a relational database. In Proceedings of the 7th International Conference on VeT.y Large Data Beaus, Cannes, France, pages 389-39?, New York, September 1981. IEEE.
[6]
Ken-Chih Liu and Rajshekhsr Sunderrsman. An algebraic approach to indefinite deductive databa~. In Proceedings of the 5th lnier. national 5ymposilm on Methodo~s /or Intelligent Systen~, KnozviUe, Tennessee, New York, October 1990. Elsevier Press.
[7]
Ken-Chih Liu and Rajshekhax Sunderraman. A gener~ed relational model for indefinite and maybe information. IEEE 23.an,- ecfionl on Knowledge and D~ta Engineering, 3(1):65-77, 1991.
[8]
Jack Minker. On indefinite databases and the closed world assumption. In Lecture Notes in Computer Science, N138, pages 292-308. Springer-Verlag, 1982.
[9]
Jack Minker and Arcot Rajuekat. A fixpoint semantics for disjunctive logic programs. Journal of Logic Procjramming, 9:45- 74, 1990.
[10]
K. Morris, J.D. Ullman, and A. Van Guider. Design overview of the NAIL! system. In E. Shapiro, editor, Proceedings of the Third International Conference on Logic Progeam. ruing, pages 554-568. Springer-Verlag, New York, 1986.
[11]
Shamim Naqvi and Shalom Tsur. A Logic Language /or Data and Knowledge Ba~es. Computer Science Press, Rockville, MD, 1988.
[12]
Michael Stonebraker and Lawrence Rowe. The POSTGRES papers. UCB/ERL M86/85, Dept. of EECS, University of California st Berkeley, 1986.
[13]
Jefl'~ey D. Unman. Principles o/Databe.se and Ifnot~ledge-BaJe Systen~, volume i and II. Computer Science Press, Rockville, Maryland, 1988.
Index Terms
- Algebraic evaluation of disjunctive deductive databases
Recommendations
Clausal Deductive Databases and a General Framework for Semantics in Disjunctive Deductive Databases
FoIKS '00: Proceedings of the First International Symposium on Foundations of Information and Knowledge SystemsIn this paper we will investigate the novel concept of clausal deductive databases (cd-databases), which are special normal deductive databases - i.e. deductive databases which may contain default negation in rule bodies - over a meta-language Lcd with ...
Using clausal deductive databases for defining semantics in disjunctive deductive databases
This paper investigates the novel concept of i>clausal deductive databases (cd-databases), which are special normal deductive databases - i.e., deductive databases which may contain default negation in rule bodies - over a typed meta-language i>L...
A New Partial Semantics for Disjunctive Deductive Databases
We propose a new partial semantics for disjunctive deductive databases that we call disjunctive well-founded semantics. This semantics extends the classical well-founded semantics of normal databases for disjunctive databases. We give a declarative ...
Comments
Information & Contributors
Information
Published In
April 1992
574 pages
Copyright © 1992 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 1992
Check for updates
Qualifiers
- Article
Conference
CSC92
Sponsor:
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 186Total Downloads
- Downloads (Last 12 months)25
- Downloads (Last 6 weeks)9
Reflects downloads up to 03 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in