Jerzy Marcinkowski

SIAM J. Comput., June, 2023

2022

A Journey to the Frontiers of Query Rewritability.

[BibT_eX]

[DOI]

David Carral

Sebastian Rudolph

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Determinacy of Real Conjunctive Queries. The Boolean Case.

[BibT_eX]

[DOI]

Jaroslaw Kwiecien

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Conservative Extensions for Existential Rules.

[BibT_eX]

[DOI]

Jean Christoph Jung

Carsten Lutz

Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

2020

All-Instances Restricted Chase Termination for Linear TGDs.

[BibT_eX]

[DOI]

Künstliche Intell., 2020

All-Instances Restricted Chase Termination.

[BibT_eX]

[DOI]

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

What Makes a Variant of Query Determinacy (Un)Decidable? (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Database Theory, 2020

2019

All-Instances Restricted Chase Termination: The Guarded Case.

[BibT_eX]

[DOI]

CoRR, 2019

The First Order Truth Behind Undecidability of Regular Path Queries Determinacy.

[BibT_eX]

[DOI]

Grzegorz Gluch

Proceedings of the 22nd International Conference on Database Theory, 2019

2018

Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable.

[BibT_eX]

[DOI]

Grzegorz Gluch

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

Converging to the chase - A tool for finite controllability.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

2016

Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015

The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

The Undecidability of the Logic of Subintervals.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Termination of oblivious chase is undecidable.

[BibT_eX]

[DOI]

CoRR, 2014

All-Instances Termination of Chase is Undecidable.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

On the BDD/FC conjecture.

[BibT_eX]

[DOI]

Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

2012

Prioritized repairing and consistent query answering in relational databases.

[BibT_eX]

[DOI]

Slawek Staworko

Ann. Math. Artif. Intell., 2012

2011

The Ultimate Undecidability Result for the Halpern-Shoham Logic.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010

The Last Paper on the Halpern-Shoham Interval Temporal Logic

[BibT_eX]

[DOI]

CoRR, 2010

B and D Are Enough to Make the Halpern-Shoham Logic Undecidable.

[BibT_eX]

[DOI]

Emanuel Kieronski

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Modulo Constraints and the Complexity of Typechecking XML Views.

[BibT_eX]

[DOI]

Piotr Wieczorek

Theory Comput. Syst., 2009

The cost of being co-Buchi is nonlinear

[BibT_eX]

[DOI]

CoRR, 2009

Disjunctive databases for representing repairs.

[BibT_eX]

[DOI]

Cristian Molinaro

Ann. Math. Artif. Intell., 2009

2006

Preference-Driven Querying of Inconsistent Relational Databases.

[BibT_eX]

[DOI]

Slawomir Staworko

Proceedings of the Current Trends in Database Technology - EDBT 2006, 2006

On the Expressive Power of Graph Logic.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

Minimal-change integrity maintenance using tuple deletions.

[BibT_eX]

[DOI]

Inf. Comput., 2005

On the Computational Complexity of Minimal-Change Integrity Maintenance in Relational Databases.

[BibT_eX]

[DOI]

Proceedings of the Inconsistency Tolerance [result from a Dagstuhl seminar], 2005

2004

On a Semantic Subsumption Test.

[BibT_eX]

[DOI]

Jan Otop

Grzegorz Stelmaszek

Proceedings of the Logic for Programming, 2004

Hippo: A System for Computing Consistent Answers to a Class of SQL Queries.

[BibT_eX]

[DOI]

Slawomir Staworko

Proceedings of the Advances in Database Technology, 2004

Computing consistent query answers using conflict hypergraphs.

[BibT_eX]

[DOI]

Slawomir Staworko

Proceedings of the 2004 ACM CIKM International Conference on Information and Knowledge Management, 2004

2003

Two techniques in the area of the star problem in trace monoids.

[BibT_eX]

[DOI]

Daniel Kirsten

Theor. Comput. Sci., 2003

Thue trees.

[BibT_eX]

[DOI]

Leszek Pacholski

Ann. Pure Appl. Log., 2003

2002

The [exist]*[forall]* Part of the Theory of Ground Term Algebra Modulo an AC Symbol is Undecidable.

[BibT_eX]

[DOI]

Inf. Comput., 2002

On the Computational Complexity of Consistent Query Answers

[BibT_eX]

[DOI]

CoRR, 2002

Optimal Complexity Bounds for Positive LTL Games.

[BibT_eX]

[DOI]

Tomasz Truderung

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

A Toolkit for First Order Extensions of Monadic Games.

[BibT_eX]

[DOI]

David Janin

Proceedings of the STACS 2001, 2001

The Hierarchy inside Closed Monadic Sigma<sub>1</sub> Collapses on the Infinite Binary Tree.

[BibT_eX]

[DOI]

André Arnold

Giacomo Lenzi

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

1999

Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

Two Techniques in the Area of the Star Problem.

[BibT_eX]

[DOI]

Daniel Kirsten

Proceedings of the Automata, 1999

Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1997

Undecidability of the First Order Theory of One-Step Right Ground Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

1996

The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs.

[BibT_eX]

[DOI]

Proceedings of the STACS 96, 1996

DATALOG SIRUPs Uniform Boundedness is Undecidable.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 1996

1993

A Horn Clause that Implies and Undecidable Set of Horn Clauses.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 7th Workshop, 1993

1992

Undecidability of the Horn-Clause Implication Problem

[BibT_eX]

[DOI]