FILO -- automated unification in ${\mathcal{F}\mathcal{L}}_0$

Abstract

FILO is a java application that decides unifiability for a unification problem formulated in the description logic ${\mathcal{F}\mathcal{L}}_0$. If the problem is unifiable, it presents a user with an example of a solution. FILO joins a family of similar applications like UEL solving unification problems in the description logic $\mathcal{E}\mathcal{L}$, ${\mathcal{F}\mathcal{L}}_0$wer a subsumption decider for ${\mathcal{F}\mathcal{L}}_0$ with TBox, CEL and JCEL subsumption deciders for $\mathcal{E}\mathcal{L}$ with TBox, and others. These systems play an important role in various knowledge representation reasoning problems.