Thomas Schwentick - Selected Publications#

Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4): 27 (2011)

Thomas Schwentick, Thomas Zeume: Two-Variable Logic with Two Order Relations. Logical Methods in Computer Science 8(1) (2012)

Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data trees and XML reasoning. J. ACM 56(3) (2009)

Georg Gottlob, Thomas Schwentick: Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. KR 2012
Wouter Gelade, Marcel Marquardt, Thomas Schwentick: The dynamic complexity of formal languages. ACM Trans. Comput. Log. 13(3) (2012)

Geert Jan Bex, Frank Neven, Thomas Schwentick, Stijn Vansummeren: Inference of concise regular expressions and DTDs. ACM Trans. Database Syst. 35(2) (2010)

Georg Gottlob, Zoltán Miklós, Thomas Schwentick: Generalized hypertree decompositions: NP-hardness and tractable variants. J. ACM 56(6) (2009)

Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex: Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3): 770-813 (2006)

Frank Neven, Thomas Schwentick: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science 2(3) (2006)

Martin Grohe, Thomas Schwentick: Locality of order-invariant first-order formulas. ACM Trans. Comput. Log. 1(1): (2000)

Thomas Schwentick: On Winning Ehrenfeucht Games and Monadic NP. Ann. Pure Appl. Logic 79(1): 61-92 (1996)