Jerzy Marcinkowski

	2012
34		Slawek Staworko, Jan Chomicki, Jerzy Marcinkowski: Prioritized repairing and consistent query answering in relational databases. Ann. Math. Artif. Intell. 64(2-3): 209-246 (2012)
	2011
33		Jerzy Marcinkowski, Jakub Michaliszyn: The Ultimate Undecidability Result for the Halpern-Shoham Logic. LICS 2011: 377-386
	2010
32		Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski: B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. ICALP (2) 2010: 357-368
31		Jerzy Marcinkowski, Jakub Michaliszyn: The Last Paper on the Halpern-Shoham Interval Temporal Logic CoRR abs/1010.4529: (2010)
	2009
30		Cristian Molinaro, Jan Chomicki, Jerzy Marcinkowski: Disjunctive databases for representing repairs. Ann. Math. Artif. Intell. 57(2): 103-124 (2009)
29		Jerzy Marcinkowski, Jakub Michaliszyn: The cost of being co-Buchi is nonlinear CoRR abs/0906.0072: (2009)
28		Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowski: Prioritized Repairing and Consistent Query Answering in Relational Databases CoRR abs/0908.0464: (2009)
27		Jerzy Marcinkowski, Piotr Wieczorek: Modulo Constraints and the Complexity of Typechecking XML Views. Theory Comput. Syst. 44(4): 620-652 (2009)
	2008
26		Cristian Molinaro, Jan Chomicki, Jerzy Marcinkowski: Disjunctive Databases for Representing Repairs CoRR abs/0811.2117: (2008)
	2006
25		Jerzy Marcinkowski: On the Expressive Power of Graph Logic. CSL 2006: 486-500
24		Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowski: Preference-Driven Querying of Inconsistent Relational Databases. EDBT Workshops 2006: 318-335
	2005
23		Jan Chomicki, Jerzy Marcinkowski: On the Computational Complexity of Minimal-Change Integrity Maintenance in Relational Databases. Inconsistency Tolerance 2005: 119-150
22		Jan Chomicki, Jerzy Marcinkowski: Minimal-change integrity maintenance using tuple deletions. Inf. Comput. 197(1-2): 90-121 (2005)
	2004
21		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
20		Jan Chomicki, Jerzy Marcinkowski, Slawomir Staworko: Computing consistent query answers using conflict hypergraphs. CIKM 2004: 417-426
19		Jan Chomicki, Jerzy Marcinkowski, Slawomir Staworko: Hippo: A System for Computing Consistent Answers to a Class of SQL Queries. EDBT 2004: 841-844
18		Jerzy Marcinkowski, Jan Otop, Grzegorz Stelmaszek: On a Semantic Subsumption Test. LPAR 2004: 142-153
	2003
17		Jerzy Marcinkowski, Leszek Pacholski: Thue trees. Ann. Pure Appl. Logic 119(1-3): 19-59 (2003)
16		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)
	2002
15		Jerzy Marcinkowski, Tomasz Truderung: Optimal Complexity Bounds for Positive LTL Games. CSL 2002: 262-275
14		Jan Chomicki, Jerzy Marcinkowski: On the Computational Complexity of Consistent Query Answers CoRR cs.DB/0204010: (2002)
13		Jan Chomicki, Jerzy Marcinkowski: Minimal-Change Integrity Maintenance Using Tuple Deletions CoRR cs.DB/0212004: (2002)
12		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)
	2001
11		André Arnold, Giacomo Lenzi, Jerzy Marcinkowski: The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree. LICS 2001: 157-166
10		David Janin, Jerzy Marcinkowski: A Toolkit for First Order Extensions of Monadic Games. STACS 2001: 353-364
	1999
9		Jerzy Marcinkowski: Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. CSL 1999: 338-349
8		Daniel Kirsten, Jerzy Marcinkowski: Two Techniques in the Area of the Star Problem. ICALP 1999: 483-492
7		Jerzy Marcinkowski: Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol. RTA 1999: 92-102
6		Jerzy Marcinkowski: Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs. SIAM J. Comput. 29(1): 231-257 (1999)
	1997
5		Jerzy Marcinkowski: Undecidability of the First Order Theory of One-Step Right Ground Rewriting. RTA 1997: 241-253
	1996
4		Jerzy Marcinkowski: DATALOG SIRUPs Uniform Boundedness is Undecidable. LICS 1996: 13-24
3		Jerzy Marcinkowski: The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs. STACS 1996: 427-438
	1993
2		Jerzy Marcinkowski: A Horn Clause that Implies and Undecidable Set of Horn Clauses. CSL 1993: 223-237
	1992
1		Jerzy Marcinkowski, Leszek Pacholski: Undecidability of the Horn-Clause Implication Problem FOCS 1992: 354-362

Coauthor Index

1	André Arnold	[11]
2	Jan Chomicki	[13] [14] [19] [20] [22] [23] [24] [26] [28] [30] [34]
3	David Janin	[10]
4	Emanuel Kieronski	[32]
5	Daniel Kirsten	[8] [16]
6	Giacomo Lenzi	[11]
7	Jakub Michaliszyn	[29] [31] [32] [33]
8	Cristian Molinaro	[26] [30]
9	Jan Otop	[18]
10	Leszek Pacholski	[1] [17]
11	Slawomir Staworko (Slawek Staworko)	[19] [20] [24] [28] [34]
12	Grzegorz Stelmaszek	[18]
13	Andrzej Tarlecki	[21]
14	Tomasz Truderung	[15]
15	Piotr Wieczorek	[27]

Colors in the list of coauthors

Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page