BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Czech Republic
1 × Denmark
1 × France
1 × Hungary
1 × Italy
1 × Japan
2 × Spain
2 × United Kingdom
5 × USA
Collaborated with:
∅ T.Gogacz J.Michaliszyn T.Truderung D.Kirsten E.Kieronski J.Chomicki S.Staworko A.Arnold G.Lenzi
Talks about:
undecid (8) logic (3) halpern (2) theori (2) shoham (2) ground (2) queri (2) claus (2) chase (2) horn (2)

Person: Jerzy Marcinkowski

DBLP DBLP: Marcinkowski:Jerzy

Facilitated 1 volumes:

CSL 2004Ed

Contributed to:

LICS 20152015
ICALP (2) 20142014
LICS 20132013
PODS 20132013
LICS 20112011
ICALP (2) 20102010
CSL 20062006
CIKM 20042004
CSL 20022002
LICS 20012001
CSL 19991999
ICALP 19991999
RTA 19991999
RTA 19971997
LICS 19961996
CSL 19931993

Wrote 16 papers:

LICS-2015-GogaczM #decidability #query
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable (TG, JM), pp. 281–292.
ICALP-v2-2014-GogaczM #decidability #termination
All-Instances Termination of Chase is Undecidable (TG, JM), pp. 293–304.
LICS-2013-GogaczM #convergence #finite
Converging to the Chase — A Tool for Finite Controllability (TG, JM), pp. 540–549.
PODS-2013-GogaczM #on the
On the BDD/FC conjecture (TG, JM), pp. 127–138.
LICS-2011-MarcinkowskiM #logic
The Ultimate Undecidability Result for the Halpern-Shoham Logic (JM, JM), pp. 377–386.
ICALP-v2-2010-MarcinkowskiMK #decidability #logic
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable (JM, JM, EK), pp. 357–368.
CSL-2006-Marcinkowski #graph #logic #on the #power of
On the Expressive Power of Graph Logic (JM), pp. 486–500.
CIKM-2004-ChomickiMS #consistency #query #using
Computing consistent query answers using conflict hypergraphs (JC, JM, SS), pp. 417–426.
CSL-2002-MarcinkowskiT #bound #complexity #game studies #ltl
Optimal Complexity Bounds for Positive LTL Games (JM, TT), pp. 262–275.
LICS-2001-ArnoldLM #infinity #monad
The Hierarchy inside Closed Monadic Σ₁ Collapses on the Infinite Binary Tree (AA, GL, JM), pp. 157–166.
CSL-1999-Marcinkowski #game studies #reachability
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games (JM), pp. 338–349.
ICALP-1999-KirstenM #problem
Two Techniques in the Area of the Star Problem (DK, JM), pp. 483–492.
RTA-1999-Marcinkowski #algebra #formal method
Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol (JM), pp. 92–102.
RTA-1997-Marcinkowski #first-order
Undecidability of the First Order Theory of One-Step Right Ground Rewriting (JM), pp. 241–253.
LICS-1996-Marcinkowski #bound #datalog #decidability
DATALOG SIRUPs Uniform Boundedness is Undecidable (JM), pp. 13–24.
CSL-1993-Marcinkowski #decidability #horn clause #set
A Horn Clause that Implies and Undecidable Set of Horn Clauses (JM), pp. 223–237.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.