An Upper Bound for Provenance in ELHr
Rafael Pe\~naloza
TL;DR
This paper establishes complexity bounds for entailment in ELHr ontologies with provenance annotations, showing NP-completeness with polynomial provenance and polynomial time with non-commutative semirings, using weighted automata.
Contribution
It provides the first complexity bounds for provenance entailment in ELHr with polynomial provenance, introducing weighted automata for this purpose.
Findings
NP-complete for polynomial provenance semirings
PTime for non-commutative semirings
Weighted automata recognize provenance polynomials
Abstract
We investigate the entailment problem in ELHr ontologies annotated with provenance information. In more detail, we show that subsumption entailment is in NP if provenance is represented with polynomials from the Trio semiring and in PTime if the semiring is not commutative. The proof is based on the construction of a weighted tree automaton which recognises a language that matches with the corresponding provenance polynomial.
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
TopicsScientific Computing and Data Management · Semantic Web and Ontologies · Biomedical Text Mining and Ontologies