English

FILO -- automated unification in $\mathcal{FL}_0$

Logic in Computer Science 2025-03-11 v2

Abstract

FILO is a java application that decides unifiability for a unification problem formulated in the description logic FL0\mathcal{FL}_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 EL\mathcal{EL}, FL0\mathcal{FL}_0wer a subsumption decider for FL0\mathcal{FL}_0 with TBox, CEL and JCEL subsumption deciders for EL\mathcal{EL} with TBox, and others. These systems play an important role in various knowledge representation reasoning problems.

Cite

@article{arxiv.2502.14130,
  title  = {FILO -- automated unification in $\mathcal{FL}_0$},
  author = {Barbara Morawska and Dariusz Marzec and Sławomir Kost and Michał Henne},
  journal= {arXiv preprint arXiv:2502.14130},
  year   = {2025}
}
R2 v1 2026-06-28T21:50:40.924Z