Piotr Ostropolski-Nalewaja

35 papers A* 10A 2B 1Journal 21Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
No Cliques Allowed: The Next Step Towards BDD/FC Conjecture.
CoRR
Lucas Larroque, Piotr Ostropolski-Nalewaja, Michaël Thomazo
2025 A* conf
About the Multi-Head Linear Restricted Chase Termination.
KR
Lukas Gerlach, Lucas Larroque, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2025 J jnl
About the Multi-Head Linear Restricted Chase Termination.
CoRR
Lukas Gerlach, Lucas Larroque, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2025 J jnl
Bag Semantics Query Containment: The CQ vs. UCQ Case and Other Stories.
CoRR
Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2025 J jnl
Bag Semantics Query Containment: The CQ vs. UCQ Case and Other Stories.
Proc. ACM Manag. Data
Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2025 J jnl
Decidability of Querying First-Order Theories via Countermodels of Finite Width.
Log. Methods Comput. Sci.
Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
2025 — conf
No Cliques Allowed: The Next Step Towards BDD/FC Conjecture (Extended Abstract).
DL
Lucas Larroque, Piotr Ostropolski-Nalewaja, Michaël Thomazo
2025 J jnl
No Cliques Allowed: The Next Step Towards BDD/FC Conjecture.
Proc. ACM Manag. Data
Lucas Larroque, Piotr Ostropolski-Nalewaja, Michaël Thomazo
2025 J jnl
On the entailment problem for DL-Lite
CoRR
Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2024 A* conf
Decidability of Quasi-Dense Modal Logics.
LICS
Tim S. Lyon, Piotr Ostropolski-Nalewaja
2024 J jnl
Decidability of Quasi-Dense Modal Logics.
CoRR
Piotr Ostropolski-Nalewaja, Tim S. Lyon
2024 A* conf
Monotone Rewritability and the Analysis of Queries, Views, and Rules.
KR
Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja
2024 J jnl
Monotone Rewritability and the Analysis of Queries, Views, and Rules.
CoRR
Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja
2024 A* conf
The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules.
KR
Piotr Ostropolski-Nalewaja, Sebastian Rudolph
2024 J jnl
The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules.
CoRR
Piotr Ostropolski-Nalewaja, Sebastian Rudolph
2023 A* conf
Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules.
KR
Tim S. Lyon, Piotr Ostropolski-Nalewaja
2023 J jnl
Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules.
CoRR
Tim S. Lyon, Piotr Ostropolski-Nalewaja
2023 J jnl
Decidability of Querying First-Order Theories via Countermodels of Finite Width.
CoRR
Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
2023 A conf
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying.
ICDT
Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
2023 J jnl
Foundations for an Abstract Proof Theory in the Context of Horn Rules.
CoRR
Tim S. Lyon, Piotr Ostropolski-Nalewaja
2023 J jnl
On Monotonic Determinacy and Rewritability for Recursive Queries and Views.
ACM Trans. Comput. Log.
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
2022 A* conf
A Journey to the Frontiers of Query Rewritability.
PODS
Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph
2022 A* conf
Determinacy of Real Conjunctive Queries. The Boolean Case.
PODS
Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2022 J jnl
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying.
CoRR
Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
2021 J jnl
Determinacy of Real Conjunctive Queries. The Boolean Case.
CoRR
Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2020 J jnl
A Journey to the Frontiers of Query Rewritability.
CoRR
Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph
2020 A* conf
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs.
IJCAI
Bartosz Bednarczyk, Robert Ferens, Piotr Ostropolski-Nalewaja
2020 A* conf
On Monotonic Determinacy and Rewritability for Recursive Queries and Views.
PODS
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
2020 J jnl
On monotonic determinacy and rewritability for recursive queries and views.
CoRR
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
2019 A conf
The First Order Truth Behind Undecidability of Regular Path Queries Determinacy.
ICDT
Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2018 J jnl
Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable.
CoRR
Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2018 A* conf
Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable.
LICS
Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2018 J jnl
The First Order Truth behind Undecidability of Regular Path Queries Determinacy.
CoRR
Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2017 B conf
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem.
CPM
Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja
2017 J jnl
A family of approximation algorithms for the maximum duo-preservation string mapping problem.
CoRR
Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja