15 citations · 34 across the 7 of their papers we have counts for
12 papers
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying
Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja +1
In our pursuit of generic criteria for decidable ontology-based querying, we introduce 'finite-cliquewidth sets' (FCS) of existential rules, a model-theoretically defined class of…
Capturing Homomorphism-Closed Decidable Queries with Existential Rules
Camille Bourgaux, David Carral, Markus Krötzsch +2
Existential rules are a very popular ontology-mediated query language for which the chase represents a generic computational approach for query answering. It is straightforward tha…
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard
Bartosz Bednarczyk, Sebastian Rudolph
In logic-based knowledge representation, query answering has essentially replaced mere satisfiability checking as the inferencing problem of primary interest. For knowledge bases i…
On Logics and Homomorphism Closure
Manuel Bodirsky, Thomas Feller, Simon Knäuer +1
Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions…
Finite Model Theory of the Triguarded Fragment and Related Logics
Emanuel Kieroński, Sebastian Rudolph
The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality. We show…
Knowledge Graphs Evolution and Preservation -- A Technical Report from ISWS 2019
Nacira Abbas, Kholoud Alghamdi, Mortaza Alinam +71
One of the grand challenges discussed during the Dagstuhl Seminar "Knowledge Graphs: New Directions for Knowledge Representation on the Semantic Web" and described in its report is…