Unification in the description logic $\mathcal{FL}_\bot$
Abstract: Description Logics are a formalism used in the knowledge representation, where the knowledge is captured in the form of concepts constructed in a controlled way from a restricted vocabulary. This allows one to test effectively for consistency of and the subsumption between the concepts. Unification of concepts may likewise become a useful tool in analysing the relations between concepts. The unification problem has been solved for the description logics $\mathcal{FL}0$ and $\mathcal{EL}$. These small logics do not provide any means to express negation. Here we show an algorithm solving unification in $\mathcal{FL}\bot$, the logic that extends $\mathcal{FL}_0$ with the bottom concept. Bottom allows one to express that two concepts are disjoint. Our algorithm runs in exponential time, with respect to the size of the problem.
- Franz Baader and Oliver Fernández Gil. Restricted unification in the description logic ℱℒ⊥ℱsubscriptℒbottom\mathcal{FL}_{\bot}caligraphic_F caligraphic_L start_POSTSUBSCRIPT ⊥ end_POSTSUBSCRIPT. In David M. Cerna and Barbara Morawska, editors, Proceedings of the 36th International Workshop on Unification (UNIF 2022), Haifa, Israel, 2022.
- Unification in a description logic with transitive closure of roles. In Carole A. Goble, Deborah L. McGuinness, Ralf Möller, and Peter F. Patel-Schneider, editors, Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001, volume 49 of CEUR Workshop Proceedings. CEUR-WS.org, 2001.
- Unification in a description logic with inconsistency and transitive closure of roles. In Ian Horrocks and Sergio Tessaris, editors, Proceedings of the 2002 International Workshop on Description Logics (DL2002), Toulouse, France, April 19-21, 2002, volume 53 of CEUR Workshop Proceedings. CEUR-WS.org, 2002.
- Unification in the description logic ℰℒℰℒ\mathcal{EL}caligraphic_E caligraphic_L. Logical Methods in Computer Science, 6(3), 2010. Special Issue of the 20th International Conference on Rewriting Techniques and Applications; also available at http://arxiv.org/abs/1006.2289.
- Unification of concept terms in description logics. Journal of Symbolic Computation, 31(3):277–305, 2001.
- Finding finite Herbrand models. In Nikolaj Bjørner and Andrei Voronkov, editors, Proc. of the 18th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-18), volume 7180 of Lecture Notes in Computer Science, pages 138–152. Springer, 2012.
- An ontology of time for the semantic web. page 66–85, 3 2004.
- Ian Horrocks. Ontologies and the semantic web. Commun. ACM, 51(12):58–67, 2008.
- Application of ontologies and semantic web technologies in the field of medicine. In Endrit Xhina and Klesti Hoxha, editors, Proceedings of the 3rd International Conference on Recent Trends and Applications in Computer Science and Information Technology, RTA-CSIT 2018, Tirana, Albania, November 23rd - 24th, 2018, volume 2280 of CEUR Workshop Proceedings, pages 24–30. CEUR-WS.org, 2018.
- Barbara Morawska. Unification in the description logic ℱℒ⊥ℱsubscriptℒbottom\mathcal{FL}_{\bot}caligraphic_F caligraphic_L start_POSTSUBSCRIPT ⊥ end_POSTSUBSCRIPT. In Martin Homola, Vladislav Ryzhikov, and Renate A. Schmidt, editors, Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), Bratislava, Slovakia, September 19th to 22nd, 2021, volume 2954 of CEUR Workshop Proceedings. CEUR-WS.org, 2021.
- Building ontology of cybersecurity operational information. In Proceedings of the Sixth Annual Workshop on Cyber Security and Information Intelligence Research, CSIIRW ’10, page 1–4, New York, NY, USA, 4 2010. Association for Computing Machinery.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.