Logowanie

Języki

  • Polski
  • English
fotopracownik

Nawigacja

prof. Jerzy Marcinkowski

Pracownik  

2015

  1. T. Gogacz, J. Marcinkowski, The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable, LICS 2015: 281-292.

2014

  1. T. Gogacz, J. Marcinkowski, All-Instances Termination of Chase is Undecidable, Proceedings - International Colloquium on Automata, Languages, and Programming - 2014, s. 293-304.
  2. J. Marcinkowski, J. Michaliszyn, The Undecidability of the Logic of Subintervals, Fundamenta Informaticae. 131(2): 217-240, 2014. (http://dx.doi.org/10.3233/FI-2014-1011)

2013

  1. T. Gogacz, J. Marcinkowski, Converging to the Chase - A Tool for Finite Controllability, 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, s. 540-549. (http://doi.ieeecomputersociety.org/10.1109/LICS.2013.61)
  2. T. Gogacz, J. Marcinkowski, On the BDD/FC conjecture, Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June // s. 22 - 27, ACM 2013 ISBN 978-1-4503-2066-5: 127-138.

2012

  1. S. Staworko, J. Chomicki, J. Marcinkowski, Prioritized repairing and consistent query answering in relational databases, Annals of Mathematics and Artificial Intelligence . 64(2-3): 209-246 (2012), RF.

2011

  1. J. Marcinkowski, J. Michaliszyn, The ultimate undecidability result for the Halpern-Shoham Logic, Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, 377-386.

2010

  1. E. Kieroński, J. Marcinkowski, J. Michaliszyn, B and D Are Enough to Make the Halpern-Shoham Logic Undecidable, Lecture Notes in Computer Science, Volume 6199, ICALP (2) 2010: 357-368, 2010.

2009

  1. J. Chomicki, J. Marcinkowski, C. Molinaro, Disjunctive Databases for Representing Repairs, Annals of Mathematics and Artificial Intelligence, opublikowane on-line 29 września 2009. (http://www.springerlink.com/content/uv1440vn1205774g/)
  2. J. Marcinkowski, The cost of being co-Buchi is nonlinear, June lst 2009, journals/corr/abs-0906-0072. (http://arxiv.org/PS_cache/arxiv/pdf/0906/0906.0072v2.pdf)
  3. J. Marcinkowski, P. Wieczorek, Modulo Constraints and the Complexity of Typechecking XML Views, Theory of Computing Systems, Volume 44, Number 4, May, 2009, 620-652, Springer. (http://www.springerlink.com/content/37q886x411657733/)

2008

  1. J. Marcinkowski, P. Wieczorek, Modulo Constraints and the Complexity of Typechecking XML Views, Theory of Computing Systems, Springer 2008.

2006

  1. J. Chomicki, J. Marcinkowski, S. Staworko, Preference-Driven Querying of Inconsistent Relational Databases, Proceedings of the International Workshop on In-consistency and Incompleteness in Databases Springer LNCS 4254, 2006, 318-335.
  2. J. Marcinkowski, On the Expressive Power of Graph Logic, Proceedings of the 2006 Annual Conference of the European Association of Computer Science Logic CSL 06, LNCS, Preference-Driven Querying of Inconsistent Relational Databases.

2005

  1. J. Chomicki, J. Marcinkowski, Minimal-Change Integrity Maintenance Using Tuple Deletions, Information and Computation 197, 2005, 90-121.
  2. J. Chomicki, J. Marcinkowski, On the Computational Complexity of Minimal-Change Integrity Maintenance in Relational Databases (red. L. Bertossi, A. Hunter, T. Schaub), Chapter in Integrity Tolerance, LNCS 3300, 2005, 119-150.
  3. J. Marcinkowski, J. Otop, G. Stelmaszek, On a Semantic Subsumption Test, 11th LPAR — International Conference on Logic for Programming Artificial Intelligence and Reasoning, LNCS 3452, 2005, 142–153.

2004

  1. J. Chomicki, J. Marcinkowski, S. Staworko, Computing Consistent Query Answers Using Conflict Hypergraphs, Proc. 13th ACM Conference on Information and Knowledge Management (CIKM), Arlington, Virginia, ACM Press, November 2004, 417-426.
  2. J. Chomicki, J. Marcinkowski, S. Staworko, Hippo: A System for Computing Consistent Answers to a Class of SQL Queries, Lecture Notes in Computer Science 2992 Springer 2004, 841-844.

2003

  1. J. Marcinkowski, L. Pacholski, Thue trees, Annals of Pure and Applied Logic, vol. 119, issue 1-3 (2003), pp 19-59.
  2. D. Kirsten, J. Marcinkowski, Two Techniques in the Area of the Star Problem, (rozszerzona wersja (8)), Theoretical Computer Science, Vol 309/1-3 2003, pp 381-412.

2002

  1. J. Marcinkowski, The ∃*∀* part of the theory of ground term algebra modulo an AC symbol is undecidable, Information and Computation 178, 2002, 412-421.
  2. J. Marcinkowski, T. Truderung, Optimal Complexity Bounds for Positive LTL Games, Proceedings of CSL 2002, LNCS 2471, Springer 2002, 262-275.

2001

  1. D. Janin, J. Marcinkowski, Toolkit for First Order Extensions of Monadic Games, Proceedings of STACS 2001. Springer, LNCS 2010, 353-365.
  2. A. Arnold, G. Lenzi, J. Marcinkowski, The hierarchy inside closed monadic ∑₁ collapses on the infinite binary tree, Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 157-167, 2001.

1999

  1. J. Marcinkowski, Undecidability of the ∃*∀* part of the theory of ground term algebra modulo an AC symbol, Proceedings of 10th International Conference on Rewriting Techniques and Applications (RTA 99); Springer, LNCS 1631, pp 92-102.
  2. J. Marcinkowski, Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraisse games, 11 pages, Proceedings of the Annual Conference of the European Association of Computer Science Logic CSL 99, Springer LNCS 1683, pp 338-349.
  3. J. Marcinkowski, Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs, SIAM Journal on Computing 1999, volume 29, no. 1, pp 231-257.
  4. D. Kirsten, J. Marcinkowski, Two Techniques in the Area of the Star Problem, 1999, Proceedings of 26th International Colloquium on Automata, Languages and Programming (ICALP 99); Springer, LNCS 1644, pp 483-492.

1997

  1. J. Marcinkowski, Undecidability of the first order theory of one-step right ground rewriting, Proceedings of 8th Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 1232, Springer, Berlin 1997, 241-253.

1996

  1. J. Marcinkowski, The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG programs, Proc. 13th STACS, Lecture Notes in Computer Science 1046, Springer, Berlin 1996, 427-438.
  2. J. Marcinkowski, Undecidability of uniform boundedness for single rule DATALOG programs, Proc. 11th Annual IEEE Symposium on Logic in Comp. Sc., IEEE Press, 1996, 13-24.

1994

  1. J. Marcinkowski, A Horn clause that implies an undecidable set of Horn clauses, Proc. 7th Conf. Computer Science Logic, LNCS 832, Springer-Verlag, 1994, 223-237.

Adres:
Instytut Informatyki
Uniwersytetu Wroclawskiego
ul. Joliot-Curie 15
50-383 Wroclaw
Sekretariat
tel.: 71 375 7800
tel.: 71 325 1271
fax: 71 375 7801
sekretariat@ii.uni.wroc.pl
Dziekanat
tel.: 71 375 7892
dziekan@ii.uni.wroc.pl
sprawy studenckie:
dziekanat@ii.uni.wroc.pl
Portiernia
tel.: 71 375 7958
Redaktor strony WWW
redaktor@ii.uni.wroc.pl
Projekt
MAKOS