Search Results for author:
Found 8 papers, 0 papers with code
Normalisations of Existential Rules: Not so Innocuous!
Existential rules are an expressive knowledge representation language mainly developed to query data.
Materializing Knowledge Bases via Trigger Graphs
The chase is a well-established family of algorithms used to materialize Knowledge Bases (KBs), like Knowledge Graphs (KGs), to tackle important tasks like query answering under dependencies or data cleaning.
A Journey to the Frontiers of Query Rewritability
This paper is about (first order) query rewritability in the context of theory-mediated query answering.
Databases
Checking Chase Termination over Ontologies of Existential Rules with Equality
Therefore, one can apply existing acyclicity notions to check chase termination over an axiomatisation of an ontology and then use the original ontology for reasoning.
Modeling OWL with Rules: The ROWL Protege Plugin
In our experience, some ontology users find it much easier to convey logical statements using rules rather than OWL (or description logic) axioms.
Rule-based OWL Modeling with ROWLTab Protege Plugin
It has been argued that it is much easier to convey logical statements using rules rather than OWL (or description logic (DL)) axioms.
A Practical Acyclicity Notion for Query Answering over Horn-SRIQ Ontologies
Conjunctive query answering over expressive Horn Description Logic ontologies is a relevant and challenging problem which, in some cases, can be addressed by application of the chase algorithm.
On the Ontological Modeling of Trees
Trees -- i. e., the type of data structure known under this name -- are central to many aspects of knowledge organization.
