Obserwuj
Piotr Ostropolski-Nalewaja
Piotr Ostropolski-Nalewaja
University of Wrocław / Dresden University of Technology
Zweryfikowany adres z cs.uni.wroc.pl
Tytuł
Cytowane przez
Cytowane przez
Rok
A family of approximation algorithms for the maximum duo-preservation string mapping problem
B Dudek, P Gawrychowski, P Ostropolski-Nalewaja
arXiv preprint arXiv:1702.02405, 2017
92017
Determinacy of real conjunctive queries. the boolean case
J Kwiecien, J Marcinkowski, P Ostropolski-Nalewaja
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022
72022
Finite-cliquewidth sets of existential rules: Toward a general criterion for decidable yet highly expressive querying
T Feller, TS Lyon, P Ostropolski-Nalewaja, S Rudolph
arXiv preprint arXiv:2209.02464, 2022
52022
Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable
G Głuch, J Marcinkowski, P Ostropolski-Nalewaja
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
52018
All-instances oblivious chase termination is undecidable for single-head binary tgds
B Bednarczyk, R Ferens, P Ostropolski-Nalewaja
Proceedings of the Twenty-Ninth International Conference on International …, 2021
32021
The first order truth behind undecidability of regular path queries determinacy
G Głuch, J Marcinkowski, P Ostropolski-Nalewaja
arXiv preprint arXiv:1808.07767, 2018
32018
A journey to the frontiers of query rewritability
P Ostropolski-Nalewaja, J Marcinkowski, D Carral, S Rudolph
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022
22022
Decidability of querying first-order theories via countermodels of finite width
T Feller, TS Lyon, P Ostropolski-Nalewaja, S Rudolph
arXiv preprint arXiv:2304.06348, 2023
12023
Foundations for an Abstract Proof Theory in the Context of Horn Rules
TS Lyon, P Ostropolski-Nalewaja
arXiv preprint arXiv:2304.05697, 2023
12023
Connecting proof theory and knowledge representation: sequent calculi and the chase with existential rules
TS Lyon, P Ostropolski-Nalewaja
arXiv preprint arXiv:2306.02521, 2023
2023
On monotonic determinacy and rewritability for recursive queries and views
M Benedikt, S Kikot, P Ostropolski-Nalewaja, M Romero
ACM Transactions on Computational Logic 24 (2), 1-62, 2023
2023
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–11