Search the dblp DataBase
Jerzy Marcinkowski :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Jan Chomicki , Jerzy Marcinkowski , Slawomir Staworko Computing consistent query answers using conflict hypergraphs. [Citation Graph (0, 0)][DBLP ] CIKM, 2004, pp:417-426 [Conf ] Jerzy Marcinkowski On the Expressive Power of Graph Logic. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:486-500 [Conf ] Jerzy Marcinkowski A Horn Clause that Implies and Undecidable Set of Horn Clauses. [Citation Graph (0, 0)][DBLP ] CSL, 1993, pp:223-237 [Conf ] Jerzy Marcinkowski Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. [Citation Graph (0, 0)][DBLP ] CSL, 1999, pp:338-349 [Conf ] Jerzy Marcinkowski , Tomasz Truderung Optimal Complexity Bounds for Positive LTL Games. [Citation Graph (0, 0)][DBLP ] CSL, 2002, pp:262-275 [Conf ] Jan Chomicki , Jerzy Marcinkowski On the Computational Complexity of Minimal-Change Integrity Maintenance in Relational Databases. [Citation Graph (0, 0)][DBLP ] Inconsistency Tolerance, 2005, pp:119-150 [Conf ] Jan Chomicki , Jerzy Marcinkowski , Slawomir Staworko Hippo: A System for Computing Consistent Answers to a Class of SQL Queries. [Citation Graph (0, 0)][DBLP ] EDBT, 2004, pp:841-844 [Conf ] Slawomir Staworko , Jan Chomicki , Jerzy Marcinkowski Preference-Driven Querying of Inconsistent Relational Databases. [Citation Graph (0, 0)][DBLP ] EDBT Workshops, 2006, pp:318-335 [Conf ] Jerzy Marcinkowski , Leszek Pacholski Undecidability of the Horn-Clause Implication Problem [Citation Graph (0, 0)][DBLP ] FOCS, 1992, pp:354-362 [Conf ] Daniel Kirsten , Jerzy Marcinkowski Two Techniques in the Area of the Star Problem. [Citation Graph (0, 0)][DBLP ] ICALP, 1999, pp:483-492 [Conf ] André Arnold , Giacomo Lenzi , Jerzy Marcinkowski The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree. [Citation Graph (0, 0)][DBLP ] LICS, 2001, pp:157-166 [Conf ] Jerzy Marcinkowski DATALOG SIRUPs Uniform Boundedness is Undecidable. [Citation Graph (0, 0)][DBLP ] LICS, 1996, pp:13-24 [Conf ] Jerzy Marcinkowski , Jan Otop , Grzegorz Stelmaszek On a Semantic Subsumption Test. [Citation Graph (0, 0)][DBLP ] LPAR, 2004, pp:142-153 [Conf ] Jerzy Marcinkowski Undecidability of the First Order Theory of One-Step Right Ground Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 1997, pp:241-253 [Conf ] Jerzy Marcinkowski Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol. [Citation Graph (0, 0)][DBLP ] RTA, 1999, pp:92-102 [Conf ] David Janin , Jerzy Marcinkowski A Toolkit for First Order Extensions of Monadic Games. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:353-364 [Conf ] Jerzy Marcinkowski The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs. [Citation Graph (0, 0)][DBLP ] STACS, 1996, pp:427-438 [Conf ] Jerzy Marcinkowski , Leszek Pacholski Thue trees. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2003, v:119, n:1-3, pp:19-59 [Journal ] Jan Chomicki , Jerzy Marcinkowski On the Computational Complexity of Consistent Query Answers [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Jan Chomicki , Jerzy Marcinkowski Minimal-Change Integrity Maintenance Using Tuple Deletions [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Jan Chomicki , Jerzy Marcinkowski Minimal-change integrity maintenance using tuple deletions. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2005, v:197, n:1-2, pp:90-121 [Journal ] Jerzy Marcinkowski The [exist]*[forall]* Part of the Theory of Ground Term Algebra Modulo an AC Symbol is Undecidable. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2002, v:178, n:2, pp:412-421 [Journal ] Jerzy Marcinkowski Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:29, n:1, pp:231-257 [Journal ] Daniel Kirsten , Jerzy Marcinkowski Two techniques in the area of the star problem in trace monoids. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:309, n:1-3, pp:381-412 [Journal ] B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. [Citation Graph (, )][DBLP ] Disjunctive databases for representing repairs. [Citation Graph (, )][DBLP ] Disjunctive Databases for Representing Repairs [Citation Graph (, )][DBLP ] The cost of being co-Buchi is nonlinear [Citation Graph (, )][DBLP ] Prioritized Repairing and Consistent Query Answering in Relational Databases [Citation Graph (, )][DBLP ] Search in 0.227secs, Finished in 0.229secs