1 citations · 1 across the 8 of their papers we have counts for
8 papers
Shapes from Examples: Foundations of Shape Learning in Recursive SHACL
Bente Gortworst, Cem Okulmus, Magdalena Ortiz +1
SHACL shapes enable data graph validation, making automatic shape learning essential for knowledge graph applications. We investigate the well-known fitting approach to this task:…
The More the Merrier: Combining Properties for ABox Abduction under Repair Semantics in ELbot
Anselm Haak, Patrick Koopmann, Yasir Mahmood +1
Abduction is a central approach to explain missing entailments from a knowledge base by providing a hypothesis, that would, if added to the knowledge base, make the missing entailm…
ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics
Anselm Haak, Patrick Koopmann, Yasir Mahmood +1
Given a knowledge base (KB) with a non-entailed fact, the ABox abduction problem asks for possible extensions of the KB that would entail this fact. This problem has many applicati…
Why not? Developing ABox Abduction beyond Repairs
Anselm Haak, Patrick Koopmann, Yasir Mahmood +1
Abduction is the task of computing a sufficient extension of a knowledge base (KB) that entails a conclusion not entailed by the original KB. It serves to compute explanations, or…
Optimal Alignment of Temporal Knowledge Bases
Oliver Fernandez-Gil, Fabio Patrizi, Giuseppe Perelli +1
Answering temporal CQs over temporalized Description Logic knowledge bases (TKB) is a main technique to realize ontology-based situation recognition. In case the collected data in…
Efficient TBox Reasoning with Value Restrictions using the wer reasoner
Franz Baader, Patrick Koopmann, Friedrich Michel +2
The inexpressive Description Logic (DL) , which has conjunction and value restriction as its only concept constructors, had fallen into disrepute when it turned out…
Query Answering for Rough EL Ontologies (Extended Technical Report)
Rafael Peñaloza, Veronika Thost, Anni-Yasmin Turhan
Querying large datasets with incomplete and vague data is still a challenge. Ontology-based query answering extends standard database query answering by background knowledge from a…
Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies
Stefan Borgwardt, Theofilos Mailis, Rafael Peñaloza +1
Fuzzy Description Logics (DLs) provide a means for representing vague knowledge about an application domain. In this paper, we study fuzzy extensions of conjunctive queries (CQs) o…