| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Jerzy Marcinkowski Jan Chomicki , Jerzy Marcinkowski: On the Computational Complexity of Minimal-Change Integrity Maintenance in Relational Databases. Inconsistency Tolerance 2005 : 119-150 Jan Chomicki , Jerzy Marcinkowski: Minimal-change integrity maintenance using tuple deletions. Inf. Comput. 197 (1-2): 90-121 (2005) Jerzy Marcinkowski, Andrzej Tarlecki : Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings Springer 2004 Jan Chomicki , Jerzy Marcinkowski, Slawomir Staworko : Computing consistent query answers using conflict hypergraphs. CIKM 2004 : 417-426 Jan Chomicki , Jerzy Marcinkowski, Slawomir Staworko : Hippo: A System for Computing Consistent Answers to a Class of SQL Queries. EDBT 2004 : 841-844 Jerzy Marcinkowski, Jan Otop , Grzegorz Stelmaszek : On a Semantic Subsumption Test. LPAR 2004 : 142-153 Jerzy Marcinkowski, Leszek Pacholski : Thue trees. Ann. Pure Appl. Logic 119 (1-3): 19-59 (2003) Daniel Kirsten , Jerzy Marcinkowski: Two techniques in the area of the star problem in trace monoids. Theor. Comput. Sci. 309 (1-3): 381-412 (2003) Jerzy Marcinkowski, Tomasz Truderung : Optimal Complexity Bounds for Positive LTL Games. CSL 2002 : 262-275 Jan Chomicki , Jerzy Marcinkowski: On the Computational Complexity of Consistent Query Answers CoRR cs.DB/0204010 : (2002) Jan Chomicki , Jerzy Marcinkowski: Minimal-Change Integrity Maintenance Using Tuple Deletions CoRR cs.DB/0212004 : (2002) Jerzy Marcinkowski: The [exist]*[forall]* Part of the Theory of Ground Term Algebra Modulo an AC Symbol is Undecidable. Inf. Comput. 178 (2): 412-421 (2002) André Arnold , Giacomo Lenzi , Jerzy Marcinkowski: The Hierarchy inside Closed Monadic Sigma 1 Collapses on the Infinite Binary Tree. LICS 2001 : 157-166 David Janin , Jerzy Marcinkowski: A Toolkit for First Order Extensions of Monadic Games. STACS 2001 : 353-364 Jerzy Marcinkowski: Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. CSL 1999 : 338-349 Daniel Kirsten , Jerzy Marcinkowski: Two Techniques in the Area of the Star Problem. ICALP 1999 : 483-492 Jerzy Marcinkowski: Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol. RTA 1999 : 92-102 Jerzy Marcinkowski: Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs. SIAM J. Comput. 29 (1): 231-257 (1999) Jerzy Marcinkowski: Undecidability of the First Order Theory of One-Step Right Ground Rewriting. RTA 1997 : 241-253 Jerzy Marcinkowski: DATALOG SIRUPs Uniform Boundedness is Undecidable. LICS 1996 : 13-24 Jerzy Marcinkowski: The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs. STACS 1996 : 427-438 Jerzy Marcinkowski: A Horn Clause that Implies and Undecidable Set of Horn Clauses. CSL 1993 : 223-237 Jerzy Marcinkowski, Leszek Pacholski : Undecidability of the Horn-Clause Implication Problem FOCS 1992 : 354-362 1 [ 11 ] 2 [ 13 ] [ 14 ] [ 19 ] [ 20 ] [ 22 ] [ 23 ] 3 [ 10 ] 4 [ 8 ] [ 16 ] 5 [ 11 ] 6 [ 18 ] 7 [ 1 ] [ 17 ] 8 [ 19 ] [ 20 ] 9 [ 18 ] 10 [ 21 ] 11 [ 15 ]  ©2005 Association for Computing Machinery |
