Jerzy Marcinkowski

Tu jest CV, czyli niby o mnie.

Różne teksty

Tu są moje teksty prasowe o polskiej szkole i uczelni:

[lipiec 2009] Wywiad, którego udzieliłem wrocławskiej GW (1 VII 2009) i któremu Wyborcza dała tytuł "Zlikwidujmy gimnazja".

[sierpień 2009] Artykuł z Faktu, o tym jak na uczelniach postrzega się skutki reformy gimnazjalnej. Pan minister Handke był uprzejmy odpowiedzieć, a w swojej odpowiedzi dziwić się mojej ignorancji.

[październik 2009] Artykuł O micie masowego wykształcenia (GW 26 X 2009). Też bardzo dobry!

A tu są teksty na inne tematy:

i inne złośliwości (lata 1990)

A tu sprawa megabudowy Biblioteki Głównej UWr (głównie rok 2001). W roku 2007 mogę śmiało powiedzieć, że miałem w tej sprawie więcej racji, niż kiedykolwiek życzyłem sobie mieć.

Papers

1. Undecidability of the Horn Clause Implication Problem, Proceedings of 33rd Annual IEEE Symposium on Foundations of Computer Science; (co-author Leszek Pacholski) Los Alamitos 1992, pp 354-362;
2. A Horn Clause that Implies an Undecidable Set of Horn Clauses; Proceedings of the 1993 Annual Conference of the European Association of Computer Science Logic, (Springer, LNCS);
3. Undecidability of the Horn Clause Finite Implication Problem; Annual Conference of the European Association of Computer Science Logic, 1995, preprint;
4. The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs; 1995, Proceedings of 13th STACS, Springer, LNCS 1046, pp 427--438 1996;
5. Undecidability of Uniform Boundedness for Single Rule Datalog Programs; 1995, Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, pp 13--24, 1996;
6. Undecidability of the First Order Theory of One-Step Right Ground Rewriting; 1996, Proceedings of RTA 97, Springer LNCS.
7. Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs; 1997, SIAM Journal on Computing 1999, vol. 29.1 pp 231-257
8. Undecidability of the $\exists^*\forall^*$ part of the theory of ground term algebra modulo an AC symbol; Proceedings of RTA 99, Springer LNCS.
9. Two Techniques in the Area of the Star Problem; (co-author Daniel Kirsten) Proceedings of ICALP 99, Springer LNCS.
10. Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraisse games; Proceedings of CSL 99, Springer LNCS.
11. Toolkit for First Order Extensions of Monadic Games; (co-author David Janin) Proceedings of STACS 2001. Springer, LNCS.
12. The $\exists^*\forall^*$ part of the theory of ground term algebra modulo an AC symbol is undecidable; extended version of 8, Information and Computation 178, (2002)
13. The hierarchy inside closed monadic $\Sigma_1$ collapses on the infinite binary tree; (co-authors Andre Arnold and Giacomo Lenzi) 2001, Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001;
14. Optimal Complexity Bounds for Positive LTL Games; (co-author Tomasz Truderung) 2002, Proceedings of CSL 2002;
15. Thue trees; (co-author Leszek Pacholski) 1998, Annals of Pure and Applied Logic, vol 119 issue 1-3 (2003) pp 19-59.
16. Two techniques in the area of the star problem in trace monoids; (co-author Daniel Kirsten, extended version of 10 ) Theoretical Computer Science, 309 (2003) pp 381-412.
17. Minimal-Change Integrity Maintenance Using Tuple Deletions; (co-author Jan Chomicki), Information and Computation 197 (2005) pp 90-121,
18. Computing Consistent Query Answers Using Conflict Hypergraphs; Proc. 13th ACM Conference on Information and Knowledge Management (CIKM), November 2004, Arlington, Virginia, ACM Press, pp. 417-426. (co-authors Jan Chomicki, Slawomir Staworko)
19. Hippo: A System for Computing Consistent Answers to a Class of SQL Queries; EDBT 2004, Lecture Notes in Computer Science 2992, Springer 2004, pp 841-844 (co-authors Jan Chomicki, Slawomir Staworko)
20. On the Computational Complexity of Minimal-Change Integrity Maintenance in Relational Databases; Chapter in "Integrity Tolerance", L. Bertossi, A. Hunter, T. Schaub, editors, Springer-Verlag, LNCS 3300, 2005 pp 119-150 (co-author Jan Chomicki),
21. On a Semantic Subsumption Test; 11th LPAR -- International Conference on Logic for Programming Artificial Intelligence and Reasoning, Springer 2005, LNCS 3452, pp 142 - 153 (co-authors Jan Otop and Grzegorz Stelmaszek)
22. On the Expressive Power of Graph Logic; Proceedings of the 2006 Annual Conference of the European Association of Computer Science Logic CSL 06 , (Springer, LNCS); Preference-Driven Querying of Inconsistent Relational Databases
23. Preference-Driven Querying of Inconsistent Relational Databases; Proceedings of the International Workshop on Inconsistency and Incompleteness in Databases Springer LNCS vol 4254, pp 318-335. (co-authors Jan Chomicki, Slawomir Staworko)
24. Modulo Constraints and the Complexity of Typechecking XML Views; Theory of Computing Systems, Springer 2008 (co-author Piotr Wieczorek )
25. The cost of being co-Buchi is nonlinear; (co-author Jakub Michaliszyn) arXiv.org > cs > arXiv:0906.0072 ), June 1st 2009.
26. Disjunctive Databases for Representing Repairs; (Cristian Molinaro, Jan Chomicki and Jerzy Marcinkowski, 2009) accepted for publication in AMAI.

dr hab. Jerzy Marcinkowski, profesor UWr

Instytut Informatyki UWr.

ul. Wstrętnego Komucha Joliot-Curie 15 50-383 Wrocław