Undecidability of the Horn-Clause Implication Problem - Jerzy Marcinkowski; Leszek Pacholski (FOCS, 1992)

A Horn Clause that Implies and Undecidable Set of Horn Clauses. - Jerzy Marcinkowski (CSL, 1993)

DATALOG SIRUPs Uniform Boundedness is Undecidable. - Jerzy Marcinkowski (LICS, 1996)

The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs. - Jerzy Marcinkowski (STACS, 1996)

Undecidability of the First Order Theory of One-Step Right Ground Rewriting. - Jerzy Marcinkowski (RTA, 1997)

Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. - Jerzy Marcinkowski (CSL, 1999)

Two Techniques in the Area of the Star Problem. - Daniel Kirsten; Jerzy Marcinkowski (ICALP, 1999)

Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol. - Jerzy Marcinkowski (RTA, 1999)

Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs. - Jerzy Marcinkowski (SIAM J. Comput., 1999)

The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree. - André Arnold; Giacomo Lenzi; Jerzy Marcinkowski (LICS, 2001)

A Toolkit for First Order Extensions of Monadic Games. - David Janin; Jerzy Marcinkowski (STACS, 2001)

Optimal Complexity Bounds for Positive LTL Games. - Jerzy Marcinkowski; Tomasz Truderung (CSL, 2002)

On the Computational Complexity of Consistent Query Answers - Jan Chomicki; Jerzy Marcinkowski (CoRR, 2002)

The [exist]*[forall]* Part of the Theory of Ground Term Algebra Modulo an AC Symbol is Undecidable. - Jerzy Marcinkowski (Inf. Comput., 2002)

Thue trees. - Jerzy Marcinkowski; Leszek Pacholski (Ann. Pure Appl. Log., 2003)

Two techniques in the area of the star problem in trace monoids. - Daniel Kirsten; Jerzy Marcinkowski (Theor. Comput. Sci., 2003)

Computing consistent query answers using conflict hypergraphs. - Jan Chomicki; Jerzy Marcinkowski; Slawomir Staworko (CIKM, 2004)

Hippo: A System for Computing Consistent Answers to a Class of SQL Queries. - Jan Chomicki; Jerzy Marcinkowski; Slawomir Staworko (EDBT, 2004)

On a Semantic Subsumption Test. - Jerzy Marcinkowski; Jan Otop; Grzegorz Stelmaszek (LPAR, 2004)

On the Computational Complexity of Minimal-Change Integrity Maintenance in Relational Databases. - Jan Chomicki; Jerzy Marcinkowski (Inconsistency Tolerance, 2005)

Minimal-change integrity maintenance using tuple deletions. - Jan Chomicki; Jerzy Marcinkowski (Inf. Comput., 2005)

On the Expressive Power of Graph Logic. - Jerzy Marcinkowski (CSL, 2006)

Preference-Driven Querying of Inconsistent Relational Databases. - Slawomir Staworko; Jan Chomicki; Jerzy Marcinkowski (EDBT Workshops, 2006)

Disjunctive databases for representing repairs. - Cristian Molinaro; Jan Chomicki; Jerzy Marcinkowski (Ann. Math. Artif. Intell., 2009)

The cost of being co-Buchi is nonlinear - Jerzy Marcinkowski; Jakub Michaliszyn (CoRR, 2009)

Modulo Constraints and the Complexity of Typechecking XML Views. - Jerzy Marcinkowski; Piotr Wieczorek (Theory Comput. Syst., 2009)

B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. - Jerzy Marcinkowski; Jakub Michaliszyn; Emanuel Kieronski (ICALP (2), 2010)

The Last Paper on the Halpern-Shoham Interval Temporal Logic - Jerzy Marcinkowski; Jakub Michaliszyn (CoRR, 2010)

The Ultimate Undecidability Result for the Halpern-Shoham Logic. - Jerzy Marcinkowski; Jakub Michaliszyn (LICS, 2011)

Prioritized repairing and consistent query answering in relational databases. - Slawek Staworko; Jan Chomicki; Jerzy Marcinkowski (Ann. Math. Artif. Intell., 2012)

On the BDD/FC conjecture. - Tomasz Gogacz; Jerzy Marcinkowski (PODS, 2013)

All-Instances Termination of Chase is Undecidable. - Tomasz Gogacz; Jerzy Marcinkowski (ICALP (2), 2014)

Termination of oblivious chase is undecidable. - Tomasz Gogacz; Jerzy Marcinkowski (CoRR, 2014)

The Undecidability of the Logic of Subintervals. - Jerzy Marcinkowski; Jakub Michaliszyn (Fundam. Informaticae, 2014)

The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable. - Tomasz Gogacz; Jerzy Marcinkowski (LICS, 2015)

Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable. - Tomasz Gogacz; Jerzy Marcinkowski (PODS, 2016)

Converging to the chase - A tool for finite controllability. - Tomasz Gogacz; Jerzy Marcinkowski (J. Comput. Syst. Sci., 2017)

Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable. - Grzegorz Gluch; Jerzy Marcinkowski; Piotr Ostropolski-Nalewaja (LICS, 2018)

The First Order Truth Behind Undecidability of Regular Path Queries Determinacy. - Grzegorz Gluch; Jerzy Marcinkowski; Piotr Ostropolski-Nalewaja (ICDT, 2019)

All-Instances Restricted Chase Termination: The Guarded Case. - Tomasz Gogacz; Jerzy Marcinkowski; Andreas Pieris (CoRR, 2019)

What Makes a Variant of Query Determinacy (Un)Decidable? (Invited Talk). - Jerzy Marcinkowski (ICDT, 2020)

All-Instances Restricted Chase Termination. - Tomasz Gogacz; Jerzy Marcinkowski; Andreas Pieris (PODS, 2020)

All-Instances Restricted Chase Termination for Linear TGDs. - Tomasz Gogacz; Jerzy Marcinkowski; Andreas Pieris (Künstliche Intell., 2020)

Conservative Extensions for Existential Rules. - Jean Christoph Jung; Carsten Lutz; Jerzy Marcinkowski (KR, 2022)

Determinacy of Real Conjunctive Queries. The Boolean Case. - Jaroslaw Kwiecien; Jerzy Marcinkowski; Piotr Ostropolski-Nalewaja (PODS, 2022)

A Journey to the Frontiers of Query Rewritability. - Piotr Ostropolski-Nalewaja; Jerzy Marcinkowski; David Carral; Sebastian Rudolph (PODS, 2022)

Uniform Restricted Chase Termination. - Tomasz Gogacz; Jerzy Marcinkowski; Andreas Pieris (SIAM J. Comput., 2023)

Bag Semantics Conjunctive Query Containment. Four Small Steps Towards Undecidability. - Jerzy Marcinkowski; Mateusz Orda (Proc. ACM Manag. Data, 2024)

Bag Semantics Query Containment: The CQ vs. UCQ Case and Other Stories. - Jerzy Marcinkowski; Piotr Ostropolski-Nalewaja (CoRR, 2025)