Piotr Ostropolski-Nalewaja

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Decidability of quasi-dense modal logics	2025-06-18	Paper
Decidability of querying first-order theories via countermodels of finite width Logical Methods in Computer Science	2025-05-06	Paper
Foundations for an Abstract Proof Theory in the Context of Horn Rules (available as arXiv preprint)	2025-01-01	Paper
Finite-cliquewidth sets of existential rules: toward a general criterion for decidable yet highly expressive querying	2024-10-08	Paper
Decidability of Quasi-Dense Modal Logics (available as arXiv preprint)	2024-01-01	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 ACM Transactions on Computational Logic	2023-04-05	Paper
Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules (available as arXiv preprint)	2023-01-01	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 (available as arXiv preprint)	2022-07-21	Paper
Can One Escape Red Chains? Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science	2021-01-20	Paper
A family of approximation algorithms for the maximum duo-preservation string mapping problem (available as arXiv preprint)	2020-05-25	Paper

Research outcomes over time

This page was built for person: Piotr Ostropolski-Nalewaja