Sie sind hier: Technische Universität Dortmund > Fakultät für Informatik > Lehrstuhl Informatik 1 - Logik in der Informatik
Publikationen/Publications

Two-variable logic on data trees and XML reasoning

by Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin

In: Journal of the ACM (JACM), Volume 56, Issue 3 (May 2009), Article No. 13, ISSN: 0004-5411

 

 

The Dynamic Complexity of Formal Languages

by Gelade, Wouter; Marquardt, Marcel; Schwentick, Thomas

In: 26th International Symposium on the Theoretical Aspects of Computer Science (STACS 2009)

 

 

Optimizing Conjunctive Queries over Trees Using Schema Information

by Björklund, H., Martens, W., and Schwentick, T.

To appear in: International Symposium on Mathematical Foundations of Computer Science (MFCS 2008).

Conjunctive query optimization over trees

by Björklund, H., Martens, M., and Schwentick, T.

In: International Symposium on Database Programming Languages (DBPL'07), LNCS 4797, pp. 66-80, Springer 2007.

On notions of regularity for data languages

by Björklund, H., and Schwentick, T.

In: Proc. International Symposium on Fundamentals of Computation Theory (FCT'07), LNCS 4639, pp. 88-99, Springer, 2007.

Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants.

by Gottlob, G., Miklos, Z., and Schwentick, T.

PODS 2007, 13-22.

The Complexity of Reasoning about Pattern-based XML Schemas.

by Kasneci, G., and Schwentick, T.

PODS 2007: 155-164.

Bounded-Variable Fragments of Hybrid Logics.

by Schwentick, T., and Weber, V.

In: Proceedings of 24th STACS, Aachen. Vol. 4393 of LNCS, pages 561-572, Springer, 2007.

Dynamic Complexity Theory Revisited.

by Weber, V., and Schwentick, T.

In: Theory of Computing Systems, 40(4):355-377, 2007.

Automata for XML -- A survey.

by Schwentick, T.

J. Comput. Syst. Sci. 73(3): 289-315, doi:10.1016/j.jcss.2006.10.003.

Inference of Concise DTDs from XML Data.

by Bex, G. J., Neven, F., Schwentick, T., and Tuyls. K.

VLDB 2006, 115-126.

Expressive power of pebble automata.

by Bojanczyk, M., Samuelides, M., Schwentick, T., and Segoufin, L.

ICALP (1) 2006: 157-168.

Two-variable logic on words with data.

by Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., and Segoufin, L.

LICS 2006: 7-16.

Two-variable logic on data trees and XML reasoning.

by Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., and Segoufin, L.

PODS 2006: 10-19.

The many faces of a translation.

by McKenzie, P., Schwentick, T., Thérien, D., and Vollmer. H.

In: J. Comput. Syst. Sci. 72(1): 163-179 (2006).

Active Context-Free Games.

by Muscholl, A., Schwentick, T. , and Segoufin. L.

In: Theory Comput. Syst. 39(1): 237-276.

On the complexity of XPath containment in the presence of disjunction, DTDs, and variables.

by Neven, F., and Schwentick, T.

Logical Methods in Computer Science 2(3): (2006).

Expressiveness and Complexity of XML Schema.

by Martens, W., Neven, F., Schwentick, T., and Bex, G. J.

Combined full version of ICDT 2005 and WWW 2005 papers. ACM Transactions on Database Systems (ACM TODS), 31(3), pp. 770-813, 2006.

Complexity of Decision Problems for XML Schemas and Simple Regular Expressions (Preliminary Version).

by Martens, W., Neven, F., and Schwentick, T.

Journal version, contains the material that was presented in MFCS 2004. In Progress.

Joomla SEF URLs by Artio