FILO -- automated unification in $\mathcal{FL}_0$
Barbara Morawska, Dariusz Marzec, S{\l}awomir Kost, Micha{\l} Henne

TL;DR
FILO is a Java-based tool that automates the process of deciding unifiability in the description logic $\\mathcal{FL}_0$, aiding knowledge representation reasoning tasks.
Contribution
It introduces an automated unification decision procedure for $\\mathcal{FL}_0$, expanding the tools available for reasoning in description logics.
Findings
FILO successfully determines unifiability in $\\mathcal{FL}_0$ problems.
Provides example solutions when unifiable.
Integrates with existing reasoning systems.
Abstract
FILO is a java application that decides unifiability for a unification problem formulated in the description logic . 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 , wer a subsumption decider for with TBox, CEL and JCEL subsumption deciders for with TBox, and others. These systems play an important role in various knowledge representation reasoning problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Computational Techniques and Applications
