activity
20172026
most citedA Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem

2 citations · 4 across the 7 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

cs.LO2022

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…