Piotr Ostropolski-Nalewaja

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 24

Top Topics

Regular Path Queries

Conjunctive Queries

Highly Expressive

Top Venues

Publications

Piotr Ostropolski-Nalewaja, Sebastian Rudolph
The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules. CoRR (2024)
Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja
Monotone Rewritability and the Analysis of Queries, Views, and Rules. CoRR (2024)
Tim Lyon, Piotr Ostropolski-Nalewaja
Decidability of Quasi-Dense Modal Logics. LICS (2024)
Piotr Ostropolski-Nalewaja, Tim S. Lyon
Decidability of Quasi-Dense Modal Logics. CoRR (2024)
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
On Monotonic Determinacy and Rewritability for Recursive Queries and Views. ACM Trans. Comput. Log. 24 (2) (2023)
Tim S. Lyon, Piotr Ostropolski-Nalewaja
Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules. CoRR (2023)
Tim S. Lyon, Piotr Ostropolski-Nalewaja
Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules. KR (2023)
Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
Decidability of Querying First-Order Theories via Countermodels of Finite Width. CoRR (2023)
Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying. ICDT (2023)
Tim S. Lyon, Piotr Ostropolski-Nalewaja
Foundations for an Abstract Proof Theory in the Context of Horn Rules. CoRR (2023)
Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
Determinacy of Real Conjunctive Queries. The Boolean Case. PODS (2022)
Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying. CoRR (2022)
Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph
A Journey to the Frontiers of Query Rewritability. PODS (2022)
Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
Determinacy of Real Conjunctive Queries. The Boolean Case. CoRR (2021)
Bartosz Bednarczyk, Robert Ferens, Piotr Ostropolski-Nalewaja
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs. IJCAI (2020)
Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph
A Journey to the Frontiers of Query Rewritability. CoRR (2020)
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
On monotonic determinacy and rewritability for recursive queries and views. CoRR (2020)
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
On Monotonic Determinacy and Rewritability for Recursive Queries and Views. PODS (2020)
Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
The First Order Truth Behind Undecidability of Regular Path Queries Determinacy. ICDT (2019)
Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
The First Order Truth behind Undecidability of Regular Path Queries Determinacy. CoRR (2018)
Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable. LICS (2018)
Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable. CoRR (2018)
Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja
A family of approximation algorithms for the maximum duo-preservation string mapping problem. CoRR (2017)
Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem. CPM (2017)