Piotr Ostropolski-Nalewaja

According to our database, Piotr Ostropolski-Nalewaja authored at least 14 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Monotone Rewritability and the Analysis of Queries, Views, and Rules.

Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja

CoRR, 2024

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

Piotr Ostropolski-Nalewaja, Sebastian Rudolph

CoRR, 2024

Decidability of Quasi-Dense Modal Logics.

Tim Lyon, Piotr Ostropolski-Nalewaja

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023

On Monotonic Determinacy and Rewritability for Recursive Queries and Views.

Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero

ACM Trans. Comput. Log., April, 2023

Decidability of Querying First-Order Theories via Countermodels of Finite Width.

Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph

CoRR, 2023

Foundations for an Abstract Proof Theory in the Context of Horn Rules.

Tim S. Lyon, Piotr Ostropolski-Nalewaja

CoRR, 2023

Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules.

Tim S. Lyon, Piotr Ostropolski-Nalewaja

Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying.

Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph

Proceedings of the 26th International Conference on Database Theory, 2023

2022

A Journey to the Frontiers of Query Rewritability.

Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Determinacy of Real Conjunctive Queries. The Boolean Case.

Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2020

All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs.

Bartosz Bednarczyk, Robert Ferens, Piotr Ostropolski-Nalewaja

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019

The First Order Truth Behind Undecidability of Regular Path Queries Determinacy.

Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja

Proceedings of the 22nd International Conference on Database Theory, 2019

2018

Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable.

Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem.

Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017