Piotr Ostropolski-Nalewaja

From International Center for Computational Logic

Dr. Piotr Ostropolski-Nalewaja

Former member

Newest Publications

View full publication list

Lukas Gerlach, Lucas Larroque, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
About the Multi-Head Linear Restricted Chase Termination
In Magdalena Ortiz,Renata Wassermann,Torsten Schaub, eds., Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning (KR 2025), volume 22 of Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning, 346-355, October 2025. IJCAI Organization
Details Download
Thomas Feller, Tim Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
Decidability of Querying First-Order Theories via Countermodels of Finite Width
Logical Methods in Computer Science, 21(2):7:1-7:35, April 2025
Details Download
Piotr Ostropolski-Nalewaja, Sebastian Rudolph
The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules
In Pierre Marquis, Magdalena Ortiz, Maurice Pagnucco, eds., Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 574–584, 2024. IJCAI Organization
Details Download
Piotr Ostropolski-Nalewaja, Tim Lyon
Decidability of Quasi-Dense Modal Logics
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2024), 2024. ACM
Details Download
Tim Lyon, Piotr Ostropolski-Nalewaja
Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 769-773, 2023. IJCAI Inc
Details Download
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
On Monotonic Determinacy and Rewritability for Recursive Queries and Views
ACM Trans. Comput. Logic, 24(2), March 2023
Details
Thomas Feller, Tim Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
Finite-Cliquewidth Sets of Existential Rules – Toward a General Criterion for Decidable yet Highly Expressive Querying
In Geerts, Floris and Vandevoort, Brecht, eds., Proceedings of the 26th International Conference on Database Theory (ICDT 2023), volume 255 of Leibniz International Proceedings in Informatics (LIPIcs), 18:1-18:18, March 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Details Download
Jarosław Kwiecień, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
Determinacy of Real Conjunctive Queries. The Boolean Case
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 347–358, 2022. Association for Computing Machinery
Details
Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph
A Journey to the Frontiers of Query Rewritability
In Leonid Libkin, Pablo Barceló, eds., Proceedings of the 41st Symposium on Principles of Database Systems (PODS'22), 359-367, June 2022. ACM
Details Download
Bartosz Bednarczyk, Robert Ferens, Piotr Ostropolski-Nalewaja
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs
In Christian Bessiere, eds., Proceedings of the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI 2020), ijcai.org, 1719--1725, July 2020. International Joint Conferences on Artificial Intelligence
Details Download
View full publication list