Piotr Ostropolski-Nalewaja

Available identifiers

Publication	Date of Publication	Type
Finite-cliquewidth sets of existential rules: toward a general criterion for decidable yet highly expressive querying	2024-10-08	Paper
Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules	2023-06-04	Paper
Decidability of Querying First-Order Theories via Countermodels of Finite Width	2023-04-13	Paper
Foundations for an Abstract Proof Theory in the Context of Horn Rules	2023-04-12	Paper
On Monotonic Determinacy and Rewritability for Recursive Queries and Views	2023-04-05	Paper
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying	2022-09-06	Paper
The first-order truth behind undecidability of regular path queries determinacy	2022-07-21	Paper
Can One Escape Red Chains?	2021-01-20	Paper
A family of approximation algorithms for the maximum duo-preservation string mapping problem	2020-05-25	Paper

This page was built for person: Piotr Ostropolski-Nalewaja