Melbourne, Australia. November 11-17, 2025.
ISSN: 2334-1033
ISBN: 978-1-956792-08-9
Copyright © 2025 International Joint Conferences on Artificial Intelligence Organization
We present an algorithm for solving the unification
problem in the description logic FL_bottom. This logic
extends FL_0 with the bottom constructor and thus supports
conjunction, value restrictions, top and bottom.
Unification of concepts may become a useful tool for
ontology maintenance; however, little is known about
unification even in small, restricted description logics.
The unification problem has been solved only for FL_0 and
EL.
This paper contributes to the ongoing effort to extend
these results to richer logics.
Our algorithm runs in exponential time with respect to the
size of the problem.