default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJerzy Marcinkowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Jerzy Marcinkowski
, Mateusz Orda:
Bag Semantics Conjunctive Query Containment. Four Small Steps Towards Undecidability. Proc. ACM Manag. Data 2(2): 103 (2024)- 2023
- [j12]Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris:
Uniform Restricted Chase Termination. SIAM J. Comput. 52(3): 641-683 (2023) - 2022
- [c31]Jean Christoph Jung, Carsten Lutz, Jerzy Marcinkowski:
Conservative Extensions for Existential Rules. KR 2022 - [c30]Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
Determinacy of Real Conjunctive Queries. The Boolean Case. PODS 2022: 347-358 - [c29]Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph:
A Journey to the Frontiers of Query Rewritability. PODS 2022: 359-367 - [i17]Jean Christoph Jung, Carsten Lutz, Jerzy Marcinkowski:
Conservative Extensions for Existential Rules. CoRR abs/2202.05689 (2022) - 2021
- [i16]Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
Determinacy of Real Conjunctive Queries. The Boolean Case. CoRR abs/2112.12742 (2021) - 2020
- [j11]Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris:
All-Instances Restricted Chase Termination for Linear TGDs. Künstliche Intell. 34(4): 465-473 (2020) - [c28]Jerzy Marcinkowski:
What Makes a Variant of Query Determinacy (Un)Decidable? (Invited Talk). ICDT 2020: 2:1-2:20 - [c27]Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris:
All-Instances Restricted Chase Termination. PODS 2020: 245-258 - [i15]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
- [c26]Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
The First Order Truth Behind Undecidability of Regular Path Queries Determinacy. ICDT 2019: 15:1-15:18 - [i14]Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris:
All-Instances Restricted Chase Termination: The Guarded Case. CoRR abs/1901.03897 (2019) - 2018
- [c25]Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable. LICS 2018: 492-501 - [i13]Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable. CoRR abs/1802.01554 (2018) - [i12]Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja:
The First Order Truth behind Undecidability of Regular Path Queries Determinacy. CoRR abs/1808.07767 (2018) - 2017
- [j10]Tomasz Gogacz, Jerzy Marcinkowski:
Converging to the chase - A tool for finite controllability. J. Comput. Syst. Sci. 83(1): 180-206 (2017) - 2016
- [c24]Tomasz Gogacz, Jerzy Marcinkowski:
Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable. PODS 2016: 121-134 - 2015
- [c23]Tomasz Gogacz, Jerzy Marcinkowski:
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable. LICS 2015: 281-292 - [i11]Tomasz Gogacz, Jerzy Marcinkowski:
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable. CoRR abs/1501.01817 (2015) - [i10]Tomasz Gogacz, Jerzy Marcinkowski:
Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable. CoRR abs/1512.01681 (2015) - 2014
- [j9]Jerzy Marcinkowski, Jakub Michaliszyn:
The Undecidability of the Logic of Subintervals. Fundam. Informaticae 131(2): 217-240 (2014) - [c22]Tomasz Gogacz, Jerzy Marcinkowski:
All-Instances Termination of Chase is Undecidable. ICALP (2) 2014: 293-304 - [i9]Tomasz Gogacz, Jerzy Marcinkowski:
Termination of oblivious chase is undecidable. CoRR abs/1401.4840 (2014) - [i8]Tomasz Gogacz, Jerzy Marcinkowski:
On the BDD/FC Conjecture. CoRR abs/1408.2081 (2014) - 2013
- [c21]Tomasz Gogacz, Jerzy Marcinkowski:
Converging to the Chase - A Tool for Finite Controllability. LICS 2013: 540-549 - [c20]Tomasz Gogacz, Jerzy Marcinkowski:
On the BDD/FC conjecture. PODS 2013: 127-138 - 2012
- [j8]Slawek Staworko, Jan Chomicki, Jerzy Marcinkowski:
Prioritized repairing and consistent query answering in relational databases. Ann. Math. Artif. Intell. 64(2-3): 209-246 (2012) - [i7]Tomasz Gogacz, Jerzy Marcinkowski:
Converging to the Chase - a Tool for Finite Controllability. CoRR abs/1204.3432 (2012) - 2011
- [c19]Jerzy Marcinkowski, Jakub Michaliszyn:
The Ultimate Undecidability Result for the Halpern-Shoham Logic. LICS 2011: 377-386 - 2010
- [c18]Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski:
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. ICALP (2) 2010: 357-368 - [i6]Jerzy Marcinkowski, Jakub Michaliszyn:
The Last Paper on the Halpern-Shoham Interval Temporal Logic. CoRR abs/1010.4529 (2010)
2000 – 2009
- 2009
- [j7]Cristian Molinaro, Jan Chomicki, Jerzy Marcinkowski:
Disjunctive databases for representing repairs. Ann. Math. Artif. Intell. 57(2): 103-124 (2009) - [j6]Jerzy Marcinkowski, Piotr Wieczorek:
Modulo Constraints and the Complexity of Typechecking XML Views. Theory Comput. Syst. 44(4): 620-652 (2009) - [i5]Jerzy Marcinkowski, Jakub Michaliszyn:
The cost of being co-Buchi is nonlinear. CoRR abs/0906.0072 (2009) - [i4]Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowski:
Prioritized Repairing and Consistent Query Answering in Relational Databases. CoRR abs/0908.0464 (2009) - 2008
- [i3]Cristian Molinaro, Jan Chomicki, Jerzy Marcinkowski:
Disjunctive Databases for Representing Repairs. CoRR abs/0811.2117 (2008) - 2006
- [c17]Jerzy Marcinkowski:
On the Expressive Power of Graph Logic. CSL 2006: 486-500 - [c16]Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowski:
Preference-Driven Querying of Inconsistent Relational Databases. EDBT Workshops 2006: 318-335 - 2005
- [j5]Jan Chomicki, Jerzy Marcinkowski:
Minimal-change integrity maintenance using tuple deletions. Inf. Comput. 197(1-2): 90-121 (2005) - [c15]Jan Chomicki, Jerzy Marcinkowski:
On the Computational Complexity of Minimal-Change Integrity Maintenance in Relational Databases. Inconsistency Tolerance 2005: 119-150 - 2004
- [c14]Jan Chomicki, Jerzy Marcinkowski, Slawomir Staworko:
Computing consistent query answers using conflict hypergraphs. CIKM 2004: 417-426 - [c13]Jan Chomicki, Jerzy Marcinkowski, Slawomir Staworko:
Hippo: A System for Computing Consistent Answers to a Class of SQL Queries. EDBT 2004: 841-844 - [c12]Jerzy Marcinkowski, Jan Otop, Grzegorz Stelmaszek:
On a Semantic Subsumption Test. LPAR 2004: 142-153 - [e1]Jerzy Marcinkowski, Andrzej Tarlecki:
Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings. Lecture Notes in Computer Science 3210, Springer 2004, ISBN 3-540-23024-6 [contents] - 2003
- [j4]Jerzy Marcinkowski, Leszek Pacholski:
Thue trees. Ann. Pure Appl. Log. 119(1-3): 19-59 (2003) - [j3]Daniel Kirsten, Jerzy Marcinkowski:
Two techniques in the area of the star problem in trace monoids. Theor. Comput. Sci. 309(1-3): 381-412 (2003) - 2002
- [j2]Jerzy Marcinkowski:
The [exist]*[forall]* Part of the Theory of Ground Term Algebra Modulo an AC Symbol is Undecidable. Inf. Comput. 178(2): 412-421 (2002) - [c11]Jerzy Marcinkowski, Tomasz Truderung:
Optimal Complexity Bounds for Positive LTL Games. CSL 2002: 262-275 - [i2]Jan Chomicki, Jerzy Marcinkowski:
On the Computational Complexity of Consistent Query Answers. CoRR cs.DB/0204010 (2002) - [i1]Jan Chomicki, Jerzy Marcinkowski:
Minimal-Change Integrity Maintenance Using Tuple Deletions. CoRR cs.DB/0212004 (2002) - 2001
- [c10]André Arnold, Giacomo Lenzi, Jerzy Marcinkowski:
The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree. LICS 2001: 157-166 - [c9]David Janin, Jerzy Marcinkowski:
A Toolkit for First Order Extensions of Monadic Games. STACS 2001: 353-364
1990 – 1999
- 1999
- [j1]Jerzy Marcinkowski:
Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs. SIAM J. Comput. 29(1): 231-257 (1999) - [c8]Jerzy Marcinkowski:
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. CSL 1999: 338-349 - [c7]Daniel Kirsten, Jerzy Marcinkowski:
Two Techniques in the Area of the Star Problem. ICALP 1999: 483-492 - [c6]Jerzy Marcinkowski:
Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol. RTA 1999: 92-102 - 1997
- [c5]Jerzy Marcinkowski:
Undecidability of the First Order Theory of One-Step Right Ground Rewriting. RTA 1997: 241-253 - 1996
- [c4]Jerzy Marcinkowski:
DATALOG SIRUPs Uniform Boundedness is Undecidable. LICS 1996: 13-24 - [c3]Jerzy Marcinkowski:
The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs. STACS 1996: 427-438 - 1993
- [c2]Jerzy Marcinkowski:
A Horn Clause that Implies and Undecidable Set of Horn Clauses. CSL 1993: 223-237 - 1992
- [c1]Jerzy Marcinkowski, Leszek Pacholski:
Undecidability of the Horn-Clause Implication Problem. FOCS 1992: 354-362
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 2024-07-20 20:33 CEST 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:
