
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Beat Wüthrich, "Probabilistic Knowledge Bases," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 5, pp. 691698, October, 1995.  
BibTex  x  
@article{ 10.1109/69.469827, author = {Beat Wüthrich}, title = {Probabilistic Knowledge Bases}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {7}, number = {5}, issn = {10414347}, year = {1995}, pages = {691698}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.469827}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Probabilistic Knowledge Bases IS  5 SN  10414347 SP691 EP698 EPD  691698 A1  Beat Wüthrich, PY  1995 KW  Axiomatic probability theory KW  data mining KW  incomplete information KW  knowledge discovery in databases KW  query optimization and approximation KW  stratified Datalog. VL  7 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] K. Apt, H.A. Blair, and A. Walker, "Towards a Theory of Declarative Knowledge," Foundations of Deductive Databases and Logic Programming, J. Minker, ed., pp. 89148. Morgan Kaufmann, 1988.
[2] F. Baader,“A formal definition for the expressive power of knowledge representation languages,” Proc. European Conf. Artificial Intelligence, L.C. Aiello, ed., pp. 5358, 1990.
[3] F. Bacchus,Representing and reasoning with probabilistic knowledge, MIT Press, 1990.
[4] D. Barbara,H. GarciaMolina,, and D. Porter,“A probabilistic relational data model,” Proc. Advances in Database Technology (EDBT 90), F. Bancilhon, C. Thanos, and D. Tsichritzis, eds., pp. 6074, 1990.
[5] A.K. Chandra, "Theory of Database Queries," Proc. PODS88, 1988.
[6] P. Dagum and M. Luby,“Approximating probabilistic inference in Bayesian belief networks is NPhard,” Aritificial Intelligence, vol. 60, pp.141153, 1993.
[7] S. Dzeroski and N. Lavrac,“Inductive learning in deductive databases,” IEEE Trans. Knowledge and Data Engineering, vol. 5, no. 6, pp. 939949, 1993.
[8] M.H. van Emden, “Quantitative Deduction and Its Fixpoint Theory,” J. Logic Programming, vol. 4, no. 1, pp. 3753, 1986.
[9] M.H. van Emden and R.A. Kowalski, “The Semantics of Predicate Logic as a Programming Language,” J. ACM, vol. 23, no. 4, pp. 733742, Oct. 1976.
[10] N. Fuhr, “A Probabilistic Framework for Vague Queries and Imprecise Information in Databases,” Proc. 16th Int'l Conf. Very Large Data Bases, pp. 696707, Aug. 1990.
[11] U. Güntzer, W. Kießling, and H. Thöne, "New Directions for Uncertainty Reasoning in Deductive Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 178187,Denver, 1991.
[12] T. Hailperin,“Probability logic,” Notre Dame J. Formal Logic, vol. 25, no. 3, pp. 198212, 1984.
[13] D. Heckermann,“Probabilistic interpretation for MYCIN’s certainty factors,” Uncertainty in Artificial Intelligence, NorthHolland, L.N. Kanal and J. F. Lemmer, eds., pp. 167196, 1986.
[14] M. Kifer and A. Li, “On the Semantics of RuleBased Expert Systems with Uncertainty,” Proc. Second Int'l Conf. Database Theory, M. Gyssens, J. Paradaens, and D. van Gucht, eds., pp. 102117, 1988.
[15] M. Kifer and V.S. Subrahmanian,“On the expressive power of annotated logic programs,” Proc. North Am. Conf. Logic Programming, E.L. Lusk and R.A. Overbeek, eds., pp. 1,0691,089, 1989.
[16] J.W. Lloyd, Foundations of Logic Programming, Springer Series in Symbolic Computation, second ed. New York: SpringerVerlag, 1987.
[17] R. Ng and V.S. Subrahmanian, "Probabilistic Logic Programming," Information and Computation, vol. 101, no. 2, pp. 150201, 1992.
[18] R. Ng and V.S. Subrahmanian,“Stable semantics for probabilistic deductive databases,” Information and Computation, vol. 110, pp. 4283, 1994.
[19] R.T. Ng and V.S. Subrahmanian,“A semantical framework for supporting subjective and conditional probabilities in deductive databases,” Proc. Int’l Conf. Logic Programming, K. Furukawa, ed., pp. 565580, 1991.
[20] R.T. Ng and V.S. Subrahmanian,“Relating DempsterShafer theory to stable semantics,” Proc. Int’l Symp. Logic Programming, V. Saraswat and K. Ueda, eds., pp. 551565, 1991.
[21] N. Nilsson, "Probabilistic Logic," Artificial Intelligence, vol. 28, pp. 7187, 1986.
[22] E. Parzen,Modern Probability Theory and its Applications, John Wiley&Sons, 1960.
[23] J. Pearl,“Probabilistic semantics for nonmonotonic reasoning: A survey,” Readings in Uncertain Reasoning, G. Shafer and J. Pearl, eds., Morgan Kaufmann, pp. 699710, 1990.
[24] P. Schäble and B. Wüthrich,“On the expressive power of query languages,” ACM TOIS, vol. 12, no. 1, pp. 6791, 1994.
[25] E.Y. Shapiro,“Logic programs with uncertainties: A tool for implementing rulebased systems,“ Proc. Eighth Int’l Joint Conf. Artificial Intelligence, A. Bundy, ed., pp. 329352, 1983.
[26] B. Wüthrich,“Towards probabilistic knowledge bases,” Proc. Logic Programming and Automated Reasoning, SpringerVerlag, Lecture Notes in Artifical Intelligence, pp. 6667, 1992.
[27] B. Wüthrich,“Knowledge discovery in databases,” Technical Report No. CS942,Hong Kong Univ. of Science and Tech nology, draft of manuscript of postgraduate course, 1994.
[28] B. Wüthrich,“Some proofs about probabilistic knowledge bases,” Technical Report No. CS9418,Hong Kong Univ. of Science and Tech nology, 1994.