Piotr Ostropolski-Nalewaja

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 2024Show all

2 papers · 1 filter

cs.DB2024

The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules

Piotr Ostropolski-Nalewaja, Sebastian Rudolph

Extensive research in the field of ontology-based query answering has led to the identification of numerous fragments of existential rules (also known as tuple-generating dependenc…

cs.LO2024

Decidability of Quasi-Dense Modal Logics

Piotr Ostropolski-Nalewaja, Tim S. Lyon

The decidability of axiomatic extensions of the modal logic K with modal reduction principles, i.e. axioms of the form $◊^{k} p \to ◊^{n} p$ , has remained a l…