Abstract
Unification in the Description Logic (DL) \(\mathcal {FL}_0\) is known to be ExpTime-complete and of unification type zero. We investigate whether a lower complexity of the unification problem can be achieved by either syntactically restricting the role depth of concepts or semantically restricting the length of role paths in interpretations. We show that the answer to this question depends on whether the number formulating such a restriction is encoded in unary or binary: for unary coding, the complexity drops from ExpTime to PSpace. As an auxiliary result, we prove a PSpace-completeness result for a depth-restricted version of the intersection emptiness problem for deterministic root-to-frontier tree automata. Finally, we show that the unification type of \(\mathcal {FL}_0\) improves from type zero to unitary (finitary) for unification without (with) constants in the restricted setting.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
For unary coding, the size of the input k is the number k, whereas for binary coding it is the size of its binary encoding, i.e., \(\log k\).
- 2.
Intuitively, \(\rho \) is the number of different role names occurring in the unification problem and each letter \(i, 1\le i\le \rho \), stands for a role name \(r_i\).
- 3.
- 4.
References
Baader, F.: Unification in commutative theories. J. Symbolic Comput. 8(5), 479–497 (1989)
Baader, F., Borgwardt, S., Morawska, B.: Constructing SNOMED CT concepts via disunification. LTCS-Report 17–07, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany (2017). https://lat.inf.tu-dresden.de/research/reports/2017/BaBM-LTCS-17-07.pdf
Baader, F., Fernández Gil, O., Rostamigiv, M.: Restricted unification in the DL \(\cal{FL}_0\) (extended version). LTCS-Report 21–02, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany (2021). https://lat.inf.tu-dresden.de/research/reports/2021/BaGiRo21.pdf
Baader, F., Mendez, J., Morawska, B.: UEL: unification solver for the description logic \(\cal{EL}\) – system description. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 45–51. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31365-3_6
Baader, F., Morawska, B.: Unification in the description logic \(\cal{EL}\). Logical Methods Comput. Sci. 6(3), 350–364 (2010)
Baader, F., Narendran, P.: Unification of concept terms in description logics. J. Symbolic Comput. 31(3), 277–305 (2001)
Baader, F., Nutt, W.: Combination problems for commutative/monoidal theories: how algebra can help in equational reasoning. J. Appl. Algebra Eng. Commun. Comput. 7(4), 309–337 (1996)
Baader, F.: Unification theory. In: Schulz, K.U. (ed.) IWWERT 1990. LNCS, vol. 572, pp. 151–170. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55124-7_5
Balbiani, P., Gencer, C., Rostamigiv, M., Tinchev, T.: About the unification type of \( {K}+\Box \Box \bot \). In: Proceedings of the 34th International Workshop on Unification (UNIF 2020), pp. 4:1–4:6. RISC-Linz (2020)
Jerabek, E.: Blending margins: the modal logic K has nullary unification type. J. Logic Comput. 25(5), 1231–1240 (2015)
Ajay Kumar Eeralla and Christopher Lynch: Bounded ACh unification. Math. Struct. Comput. Sci. 30(6), 664–682 (2020)
Levesque, H.J., Brachman, R.J.: Expressiveness and tractability in knowledge representation and reasoning. Comput. Intell. 3, 78–93 (1987)
Narendran, P.: Solving linear equations over polynomial semirings. In: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS 1996), pp. 466–472. IEEE Computer Society (1996)
Nutt, W.: Unification in monoidal theories. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 618–632. Springer, Heidelberg (1990). https://doi.org/10.1007/3-540-52885-7_118
Peñaloza, R., Turhan, A.-Y.: A practical approach for computing generalization inferences in \(\cal{EL}\). In: Antoniou, G., et al. (eds.) ESWC 2011. LNCS, vol. 6643, pp. 410–423. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21034-1_28
Seidl, H.: Haskell overloading is DEXPTIME-complete. Inf. Process. Lett. 52, 57–60 (1994)
Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, volume B, chapter 4, pp. 134–189. Elsevier Science Publishers (North-Holland), Amsterdam (1990)
Acknowledgements
Franz Baader was partially supported by DFG TRR 248 (cpec, grant 389792660), Oliver Fernández Gil by DFG in project number 335448072, and Maryam Rostamigiv by a DAAD Short-Term Grant, 2021 (57552336). The authors should like to thank Patrick Koopmann for determining the maximal role depth of concepts in ontologies from Bioportal 2017 and in SNOMED CT.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Baader, F., Gil, O.F., Rostamigiv, M. (2021). Restricted Unification in the DL \(\mathcal {FL}_0\). In: Konev, B., Reger, G. (eds) Frontiers of Combining Systems. FroCoS 2021. Lecture Notes in Computer Science(), vol 12941. Springer, Cham. https://doi.org/10.1007/978-3-030-86205-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-86205-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-86204-6
Online ISBN: 978-3-030-86205-3
eBook Packages: Computer ScienceComputer Science (R0)