# Unification with Restrictions in Description Logics

Oliver Fernández Gill

► To cite this version:

Oliver Fernández Gill. Unification with Restrictions in Description Logics. UNIF 2025 - 39th International Workshop on Unification, Jul 2025, Birmingham, United Kingdom. hal-05148734

HAL Id: hal-05148734

https://hal.science/hal-05148734v1

Submitted on 7 Jul 2025

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_1.png" /></figure>
# Unification with Restrictions in Description Logics

Oliver Fernández Gil

Theoretical Computer Science, TU Dresden, Germany

oliver.fernandez@tu-dresden.de

## Abstract

Unification in Description Logics (DLs) was introduced almost thirty years ago as a non-standard reasoning task, motivated by applications in ontology engineering and ontology reasoning. This talk will explore different variants of unification in DLs, where the set of admissible unifiers is restricted to unifiers satisfying certain conditions or properties. In the context of DLs, imposing such restrictions on the solutions of unification problems is motivated from an application point of view. However, the resulting unification problems are also interesting and challenging from a theoretical point of view. In this talk, I will present an overview of such restricted unification problems, including their motivation and computational complexity. I will also discuss related ongoing work.