On a theory of probabilistic deductive databases

Theory and Practice of Logic Programming

Volumn 1, Issue 1, 2001, Pages 5-42

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

^a Gina Cody School of Engineering and Computer Science   (Canada)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

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

Author keywords

Deductive databases; Probabalistic databases; Uncertain databases

Indexed keywords

EID: 0141874545     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068400001058     Document Type: Article

References (48)

1. Abiteboul, S., Kanellakis, P. and Grahne, G. (1991) On the representation and querying of sets of possible worlds. Theor. Comput. Sci. 78, 159-187.
2. Baldwin, J. F. (1987) Evidential support logic programming. J. Fuzzy Sets and Systems, 24, 1-26.
3. Baldwin, J. F. and Monk, M. R. M. (1987) Evidence theory, fuzzy logic, and logic programming. Tech. Report ITRC No. 109. University of Bristol, Bristol, UK.
4. Barbara, D., Garcia-Molina, H. and Porter, D. (1990) A probabilistic relational data model. Proc. Advancing Database Technology, EDBT, 90, pp. 60-64.
5. Barbara, D., Garcia-Molina, H. and Porter, D. (1992) The management of probabilistic data. IEEE Trans. Knowledge & Data Eng. 4(5), 487-502.
6. Blair, H. A. and Subrahmanian, V. S. (1989a) Paraconsistent foundations for logic programming. J. Non-classical Logic, 5(2), 45-73.
7. Blair, H. A. and Subrahmanian, V. S. (1989b) Paraconsistent logic programming. Theor. Comput. Sci. 68, 135-154.
8. Boole, G. (1854) The Laws of Thought. London: Mcmillan.
9. Carnap, R. (1962) The Logical Foundations of Probability. University of Chicago Press.
10. Debray, S. and Ramakrishnan, R. (1994) Generalized Horn clause programs. Manuscript.
11. Dekhtyar, A. and Subrahmanian, V. S. (1997) Hybrid probabilistic program. Proc. 14th Int. Conf. on Logic Programming, pp. 391-405.
12. Dong, F. and Lakshmanan, L. V. S. (1992) Deductive databases with incomplete information. Joint Int. Conf. and Symp. on Logic Programming, pp. 303-317. (Extended version available as Tech. Report, Concordia University, Montreal, 1993.)
13. Fagin, R., Halpern, J. and Megiddo, N. (1990) A logic for reasoning about probabilities. Infor. & Computation, 87(1/2), 78-128.
14. Fenstad, J. E. (1980) The structure of probabilities defined on first-order languages. In: Jeffrey, R. C. (ed), Studies in Inductive Logic and Probabilities, volume 2, pp. 251-262. University of California Press.
15. Fitting, M. C. (1988) Logic programming on a topological bilattice. Fundamenta Informaticae, 11, 209-218.
16. Fitting, M. C. (1991) Bilattices and the semantics of logic programming. J. Logic Programming, 11, 91-116.
17. Fitting, M. C. (1995) Private Communication.
18. Frechet, M. (1935) Generalizations du theoreme des probabilities totales. Fund. Math., 25, 379-387.
19. Gaifman, H. (1964) Concerning measures in first order calculi. Israel J. Math., 2, 1-17.
20. Ginsburg, M. (1988) Multivalued logics: A uniform approach to reasoning in artificial intelligence. Computational Intelligence, 4, 265-316.
21. Güntzer, U., Kießling, W. and Thöne, H. (1991) New directions for uncertainty reasoning in deductive databases. Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 178-187.
22. Hailperin, T. (1984) Probability logic. Notre Dame J. Formal Logic, 25(3), 198-212.
23. Halpern, J. Y. (1990) An analysis of first-order logics of probability. J. Artificial Intelligence, 46(3), 311-350.
24. Kifer, M. and Li, A. (1988) On the semantics of rule-based expert systems with uncertainty. In: Gyssens, M., Paradaens, J. and van Gucht, D. (eds), 2nd Int. Conf. on Database Theory: LNCS 326, pp. 102-117. Springer-Verlag.
25. Kifer, M. and Lozinskii, E. L. (1989) A logic for reasoning with inconsistency. Proc. 4th IEEE Symp. on Logic in Computer Science (LICS), pp. 253-262 . IEEE Computer Press.
26. Kifer, M. and Lozinskii, E. L. (1992) A logic for reasoning with inconsistency. J. Automated Reasoning, 9(2), 179-215.
27. Kifer, M. and Subrahmanian, V. S. (1992) Theory of generalized annotated logic programming and its applications. J. Logic Programming, 12, 335-367.
28. Lakshmanan, L. V. S. (1994) An epistemic foundation for logic programming with uncertainty. Proc. Int. Conf. on Foundations of Software Technology and Theoretical Computer Science: Lecture Notes in Computer Science 880. Springer-Verlag.
29. Lakshmanan, L. V. S. and Sadri, F. (1994a) Modeling uncertainty in deductive databases. Proc. Int. Conf. on Database and Expert Systems Applications (DEXA '94): LNCS 856, pp. 724-733. Springer-Verlag.
30. Lakshmanan, L. V. S. and Sadri, F. (1994b) Probabilistic deductive databases. Proc. Int. Logic Programming Symposium, pp. 254-268. Ithaca, NY: MIT Press.
31. Lakshmanan, L. V. S. and Sadri, F. (1997) Uncertain deductive databases: A hybrid approach. Information Systems, 22(8), 483-508.
32. Lakshmanan, L. V. S. and Shiri, N. (2001) A parametric approach to deductive databases with uncertainty. IEEE Trans. Knowledge & Data Eng. (Forthcoming). (A preliminary version appeared in Proc. Intl. Workshop on Logic in Databases (LID'96), Springer-Verlag, LNCS-1154, San Miniato, Italy.)
33. Lakshmanan, L. V. S., Leone, N., Ross, R. & Subrahmanian, V. S. (1997) ProbView: A Flexible Probabilistic Database System. ACM Trans. Database Syst. 22(3), 419-469.
34. Liu, Y. (1990) Null values in definite programs. Proc. North American Conf. on Logic Programming, pp. 273-288.
35. Ng, R. T. (1997) Semantic, consistency, and query processing of empirical deductive databases. IEEE Trans. Knowledge & Data Eng., 9(1), 32-495.
36. Ng, R. T. and Subrahmanian, V. S. (1991) Relating Dempster-Shafer theory to stable semantics. Tech. Report UMIACS-TR-91-49, CS-TR-2647. Institute for Advanced Computer Studies and Department of Computer Science University of Maryland, College Park, MD 20742.
37. Ng, R. T. and Subrahmanian, V. S. (1992) Probabilistic logic programming. Infor. & Computation, 101(2), 150-201.
38. Ng, R. T. and Subrahmanian, V. S. (1993) A semantical framework for supporting subjective and conditional probabilities in deductive databases. J. Automated Reasoning, 10(2), 191-235.
39. Ng, R. T. and Subrahmanian, V. S. (1994) Stable semantics for probabilistic deductive databases. Infor. & Computation, 110(1), 42-83.
40. Nilsson, N. (1986) Probabilistic logic. J. Artificial Intelligence 28, 71-87.
41. Sadri, F. (1991a) Modeling uncertainty in databases. Proc. 7th IEEE Int. Conf. on Data Eng., pp 122-131.
42. Sadri, F. (1991b) Reliability of answers to queries in relational databases. IEEE Trans. Knowledge & Data Eng. 3(2), 245-251.
43. Schmidt, H., Steger, N., Güntzer, U., Kießling, W., Azone, A. and Bayer, R. (1989) Combining deduction by certainty with the power of magic. Proc. 1st Int. Conf. on Deductive and Object-oriented Databases, pp. 103-122.
44. Steger, N., Schmidt, H., Güntzer, U. and Kießling, W. (1989) Semantics and efficient compilation for quantitative deductive databases. Proc. IEEE Int. Conf. on Data Eng., pp. 660-669.
45. Subrahmanian, V. S. (1987) On the semantics of quantitative logic programs. Proc. 4th IEEE Symposium on Logic Programming, pp. 173-182.
46. Ullman, J. D. (1989) Principles of database and knowledge-base systems. Vol. II. Computer Science Press.
47. van Emden, M. H. (1986) Quantitative deduction and its fixpoint theory. J. Logic Programming, 4(1), 37-53.
48. Vardi, M.Y. (1985) Querying logical databases. Proc. 4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pp. 57-65.