default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPiotr Ostropolski-Nalewaja
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja:
Monotone Rewritability and the Analysis of Queries, Views, and Rules. KR 2024- [c11]Piotr Ostropolski-Nalewaja, Sebastian Rudolph:
The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules. KR 2024 - [c10]Tim Lyon
, Piotr Ostropolski-Nalewaja:
Decidability of Quasi-Dense Modal Logics. LICS 2024: 60:1-60:8 - [i13]Piotr Ostropolski-Nalewaja, Tim S. Lyon:
Decidability of Quasi-Dense Modal Logics. CoRR abs/2405.10094 (2024) - [i12]Piotr Ostropolski-Nalewaja, Sebastian Rudolph:
The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules. CoRR abs/2407.14384 (2024) - [i11]Michael Benedikt, Stanislav Kikot, Johannes Marti, Piotr Ostropolski-Nalewaja:
Monotone Rewritability and the Analysis of Queries, Views, and Rules. CoRR abs/2407.14907 (2024) - 2023
- [j1]Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero:
On Monotonic Determinacy and Rewritability for Recursive Queries and Views. ACM Trans. Comput. Log. 24(2): 16:1-16:62 (2023) - [c9]Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph:
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying. ICDT 2023: 18:1-18:18 - [c8]Tim S. Lyon, Piotr Ostropolski-Nalewaja:
Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules. KR 2023: 769-773 - [i10]Tim S. Lyon, Piotr Ostropolski-Nalewaja:
Foundations for an Abstract Proof Theory in the Context of Horn Rules. CoRR abs/2304.05697 (2023) - [i9]Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph:
Decidability of Querying First-Order Theories via Countermodels of Finite Width. CoRR abs/2304.06348 (2023) - [i8]Tim S. Lyon, Piotr Ostropolski-Nalewaja:
Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules. CoRR abs/2306.02521 (2023) - 2022
- [c7]Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
Determinacy of Real Conjunctive Queries. The Boolean Case. PODS 2022: 347-358 - [c6]Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph:
A Journey to the Frontiers of Query Rewritability. PODS 2022: 359-367 - [i7]Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph:
Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying. CoRR abs/2209.02464 (2022) - 2021
- [i6]Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
Determinacy of Real Conjunctive Queries. The Boolean Case. CoRR abs/2112.12742 (2021) - 2020
- [c5]Bartosz Bednarczyk, Robert Ferens, Piotr Ostropolski-Nalewaja:
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs. IJCAI 2020: 1719-1725 - [c4]Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero:
On Monotonic Determinacy and Rewritability for Recursive Queries and Views. PODS 2020: 131-148 - [i5]Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero:
On monotonic determinacy and rewritability for recursive queries and views. CoRR abs/2003.05898 (2020) - [i4]Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph:
A Journey to the Frontiers of Query Rewritability. CoRR abs/2012.11269 (2020)
2010 – 2019
- 2019
- [c3]Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
The First Order Truth Behind Undecidability of Regular Path Queries Determinacy. ICDT 2019: 15:1-15:18 - 2018
- [c2]Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable. LICS 2018: 492-501 - [i3]Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable. CoRR abs/1802.01554 (2018) - [i2]Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
The First Order Truth behind Undecidability of Regular Path Queries Determinacy. CoRR abs/1808.07767 (2018) - 2017
- [c1]Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja:
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem. CPM 2017: 10:1-10:14 - [i1]Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja:
A family of approximation algorithms for the maximum duo-preservation string mapping problem. CoRR abs/1702.02405 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
