Jerzy Marcinkowski

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 17

Top Topics

Conjunctive Queries

Regular Path Queries

Guarded Fragment

Query Containment

Top Venues

Publications

Jerzy Marcinkowski, Mateusz Orda
Bag Semantics Conjunctive Query Containment. Four Small Steps Towards Undecidability. Proc. ACM Manag. Data 2 (2) (2024)
Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris
Uniform Restricted Chase Termination. SIAM J. Comput. 52 (3) (2023)
Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
Determinacy of Real Conjunctive Queries. The Boolean Case. PODS (2022)
Jean Christoph Jung, Carsten Lutz, Jerzy Marcinkowski
Conservative Extensions for Existential Rules. KR (2022)
Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph
A Journey to the Frontiers of Query Rewritability. PODS (2022)
Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
Determinacy of Real Conjunctive Queries. The Boolean Case. CoRR (2021)
Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph
A Journey to the Frontiers of Query Rewritability. CoRR (2020)
Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris
All-Instances Restricted Chase Termination. PODS (2020)
Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris
All-Instances Restricted Chase Termination for Linear TGDs. Künstliche Intell. 34 (4) (2020)
Jerzy Marcinkowski
What Makes a Variant of Query Determinacy (Un)Decidable? (Invited Talk). ICDT (2020)
Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
The First Order Truth Behind Undecidability of Regular Path Queries Determinacy. ICDT (2019)
Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris
All-Instances Restricted Chase Termination: The Guarded Case. CoRR (2019)
Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
The First Order Truth behind Undecidability of Regular Path Queries Determinacy. CoRR (2018)
Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable. LICS (2018)
Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable. CoRR (2018)
Tomasz Gogacz, Jerzy Marcinkowski
Converging to the chase - A tool for finite controllability. J. Comput. Syst. Sci. 83 (1) (2017)
Tomasz Gogacz, Jerzy Marcinkowski
Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable. PODS (2016)
Tomasz Gogacz, Jerzy Marcinkowski
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable. CoRR (2015)
Tomasz Gogacz, Jerzy Marcinkowski
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable. LICS (2015)
Tomasz Gogacz, Jerzy Marcinkowski
Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable. CoRR (2015)
Jerzy Marcinkowski, Jakub Michaliszyn
The Undecidability of the Logic of Subintervals. Fundam. Informaticae 131 (2) (2014)
Tomasz Gogacz, Jerzy Marcinkowski
All-Instances Termination of Chase is Undecidable. ICALP (2) (2014)
Tomasz Gogacz, Jerzy Marcinkowski
Termination of oblivious chase is undecidable. CoRR (2014)
Tomasz Gogacz, Jerzy Marcinkowski
On the BDD/FC Conjecture. CoRR (2014)
Tomasz Gogacz, Jerzy Marcinkowski
Converging to the Chase - A Tool for Finite Controllability. LICS (2013)
Tomasz Gogacz, Jerzy Marcinkowski
On the BDD/FC conjecture. PODS (2013)
Slawek Staworko, Jan Chomicki, Jerzy Marcinkowski
Prioritized repairing and consistent query answering in relational databases. Ann. Math. Artif. Intell. 64 (2-3) (2012)
Tomasz Gogacz, Jerzy Marcinkowski
Converging to the Chase - a Tool for Finite Controllability CoRR (2012)
Jerzy Marcinkowski, Jakub Michaliszyn
The Ultimate Undecidability Result for the Halpern-Shoham Logic. LICS (2011)
Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. ICALP (2) (2010)
Jerzy Marcinkowski, Jakub Michaliszyn
The Last Paper on the Halpern-Shoham Interval Temporal Logic CoRR (2010)
Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowski
Prioritized Repairing and Consistent Query Answering in Relational Databases CoRR (2009)
Jerzy Marcinkowski, Piotr Wieczorek
Modulo Constraints and the Complexity of Typechecking XML Views. Theory Comput. Syst. 44 (4) (2009)
Jerzy Marcinkowski, Jakub Michaliszyn
The cost of being co-Buchi is nonlinear CoRR (2009)
Cristian Molinaro, Jan Chomicki, Jerzy Marcinkowski
Disjunctive databases for representing repairs. Ann. Math. Artif. Intell. 57 (2) (2009)
Cristian Molinaro, Jan Chomicki, Jerzy Marcinkowski
Disjunctive Databases for Representing Repairs CoRR (2008)
Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowski
Preference-Driven Querying of Inconsistent Relational Databases. EDBT Workshops (2006)
Jerzy Marcinkowski
On the Expressive Power of Graph Logic. CSL (2006)
Jan Chomicki, Jerzy Marcinkowski
On the Computational Complexity of Minimal-Change Integrity Maintenance in Relational Databases. Inconsistency Tolerance (2005)
Jan Chomicki, Jerzy Marcinkowski
Minimal-change integrity maintenance using tuple deletions. Inf. Comput. 197 (1-2) (2005)
Jerzy Marcinkowski, Jan Otop, Grzegorz Stelmaszek
On a Semantic Subsumption Test. LPAR (2004)
Jan Chomicki, Jerzy Marcinkowski, Slawomir Staworko
Hippo: A System for Computing Consistent Answers to a Class of SQL Queries. EDBT (2004)
Jan Chomicki, Jerzy Marcinkowski, Slawomir Staworko
Computing consistent query answers using conflict hypergraphs. CIKM (2004)
Daniel Kirsten, Jerzy Marcinkowski
Two techniques in the area of the star problem in trace monoids. Theor. Comput. Sci. 309 (1-3) (2003)
Jerzy Marcinkowski, Leszek Pacholski
Thue trees. Ann. Pure Appl. Log. 119 (1-3) (2003)
Jerzy Marcinkowski
The [exist]*[forall]* Part of the Theory of Ground Term Algebra Modulo an AC Symbol is Undecidable. Inf. Comput. 178 (2) (2002)
Jan Chomicki, Jerzy Marcinkowski
Minimal-Change Integrity Maintenance Using Tuple Deletions CoRR (2002)
Jan Chomicki, Jerzy Marcinkowski
On the Computational Complexity of Consistent Query Answers CoRR (2002)
Jerzy Marcinkowski, Tomasz Truderung
Optimal Complexity Bounds for Positive LTL Games. CSL (2002)
David Janin, Jerzy Marcinkowski
A Toolkit for First Order Extensions of Monadic Games. STACS (2001)
André Arnold, Giacomo Lenzi, Jerzy Marcinkowski
Collapses on the Infinite Binary Tree. LICS (2001)
Jerzy Marcinkowski
Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs. SIAM J. Comput. 29 (1) (1999)
Jerzy Marcinkowski
Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol. RTA (1999)
Daniel Kirsten, Jerzy Marcinkowski
Two Techniques in the Area of the Star Problem. ICALP (1999)
Jerzy Marcinkowski
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. CSL (1999)
Jerzy Marcinkowski
Undecidability of the First Order Theory of One-Step Right Ground Rewriting. RTA (1997)
Jerzy Marcinkowski
The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs. STACS (1996)
Jerzy Marcinkowski
DATALOG SIRUPs Uniform Boundedness is Undecidable. LICS (1996)
Jerzy Marcinkowski
A Horn Clause that Implies and Undecidable Set of Horn Clauses. CSL (1993)
Jerzy Marcinkowski, Leszek Pacholski
Undecidability of the Horn-Clause Implication Problem FOCS (1992)