| Minimal-change integrity maintenance using tuple deletions J Chomicki, J Marcinkowski Information and Computation 197 (1-2), 90-121, 2005 | 441 | 2005 |
| Computing consistent query answers using conflict hypergraphs J Chomicki, J Marcinkowski, S Staworko Proceedings of the thirteenth ACM international conference on Information …, 2004 | 126 | 2004 |
| Prioritized repairing and consistent query answering in relational databases S Staworko, J Chomicki, J Marcinkowski Annals of Mathematics and Artificial Intelligence 64 (2), 209-246, 2012 | 117 | 2012 |
| On the computational complexity of minimal-change integrity maintenance in relational databases J Chomicki, J Marcinkowski Inconsistency Tolerance, 119-150, 2005 | 84 | 2005 |
| Hippo: A system for computing consistent answers to a class of SQL queries J Chomicki, J Marcinkowski, S Staworko International Conference on Extending Database Technology, 841-844, 2004 | 66 | 2004 |
| Undecidability of the horn-clause implication problem J Marcinkowski, L Pacholski FOCS, 354-362, 1992 | 63 | 1992 |
| The undecidability of the logic of subintervals J Marcinkowski, J Michaliszyn Fundamenta Informaticae 131 (2), 217-240, 2014 | 55 | 2014 |
| All–instances termination of chase is undecidable T Gogacz, J Marcinkowski International Colloquium on Automata, Languages, and Programming, 293-304, 2014 | 50 | 2014 |
| The ultimate undecidability result for the Halpern-Shoham logic J Marcinkowski, J Michaliszyn 2011 IEEE 26th Annual Symposium on Logic in Computer Science, 377-386, 2011 | 35 | 2011 |
| Preference-driven querying of inconsistent relational databases S Staworko, J Chomicki, J Marcinkowski International Conference on Extending Database Technology, 318-335, 2006 | 32 | 2006 |
| Undecidability of the first order theory of one-step right ground rewriting J Marcinkowski International Conference on Rewriting Techniques and Applications, 241-253, 1997 | 32 | 1997 |
| The hunt for a red spider: Conjunctive query determinacy is undecidable T Gogacz, J Marcinkowski arXiv preprint arXiv:1501.01817, 2015 | 25 | 2015 |
| Achilles, turtle, and undecidable boundedness problems for small datalog programs J Marcinkowski SIAM Journal on Computing 29 (1), 231-257, 1999 | 23 | 1999 |
| On the computational complexity of consistent query answers J Chomicki, J Marcinkowski arXiv preprint cs/0204010, 2002 | 21 | 2002 |
| Converging to the Chase--A Tool for Finite Controllability T Gogacz, J Marcinkowski 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 540-549, 2013 | 20 | 2013 |
| All-instances restricted chase termination T Gogacz, J Marcinkowski, A Pieris Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020 | 19 | 2020 |
| Red spider meets a rainworm: Conjunctive query finite determinacy is undecidable T Gogacz, J Marcinkowski Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016 | 19 | 2016 |
| B and D are enough to make the Halpern–Shoham logic undecidable J Marcinkowski, J Michaliszyn, E Kieroński Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010 | 16 | 2010 |
| A toolkit for first order extensions of monadic games D Janin, J Marcinkowski STACS 2001: 18th Annual Symposium on Theoretical Aspects of Computer Science …, 2001 | 16 | 2001 |
| A Horn clause that implies an undecidable set of Horn clauses J Marcinkowski International Workshop on Computer Science Logic, 223-237, 1993 | 14 | 1993 |
