Abstract
There is no doubt about it; an accurate representation of a real knowledge domain must be able to capture uncertainty. As the best known formalism for handling uncertainty, probability theory is often called upon this task, giving rise to probabilistic ontologies. Unfortunately, things are not as simple as they might appear, and different choices made can deeply affect the semantics and computational properties of probabilistic ontology languages. In this tutorial, we explore the main design choices available, and the situations in which they may be meaningful or not. We then dive deeper into a specific family of probabilistic ontology languages which can express logical and probabilistic dependencies between axioms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
As is standard in probability theory, we use concatenation to denote intersection. That is, XY stands for the event \(X\cap Y\).
- 2.
Again, as usual in probability theory, \(\overline{X}\) denotes the event \(\varOmega \setminus X\); that is, the negation of X.
- 3.
Alternatively, read the second statement as āthe probability of rain tomorrow is 0.3ā.
- 4.
Note that by definition of ontology languages, any subset of an ontology is also an ontology; hence this construction works without issues.
- 5.
The actual semantics of open-world databases is more complex than this, but we wanted to provide just a basic intuition.
- 6.
We will come back to this issue in Sect.Ā 5.5.
- 7.
Recall that the extensional description of a joint probability distribution requires exponential space on the number of variables involved.
- 8.
It should go without saying, but this is only an example and should in no way be considered medical advice of any kind.
References
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. 36, 1ā69 (2009). https://doi.org/10.1613/jair.2820
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications, 2nd edn. University Press, Cambridge (2007)
Baader, F., Hladik, J., PeƱaloza, R.: Automata can show PSpace results for description logics. Inf. Comput. 206(9ā10), 1045ā1056 (2008). https://doi.org/10.1016/j.ic.2008.03.006
Bellomarini, L., Benedetto, D., Gottlob, G., Sallinger, E.: Vadalog: a modern architecture for automated reasoning with large knowledge graphs. Inf. Syst., 101528 (2020). https://doi.org/10.1016/j.is.2020.101528
Bianchi, F., Rossiello, G., Costabello, L., Palmonari, M., Minervini, P.: Knowledge graph embeddings and explainable AI. CoRR abs/2004.14843 (2020). https://arxiv.org/abs/2004.14843
Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)
Bobillo, F., Straccia, U.: Reasoning within fuzzy OWL 2 EL revisited. Fuzzy Sets Syst. 351, 1ā40 (2018). https://doi.org/10.1016/j.fss.2018.03.011
Borgwardt, S.: Fuzzy description logics with general concept inclusions. Ph.D. thesis, Technische UniversitƤt Dresden, Germany (2014)
Borgwardt, S., Ceylan, Ä°.Ä°., Lukasiewicz, T.: Ontology-mediated query answering over log-linear probabilistic data. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, pp. 2711ā2718. AAAI Press (2019). https://doi.org/10.1609/aaai.v33i01.33012711
Borgwardt, S., PeƱaloza, R.: The complexity of lattice-based fuzzy description logics. J. Data Semant. 2(1), 1ā19 (2013). https://doi.org/10.1007/s13740-012-0013-x
Borgwardt, S., PeƱaloza, R.: Fuzzy description logics ā a survey. In: Moral, S., Pivert, O., SĆ”nchez, D., MarĆn, N. (eds.) SUM 2017. LNCS (LNAI), vol. 10564, pp. 31ā45. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67582-4_3
Botha, L., Meyer, T., PeƱaloza, R.: A Bayesian extension of the description logic \(\cal{ALC}\). In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 339ā354. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-19570-0_22
Brewka, G.: Nonmonotonic Reasoning - Logical Foundations of Commonsense. Cambridge Tracts in Theoretical Computer Science, vol. 12. Cambridge University Press, Cambridge (1991)
CalƬ, A., Gottlob, G., Lukasiewicz, T., Pieris, A.: Datalog+/-: a family of languages for ontology querying. In: de Moor, O., Gottlob, G., Furche, T., Sellers, A. (eds.) Datalog 2.0 2010. LNCS, vol. 6702, pp. 351ā368. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24206-9_20
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. Artif. Intell. 195, 335ā360 (2013). https://doi.org/10.1016/j.artint.2012.10.003
Cano, A., Cozman, F.G., Lukasiewicz, T.: Reasoning with imprecise probabilities. Int. J. Approx. Reason. 44(3), 197ā199 (2007). https://doi.org/10.1016/j.ijar.2006.09.001
Carvalho, R.N., Laskey, K.B., Costa, P.C.G.: PR-OWL - a language for defining probabilistic ontologies. Int. J. Approx. Reason. 91, 56ā79 (2017). https://doi.org/10.1016/j.ijar.2017.08.011
Ceylan, Ä°.Ä°., Darwiche, A., den Broeck, G.V.: Open-world probabilistic databases. In: Baral, C., Delgrande, J.P., Wolter, F. (eds.) Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning, KR 2016, pp. 339ā348. AAAI Press (2016). http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12908
Ceylan, Ä°Ä°., Lukasiewicz, T.: A tutorial on query answering and reasoning over probabilistic knowledge bases. In: dāAmato, C., Theobald, M. (eds.) Reasoning Web 2018. LNCS, vol. 11078, pp. 35ā77. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00338-8_3
Ceylan, Ä°Ä°., PeƱaloza, R.: The Bayesian ontology language BEL. J. Autom. Reason. 58(1), 67ā95 (2017). https://doi.org/10.1007/s10817-016-9386-0
Concannon, L.G., Kaufman, M.S., Herring, S.A.: Counseling athletes on the risk of chronic traumatic encephalopathy. Sports Health 6(5), 396ā401 (2014). https://doi.org/10.1177/1941738114530958
Cooper, G.F.: The computational complexity of probabilistic inference using Bayesian belief networks. Artif. Intell. 42(2ā3), 393ā405 (1990). https://doi.org/10.1016/0004-3702(90)90060-D
Cozman, F.G.: Graphical models for imprecise probabilities. Int. J. Approx. Reason. 39(2ā3), 167ā184 (2005). https://doi.org/10.1016/j.ijar.2004.10.003
Cuenca Grau, B., Horrocks, I., Motik, B., Parsia, B., Patel-Schneider, P., Sattler, U.: OWL 2: The next step for OWL. J. Web Semant. 6, 309ā322 (2008)
Cyganiak, R., Wood, D., Lanthaler, M. (eds.): RDF 1.1 Concepts and Abstract Syntax. W3C Recommendation (25 February 2014). http://www.w3.org/TR/rdf11-concepts/
Dalvi, N.N., Suciu, D.: The dichotomy of probabilistic inference for unions of conjunctive queries. J. ACM 59(6), 30:1ā30:87 (2012). https://doi.org/10.1145/2395116.2395119
Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press, Cambridge (2009). http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=9780521884389
Dechter, R.: Bucket elimination: a unifying framework for reasoning. Artif. Intell. 113(1ā2), 41ā85 (1999). https://doi.org/10.1016/S0004-3702(99)00059-4
Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 5th edn. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-53622-3
Dubois, D., Prade, H.: Possibility Theory - An Approach to Computerized Processing of Uncertainty. Springer, Boston (1988). https://doi.org/10.1007/978-1-4684-5287-7
Gallo, G., Longo, G., Pallottino, S., Nguyen, S.: Directed hypergraphs and applications. Discret. Appl. Math. 42(2), 177ā201 (1993). https://doi.org/10.1016/0166-218X(93)90045-P
Gottwald, S.: Many-valued and fuzzy logics. In: Kacprzyk, J., Pedrycz, W. (eds.) Springer Handbook of Computational Intelligence, pp. 7ā29. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-43505-2_2
GutiƩrrez-Basulto, V., Jung, J.C., Lutz, C., Schrƶder, L.: A closer look at the probabilistic description logic prob-EL. In: Burgard, W., Roth, D. (eds.) Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011. AAAI Press (2011). http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3702
GutiĆ©rrez-Basulto, V., Jung, J.C., Lutz, C., Schrƶder, L.: Probabilistic description logics for subjective uncertainty. J. Artif. Intell. Res. 58, 1ā66 (2017). https://doi.org/10.1613/jair.5222
HƔjek, P.: Metamathematics of Fuzzy Logic. Trends in Logic, vol. 4. Springer, Dordrecht (1998). https://doi.org/10.1007/978-94-011-5300-3
Halpern, J.Y.: An analysis of first-order logics of probability. In: Sridharan, N.S. (ed.) Proceedings of the 11th International Joint Conference on Artificial Intelligence, IJCAI 1989, pp. 1375ā1381. Morgan Kaufmann (1989). http://ijcai.org/Proceedings/89-2/Papers/084.pdf
Halpern, J.Y.: An analysis of first-order logics of probability. Artif. Intell. 46(3), 311ā350 (1990). https://doi.org/10.1016/0004-3702(90)90019-V
Halpern, J.Y.: Reasoning about Uncertainty. MIT Press, Cambridge (2005)
Hogan, A., et al.: Knowledge graphs. CoRR abs/2003.02320 (2020). https://arxiv.org/abs/2003.02320
Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible \(\cal{SROIQ}\). In: Doherty, P., Mylopoulos, J., Welty, C.A. (eds.) Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning, KR 2006, pp. 57ā67. AAAI Press (2006)
Jaeger, M.: Probabilistic reasoning in terminological logics. In: Doyle, J., Sandewall, E., Torasso, P. (eds.) Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, KR 1994, pp. 305ā316. Morgan Kaufmann (1994)
Klinov, P., Parsia, B.: Pronto: a practical probabilistic description logic reasoner. In: Bobillo, F., et al. (eds.) UniDL/URSW 2008-2010. LNCS (LNAI), vol. 7123, pp. 59ā79. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-35975-0_4
Koller, D., Levy, A.Y., Pfeffer, A.: P-CLASSIC: a tractable probablistic description logic. In: Kuipers, B., Webber, B.L. (eds.) Proceedings of the 14th National Conference on Artificial Intelligence, AAAI 1997, pp. 390ā397. AAAI Press (1997). http://www.aaai.org/Library/AAAI/1997/aaai97-060.php
Kyburg Jr., H.E., Teng, C.M.: Uncertain Inference. Cambridge University Press, Cambridge (2001). https://doi.org/10.1017/CBO9780511612947
Laskey, K.B., da Costa, P.C.G.: Of starships and klingons: Bayesian logic for the 23rd century. In: Proceedings of the 21st Conference in Uncertainty in Artificial Intelligence, UAI 2005, pp. 346ā353. AUAI Press (2005)
Littman, M.L., Majercik, S.M., Pitassi, T.: Stochastic Boolean satisfiability. J. Autom. Reason. 27(3), 251ā296 (2001). https://doi.org/10.1023/A:1017584715408
Lukasiewicz, T.: Expressive probabilistic description logics. Artif. Intell. 172(6ā7), 852ā883 (2008). https://doi.org/10.1016/j.artint.2007.10.017
Lukasiewicz, T., Straccia, U.: Managing uncertainty and vagueness in description logics for the semantic web. J. Web Semant. 6(4), 291ā308 (2008)
Lutz, C., Schrƶder, L.: Probabilistic description logics for subjective uncertainty. In: Lin, F., Sattler, U., Truszczynski, M. (eds.) Proceedings of the 12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010. AAAI Press (2010). http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1243
Maggi, F.M., Montali, M., PeƱaloza, R.: Temporal logics over finite traces with uncertainty. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence, AAAI 2020, pp. 10218ā10225. AAAI Press (2020)
Maggi, F.M., Montali, M., PeƱaloza, R., Alman, A.: Extending temporal business constraints with uncertainty. In: Proceedings of BPM-20 (2020, to appear)
Maggi, F.M., Montali, M., Westergaard, M., van der Aalst, W.M.P.: Monitoring business constraints with linear temporal logic: an approach based on colored automata. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) BPM 2011. LNCS, vol. 6896, pp. 132ā147. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23059-2_13
Mintz, M., Bills, S., Snow, R., Jurafsky, D.: Distant supervision for relation extraction without labeled data. In: Su, K., Su, J., Wiebe, J. (eds.), Proceedings of the 47th Annual Meeting of the Association for Computational Linguistics, ACL 2009, pp. 1003ā1011. The Association for Computer Linguistics (2009). https://www.aclweb.org/anthology/P09-1113/
Motik, B., Cuenca Grau, B., Horrocks, I., Wu, Z., Fokoue, A., Lutz, C. (eds.): OWL 2 Web Ontology Language: Profiles. W3C Recommendation (27 October 2009). http://www.w3.org/TR/owl2-profiles/
Niepert, M., Noessner, J., Stuckenschmidt, H.: Log-linear description logics. In: Walsh, T. (ed.) Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, pp. 2153ā2158. IJCAI/AAAI (2011). https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-359
Nilsson, N.J.: Probabilistic logic. Artif. Intell. 28(1), 71ā87 (1986). https://doi.org/10.1016/0004-3702(86)90031-7
Pearl, J.: Probabilistic Reasoning in Intelligent Systems - Networks of Plausible Inference. Morgan Kaufmann Series in Representation and Reasoning. Morgan Kaufmann, Burlington (1989)
PeƱaloza, R.: Inconsistency-tolerant instance checking in tractable description logics. In: Costantini, S., Franconi, E., Van Woensel, W., Kontchakov, R., Sadri, F., Roman, D. (eds.) RuleML+RR 2017. LNCS, vol. 10364, pp. 215ā229. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61252-2_15
PeƱaloza, R.: Making decisions with knowledge base repairs. In: Torra, V., Narukawa, Y., Pasi, G., Viviani, M. (eds.) MDAI 2019. LNCS (LNAI), vol. 11676, pp. 259ā271. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-26773-5_23
PeƱaloza, R.: Axiom pinpointing. CoRR abs/2003.08298 (2020). https://arxiv.org/abs/2003.08298
PeƱaloza, R., Sertkaya, B.: Understanding the complexity of axiom pinpointing in lightweight description logics. Artif. Intell. 250, 80ā104 (2017). https://doi.org/10.1016/j.artint.2017.06.002
Pesic, M., Schonenberg, H., van der Aalst, W.M.P.: DECLARE: full support for loosely-structured processes. In: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference, EDOC 2007, pp. 287ā300. IEEE Computer Society (2007). https://doi.org/10.1109/EDOC.2007.14
Raedt, L.D., Kimmig, A., Toivonen, H.: Problog: a probabilistic prolog and its application in link discovery. In: Veloso, M.M. (ed.) Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI 2007, pp. 2462ā2467. IJCAI (2007). http://ijcai.org/Proceedings/07/Papers/396.pdf
Riguzzi, F., Bellodi, E., Lamma, E., Zese, R.: Probabilistic description logics under the distribution semantics. Semant. Web 6(5), 477ā501 (2015). https://doi.org/10.3233/SW-140154
Roth, D.: On the hardness of approximate reasoning. Artif. Intell. 82(1ā2), 273ā302 (1996). https://doi.org/10.1016/0004-3702(94)00092-1
Schild, K.: A correspondence theory for terminological logics: preliminary report. In: Mylopoulos, J., Reiter, R. (eds.) Proceedings of the 12th International Joint Conference on Artificial Intelligence, IJCAI 1991, pp. 466ā471. Morgan Kaufmann (1991)
Straccia, U.: Fuzzy semantic web languages and beyond. In: Benferhat, S., Tabia, K., Ali, M. (eds.) IEA/AIE 2017. LNCS (LNAI), vol. 10350, pp. 3ā8. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-60042-0_1
Suciu, D., Olteanu, D., RĆ©, C., Koch, C.: Probabilistic Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2011). https://doi.org/10.2200/S00362ED1V01Y201105DTM016
Tijms, H.: Understanding Probability, 3rd edn. Cambridge University Press, Cambridge (2012). https://doi.org/10.1017/CBO9781139206990
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
PeƱaloza, R. (2020). Introduction to Probabilistic Ontologies. In: Manna, M., Pieris, A. (eds) Reasoning Web. Declarative Artificial Intelligence. Reasoning Web 2020. Lecture Notes in Computer Science(), vol 12258. Springer, Cham. https://doi.org/10.1007/978-3-030-60067-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-60067-9_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-60066-2
Online ISBN: 978-3-030-60067-9
eBook Packages: Computer ScienceComputer Science (R0)