Some recent papers

A complete list of publications with all bibliographical details can be found here. See also Google scholar and DBLP.

databases

Vince Barany, Balder ten Cate and Martin Otto (2012). Queries with Guarded Negation. Proceedings of VLDB 2012.

Balder ten Cate, Gaëlle Fontaine and Phokion Kolaitis (2012). On the Data Complexity of Consistent Query Answering. Proceedings of ICDT 2012.

Balder ten Cate, Victor Dalmau and Phokion Kolaitis (2012). Learning Schema Mappings. Proceedings of ICDT 2012.

Bogdan Alexe, Balder ten Cate, Phokion Kolaitis and Wang-Chiew Tan (2011). Characterizing Schema Mappings via Data Examples. ACM Transactions on Database Systems 36(4): 23.

Bogdan Alexe, Balder ten Cate, Phokion Kolaitis and Wang-Chiew Tan (2011). EIRENE: Interactive design and refinement of schema mappings via data examples . VLDB 2011 (Demonstration track).

Bogdan Alexe, Balder ten Cate, Phokion Kolaitis and Wang-Chiew Tan (2011). Designing and Refining Schema Mappings via Data Examples. SIGMOD 2011.

Balder ten Cate and Phokion Kolaitis (2010). Structural characterizations of schema-mapping languages. Communications of the ACM 53(1): 101-110 (Research Highlights column). DOI

Balder ten Cate and Phokion Kolaitis (2009). Structural characterizations of schema-mapping languages. ICDT 2009.
PDF

xml

Serge Abiteboul, Balder ten Cate and Yannis Katsis (2011). On the equivalence of distributed systems with queries and communication. ICDT 2011.

Balder ten Cate and Luc Segoufin (2010). Transitive closure logic, nested tree walking automata, and XPath. Journal of the ACM 57(3):18. Extended abstract appeared in PODS 2008.
PDF of conference version

Balder ten Cate, Tadeusz Litak and Maarten Marx (2010). Complete axiomatizations of XPath fragments. Journal of Applied Logic 8(2):153-172. Extended abstract presented at LID 2007. DOI

Balder ten Cate and Maarten Marx (2009). Axiomatizing the logical core of XPath 2.0. Theory of Computing Systems 44(4): 561-589. Extended abstract appeared in ICDT 2007. PDF

Balder ten Cate and Carsten Lutz (2009). The Complexity of Query Containment in Expressive Fragments of XPath 2.0. Journal of the ACM 56(6): 1-48. Extended abstract appeared in PODS 2007. DOI

logic

Balder ten Cate and Alessandro Facchini (2011). Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs. MFCS 2011. PDF

Vince Bárány, Balder ten Cate and Luc Segoufin (2011). Guarded negation. ICALP 2011. PDF

Balder ten Cate, Enrico Franconi and İnanç Seylan (2011). Beth definability in expressive description logics. IJCAI 2011. PDF

Balder ten Cate and Luc Segoufin (2011). Unary negation. STACS 2011.
PDF

Balder ten Cate and Gaëlle Fontaine (2010). An easy completeness proof for the modal mu-calculus on finite trees. FOSSACS 2010. PDF

Amélie Gheerbrant and Balder ten Cate (2009). Interpolation for linear temporal languages. CSL 2009.
PDF

Johan van Benthem, Balder ten Cate and Jouko Väänänen (2009). Lindström theorems for fragments of first-order logic. Logical Methods for Computer Science 5(3):3. Extended abstract appeared in LICS 2007. DOI

Balder ten Cate (2009). A note on the expressibility problem for modal logics and star-free regular expressions. Information Processing Letters 109: 509-513. DOI

Amélie Gheerbrant and Balder ten Cate (2009). Complete axiomatizations of MSO, FO(TC1) and FO(LFP1) on finite trees. Logical Foundations of Computer Science (LFCS 2009). DOI

Balder ten Cate, David Gabelaia and Dmitry Sustretov (2009). Modal languages for topology: expressivity and definability. Annals of Pure and Applied Logic 159(1-2):146-170. PDF.