The SCEAS System
Navigation Menu

Search the dblp DataBase


Jerzy Marcinkowski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jan Chomicki, Jerzy Marcinkowski, Slawomir Staworko
    Computing consistent query answers using conflict hypergraphs. [Citation Graph (0, 0)][DBLP]
    CIKM, 2004, pp:417-426 [Conf]
  2. Jerzy Marcinkowski
    On the Expressive Power of Graph Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:486-500 [Conf]
  3. Jerzy Marcinkowski
    A Horn Clause that Implies and Undecidable Set of Horn Clauses. [Citation Graph (0, 0)][DBLP]
    CSL, 1993, pp:223-237 [Conf]
  4. Jerzy Marcinkowski
    Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:338-349 [Conf]
  5. Jerzy Marcinkowski, Tomasz Truderung
    Optimal Complexity Bounds for Positive LTL Games. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:262-275 [Conf]
  6. 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]
  7. 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]
  8. 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]
  9. Jerzy Marcinkowski, Leszek Pacholski
    Undecidability of the Horn-Clause Implication Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:354-362 [Conf]
  10. Daniel Kirsten, Jerzy Marcinkowski
    Two Techniques in the Area of the Star Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:483-492 [Conf]
  11. 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]
  12. Jerzy Marcinkowski
    DATALOG SIRUPs Uniform Boundedness is Undecidable. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:13-24 [Conf]
  13. Jerzy Marcinkowski, Jan Otop, Grzegorz Stelmaszek
    On a Semantic Subsumption Test. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:142-153 [Conf]
  14. 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]
  15. 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]
  16. David Janin, Jerzy Marcinkowski
    A Toolkit for First Order Extensions of Monadic Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:353-364 [Conf]
  17. 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]
  18. 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]
  19. Jan Chomicki, Jerzy Marcinkowski
    On the Computational Complexity of Consistent Query Answers [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  20. Jan Chomicki, Jerzy Marcinkowski
    Minimal-Change Integrity Maintenance Using Tuple Deletions [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  21. 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]
  22. 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]
  23. 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]
  24. 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]

  25. B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. [Citation Graph (, )][DBLP]

  26. Disjunctive databases for representing repairs. [Citation Graph (, )][DBLP]

  27. Disjunctive Databases for Representing Repairs [Citation Graph (, )][DBLP]

  28. The cost of being co-Buchi is nonlinear [Citation Graph (, )][DBLP]

  29. Prioritized Repairing and Consistent Query Answering in Relational Databases [Citation Graph (, )][DBLP]

Search in 0.227secs, Finished in 0.229secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002