Uncertain deductive databases: A hybrid approach

Information Systems

Volumn 22, Issue 8, 1997, Pages 483-508

  Lakshmanan, Laks V S ^a   Sadri, Fereidoon ^b  

^a Dept of Electrical and Computer Engineering   (Canada)

^b UNIVERSITY OF NORTH CAROLINA AT GREENSBORO   (United States)

Author keywords

Containment and Equivalence; Deductive Databases; Knowledge Base Systems; Logic Programming; Query Optimization; Time Complexity; Uncertain Information

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; DATA ACQUISITION; DATA HANDLING; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING; MATHEMATICAL MODELS;

DEDUCTIVE INFORMATION SOURCE TRACKING (DIST) MODEL; UNCERTAIN DEDUCTIVE DATABASES;

DATABASE SYSTEMS;

EID: 0031388493     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0306-4379(97)00030-6     Document Type: Article

References (43)

1. S. Abiteboul, P. Kanellakis, and G. Grahne. On the representation and querying of sets of possible worlds. Theoretical Computer Science, 78(1):158-187 (1991).
2. A. Aho, Y. Sagiv, and J.D. Ullman. Equivalences among relational expressions. SIAM J. Computing, 8(2):218-246 (1979).
3. V.S. Alagar, F. Sadri, and J.N. Said. Semantics of an extended relational model for managing uncertain information. In Proceedings of Fourth International Conference on Information and Knowledge Management, pp. 234-240 (1995).
4. K.R. Apt. Introduction to logic programming. In van Leeuwen, editor, Handbook of Theoretical Computer Science, North Holland (1986).
5. K.R. Apt, H.A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, Morgan- Kaufmann (1988).
6. F. Bancilhon, D. Maier, Y. Sagiv, and J.D. Ullman. Magic sets and other strange ways to implement logic programs. In Proc. ACM Symp. PODS, pp. 1-15 (1986).
7. D. Barbara, H. Garcia-Molina, and D. Porter. The management of probabilistic data. IEEE Transactions on Knowledge and Data Engineering, 4(5):487-502 (1992).
8. R. Chakhtoura, L.V.S. Lakshmanan, and S. Vallurupalli. Implementation of the Information Source Tracking Method for Deductive Databases on Coral. Technical report, Concordia University (1994).
9. A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. 9th Annual ACM Symp. on the Theory of Computing, pp. 77-90 (1977).
10. F. Dong and L.V.S. Lakshmanan. Intuitionistic interpretation of deductive databases with incomplete information. Theoretical Computer Science, 133(2):267-306 (1994).
11. R. Fagin, J. Halpern, and N. Meggido. A logic for reasoning about probabilities. Information and Computation (1992).
12. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979).
13. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. 5th Conf. and Symposium on Logic Programming, pp. 1071-1080. Seattle, Washington, IEEE, NY (1988).
14. U. Güntzer, W. Kießling, and H. Thöne. New directions for uncertainty reasoning in deductive databases. In Proc. ACM SIGMOD Intl. Conf. on Management of Data, pp. 178-187 (1991).
15. Y.E. Ioannidis and R. Ramakrishnan. Containment of conjunctive queries: Beyond relations as sets. ACM Transactions on Database Systems, 20 (3):288-324 (1995).
16. M. Kifer and A. Li. On the semantics of rule-based expert systems with uncertainty. In M. Gyssens, J. Paradaens, and D. van Gucht, editors, 2nd Intl. Conf. on Database Theory, pp. 102-117, Bruges, Belgium. Springer-Verlag LNCS-326 (1988).
17. M. Kifer, and V.S. Subrahmanian. Theory of generalized annotated logic programming and its applications. Journal of Logic Programming, 12(3&4):335-367 (1992).
18. L.V.S. Lakshmanan. An epistemic foundation for logic programming with uncertainty. In Proc. Intl. Conf. on Foundations of Software Technology and Theoretical Computer Science, Madras, India. Springer Verlag, Lecture Notes in Computer Science, Volume 880 (1994).
19. L.V.S. Lakshmanan and F. Sadri. Probabilistic deductive databases. In Proc. Intl. Logic Programming Symposium, pp. 254-268, Ithaca, NY. MIT Press (1994).
20. L.V.S. Lakshmanan and F. Sadri. Modeling uncertainty in deductive databases. In Proc. Intl. Conf. on Database and Expert Systems Applications (DEXA '94), pp. 724-733, Athens, Greece. Springer-Verlag, LNCS-856 (1994).
21. S.K. Lee. An extended relational database model for uncertain and imprecise information an evidential approach. In Proc. of the Intl. Conf. on Very Large Data Bases, pp. 211-220 (1992).
22. K.S. Lee. Imprecise and uncertain information in databases: An evidential approach. In Proceedings of the Intl. Conf. on Data Engineering, pp. 614-621 (1992).
23. K.C. Liu, and R. Sunderraman. Indefinite and maybe information in relational databases. ACM Transactions on Database Systems, 15(1):1-39 (1990).
24. K.C. Liu, and R. Sunderraman. A generalized relational model for indefinite and maybe information. IEEE Transactions on Knowledge and Data Engineering, 3(1):65-77 (1991).
25. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag (1987).
26. A. Motro. Integrity = validity + completeness. ACM Transactions on Database Systems, 14(4):480-502 (1989).
27. R.T. Ng, and V.S. Subrahmanian. A semantical framework for supporting subjective and conditional probabilities in deductive databases. Automated Reasoning, 10(2):191-235 (1993).
28. R.T. Ng, and V.S. Subrahmanian. Stable semantics for probabilistic deductive databases. Information and Computation, 110(1):42-83 (1994).
29. N. Nilsson. Probabilistic logic. AI Journal, 28:71-87 (1986).
30. R. Ramakrishnan. Magic templates: A spellbinding approach to logic programs. In Proc. 5th Intl. Conf. on Logic Programming, pp. 140-159 (1988).
31. F. Sadri. Reliability of answers to queries in relational databases. IEEE Transactions on Knowledge and Data Engineering, 3(2) (1991).
32. F. Sadri. Aggregate operations in information source tracking method. Theoretical Computer Science, 133:421-442 (1994).
33. F. Sadri. Information source tracking method: Efficiency issues. IEEE Transactions on Knowledge and Data Engineering, 7(6):947-954 (1995).
34. F. Sadri. Integrity constraints in the information source tracking method. IEEE Transactions on Knowledge and Data Engineering, 7(1):106-119 (1995).
35. F. Sadri. Modeling uncertainty in databases. In Proc. 7th IEEE Intl. Conf. on Data Eng., pp. 122-131 (1991).
36. Y. Sagiv. Optimizing datalog programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 659-698, Morgan-Kaufmann (1988).
37. O. Shmueli. Decidability and expressiveness aspects of logic queries. In ACM Principles of Databases Systems, pp. 237-249 (1987).
38. A. Silberschatz, M. Stonebraker, and J.D. Ullman. Database systems: Achievements and opportunities. Communications of the ACM, 34:110-120 (1991).
39. J.D. Ullman. Bottom-up beats top-down for datalog. In Proc. ACM Symp. PODS, pp. 140-149 (1989).
40. J.D. Ullman. Principles of Database and Knowledge-Base Systems, volume II. Computer Science Press, Maryland (1989).
41. M.H. van Emden. Quantitative deduction and its fixpoint theory. Journal of Logic Programming, 4(1):37-53 (1986).
42. M.H. van Emden, and R.A. Kowalski. The semantics of predicate logic as a programming language. JACM, 23(4):733-742 (1976).
43. A. van Gelder, K. Ross, and J.S. Schlipf. Unfounded sets and well-founded semantics of general logic programs. In Proc. 7th Symposium on Principles of Database Systems, pp. 221-230, Austin, Texas. New York: Association for Computing Machinery (1988).