Piotr Ostropolski-Nalewaja

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

MSc Piotr Ostropolski-Nalewaja

Wissenschaftlicher MitarbeiterTechnische Universität DresdenInternational Center for Computational Logic Computational Logic

I am a PhD student at the University of Wrocław and a researcher in the Computational Logic group at Technische Universität Dresden. I currently work within the ERC project DeciGUT, and my research interests concern topics within the fields of Logic, Database Theory, Knowledge Representation, and AI.

Neueste Publikationen

Komplette Publikationsliste anzeigen

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
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, to appear. IJCAI Inc
Details Download
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
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
Grzegorz Głuch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 492–501, 2018. Association for Computing Machinery
Bartłomiej Dudek, Paweł Gawrychowski, Piotr Ostropolski-Nalewaja
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem
In Juha Kärkkäinen and Jakub Radoszewski and Wojciech Rytter, eds., 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), volume 78, 10:1-10:14, 2017. CPM 2017
Komplette Publikationsliste anzeigen