Evaluating the Generality of Disjunctive Model Faithful Acyclicity on OWL ontologies

Lukas GerlachLukas Gerlach

Lukas Gerlach
Evaluating the Generality of Disjunctive Model Faithful Acyclicity on OWL ontologies
Project Thesis, TU Dresden, March 2021

Details
Bibtex

KurzfassungAbstract
The chase is a well-studied, sound and complete algorithm that is used in different variants as a basis for reasoning tasks over (disjunctive) existential rules. Since termination of the chase is undecidable, acyclicity notions, i.e. sufficient conditions for termination, like model faithful acyclicity (MFA) for the skolem chase and restricted model faithful acyclicity (RMFA) for the restricted chase are introduced. The recently developed acyclicity notion disjunctive model faithful acyclicity (DMFA) for the disjunctive skolem chase promises improvements for detecting termination over existing notions like MFA in theory. We further know that RMFA captures DFMA while RMFA itself is not sound for the disjunctive skolem chase.
We evaluate the generality of DMFA in practice compared to MFA and RMFA on rule sets that we obtain from real-world OWL ontologies in the Oxford ontology repository (OXFD) and the dataset of the OWL reasoner evaluation 2015 (ORE15). Our results show that DMFA achieves practical improvements over MFA that narrow the gap towards RMFA. Our findings motivate further research regarding the disjunctive skolem chase in general and the development of sufficient conditions for non-termination of the disjunctive skolem chase in particular.
Bemerkung: Note: supervised by David Carral and Markus Krötzsch
Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems

@misc{G2021,
  author = {Lukas Gerlach},
  title  = {Evaluating the Generality of Disjunctive Model Faithful Acyclicity
            on {OWL} ontologies},
  year   = {2021},
  month  = {March}
}