Abstract
One of the main reasons to employ a description logic such as \(\mathscr {E\!L}^{++}\) is the fact that it has efficient, polynomial-time algorithmic properties such as deciding consistency and inferring subsumption. However, simply by adding negation of concepts to it, we obtain the expressivity of description logics whose decision procedure is ExpTime-complete. Similar complexity explosion occurs if we add probability assignments on concepts. To lower the resulting complexity, we instead concentrate on assigning probabilities to Axioms/GCIs. We show that the consistency detection problem for such a probabilistic description logic is NP-complete, and present a linear algebraic deterministic algorithm to solve it, using the column generation technique. We also examine and provide algorithms for the probabilistic extension problem, which consists of inferring the minimum and maximum probabilities for a new axiom, given a consistent probabilistic knowledge base.
This study was financed in part by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior – Brasil (CAPES) – Finance Code 001.
M. Finger—Partly supported by Fapesp projects 2015/21880-4 and 2014/12236-1 and CNPq grant PQ 303609/2018-4.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Proceedings of IJCAI 2005, San Francisco, CA, USA, pp. 364–369. Morgan Kaufmann Publishers Inc. (2005a)
Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. Technical report LTCS-Report LTCS-05-01 (2005b)
Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press, Cambridge (2017)
Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)
Bona, G.D., Cozman, F.G., Finger, M.: Towards classifying propositional probabilistic logics. J. Appl. Logic 12(3), 349–368 (2014)
Eckhoff, J.: Helly, Radon, and Carathéodory type theorems. In: Handbook of Convex Geometry, pp. 389–448. Elsevier (1993)
Finger, M., Bona, G.D.: Probabilistic satisfiability: logic-based algorithms and phase transition. In: IJCAI 2011, pp. 528–533 (2011)
Finger, M., De Bona, G.: Probabilistic satisfiability: algorithms with the presence and absence of a phase transition. Ann. Math. Artif. Intell. 75(3), 351–379 (2015)
Finger, M., Wassermann, R., Cozman, F.G.: Satisfiability in EL with sets of probabilistic ABoxes. In: Rosati et al. (2011)
Gutiérrez-Basulto, V., Jung, J.C., Lutz, C., Schröder, L.: A closer look at the probabilistic description logic Prob-EL. In: AAAI 2011 (2011)
Gutiérrez-Basulto, V., Jung, J.C., Lutz, C., Schröder, L.: Probabilistic description logics for subjective uncertainty. JAIR 58, 1–66 (2017)
Heinsohn, J.: Probabilistic description logics. In: Proceedings of UAI 1994, pp. 311–318 (1994)
Jung, J.C., Gutiérrez-Basulto, V., Lutz, C., Schröder, L.: The complexity of probabilistic EL. In: Rosati et al. (2011)
Lukasiewicz, T.: Expressive probabilistic description logics. Artif. Intell. 172(6), 852–883 (2008)
Lutz, C., Schröder, L.: Probabilistic description logics for subjective uncertainty. In: KR 2010. AAAI Press (2010)
Rosati, R., Rudolph, S., Zakharyaschev, M. (eds.): Proceedings of DL 2011. CEUR Workshop Proceedings, vol. 745. CEUR-WS.org (2011)
Warners, J.P.: A linear-time transformation of linear inequalities into conjunctive normal form. Inf. Process. Lett. 68(2), 63–69 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Finger, M. (2019). Extending \(\mathscr {E\!L}^{++}\) with Linear Constraints on the Probability of Axioms. In: Lutz, C., Sattler, U., Tinelli, C., Turhan, AY., Wolter, F. (eds) Description Logic, Theory Combination, and All That. Lecture Notes in Computer Science(), vol 11560. Springer, Cham. https://doi.org/10.1007/978-3-030-22102-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-22102-7_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-22101-0
Online ISBN: 978-3-030-22102-7
eBook Packages: Computer ScienceComputer Science (R0)