| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Klaus U. Schulz Felix Weigel , Klaus U. Schulz, Holger Meuss : Node Identification Schemes for Efficient XML Retrieval. Foundations of Semistructured Data 2005 Stoyan Mihov , Klaus U. Schulz, Christoph Ringlstetter , Veselka Dojchinova , Vanja Nakova : A Corpus for Comparative Evaluation of OCR Software and Postcorrection Techniques. ICDAR 2005 : 162-166 Christoph Ringlstetter , Klaus U. Schulz, Stoyan Mihov , Katerina Louka : The Same is Not The same - Post Correction of Alphabet Confusion Errors in Mixed-Alphabet OCR Recognation. ICDAR 2005 : 406-410 Felix Weigel , Klaus U. Schulz, Holger Meuss : Exploiting native XML indexing techniques for XML retrieval in relational database systems. WIDM 2005 : 23-30 Felix Weigel , Klaus U. Schulz, Holger Meuss : The BIRD Numbering Scheme for XML and Tree Databases - Deciding and Reconstructing Tree Relations Using Efficient Arithmetic Operations. XSym 2005 : 49-67 Holger Meuss , Klaus U. Schulz, Felix Weigel , Simone Leonardi , François Bry : Visual exploration and retrieval of XML document collections with the generic system X 2 . Int. J. on Digital Libraries 5 (1): 3-17 (2005) Manfred Schmidt-Schauß , Klaus U. Schulz: Decidability of bounded higher-order unification. J. Symb. Comput. 40 (2): 905-954 (2005) Felix Weigel , Holger Meuss , François Bry , Klaus U. Schulz: Content-Aware DataGuides: Interleaving IR and DB Indexing Techniques for Efficient Retrieval of Textual XML Data. ECIR 2004 : 378-393 Felix Weigel , Klaus U. Schulz, Holger Meuss : Ranked Retrieval of Structured Documents with the S-Term Vector Space Model. INEX 2004 : 238-252 Georg Gottlob , Christoph Koch , Klaus U. Schulz: Conjunctive Queries over Trees. PODS 2004 : 189-200 Felix Weigel , Holger Meuss , Klaus U. Schulz, François Bry : Content and Structure in Indexing and Ranking XML. WebDB 2004 : 67-72 Christian M. Strohmaier , Christoph Ringlstetter , Klaus U. Schulz, Stoyan Mihov : Lexical Postcorrection of OCR-Results: The Web as a Dynamic Secondary Dictionary? ICDAR 2003 : 1133-1137 Holger Meuss , Klaus U. Schulz, François Bry : Visual Querying and Exploration of Large Answers in XML Databases with X2. ICDE 2003 : 777-779 Klaus U. Schulz, Felix Weigel : Systematics and Architecture for a Resource Representing Knowledge about Named Entities. PPSWR 2003 : 189-207 Manfred Schmidt-Schauß , Klaus U. Schulz: Decidability of Bounded Higher-Order Unification. CSL 2002 : 522-536 Klaus U. Schulz, Stoyan Mihov : Fast string correction with Levenshtein automata. IJDAR 5 (1): 67-85 (2002) Manfred Schmidt-Schauß , Klaus U. Schulz: Solvability of Context Equations with Two Context Variables is Decidable. J. Symb. Comput. 33 (1): 77-122 (2002) Holger Meuss , Klaus U. Schulz, François Bry : Towards Aggregated Answers for Semistructured Data. ICDT 2001 : 346-360 Holger Meuss , Klaus U. Schulz: Complete answer aggregates for treelike databases: a novel approach to combine querying and navigation. ACM Trans. Inf. Syst. 19 (2): 161-215 (2001) Klaus U. Schulz, Stephan Kepser : Combination of constraint systems II: Rational amalgamation. Theor. Comput. Sci. 266 (1-2): 113-157 (2001) Klaus U. Schulz: Why Combined Decision Problems Are Often Intractable. FroCos 2000 : 217-244 Klaus U. Schulz: Tractable and intractable instances of combination problems for unification and disunification. J. Log. Comput. 10 (1): 105-135 (2000) Manfred Schmidt-Schauß , Klaus U. Schulz: Solvability of Context Equations with Two Context Variables is Decidable. CADE 1999 : 67-81 Franz Baader , Klaus U. Schulz: Combining Constraint Solving. CCL 1999 : 104-158 Rolf Backofen , François Bry , Peter Clote , Hans-Peter Kriegel , Thomas Seidl , Klaus U. Schulz: Bioinformatik - Aktuelles Schlagwort. Informatik Spektrum 22 (5): 376-378 (1999) Manfred Schmidt-Schauß , Klaus U. Schulz: On the Exponent of Periodicity of Minimal Solutions of Context Equation. RTA 1998 : 61-75 Franz Baader , Klaus U. Schulz: Combination of Constraint Solvers for Free and Quasi-Free Structures. Theor. Comput. Sci. 192 (1): 107-161 (1998) Klaus U. Schulz: A Criterion for Intractability of E-unification with Free Function Symbols and Its Relevance for Combination Algorithms. RTA 1997 : 284-298 Stephan Kepser , Klaus U. Schulz: Combination of Constraint Systems II: Rational Amalgamation. CP 1996 : 282-296 Franz Baader , Klaus U. Schulz: Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. J. Symb. Comput. 21 (2): 211-243 (1996) Franz Baader , Klaus U. Schulz: On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers. CP 1995 : 380-397 Franz Baader , Klaus U. Schulz: Combination of Constraint Solving Techniques: An Algebraic POint of View. RTA 1995 : 352-366 Franz Baader , Klaus U. Schulz: Combination Techniques and Decision Problems for Disunification. Theor. Comput. Sci. 142 (2): 229-255 (1995) Klaus U. Schulz: On Existential Theories of List Concatenation. CSL 1994 : 294-308 Franz Baader , Klaus U. Schulz: Combination Techniques and Decision Problems for Disunification. RTA 1993 : 301-315 Klaus U. Schulz: Wort Unification and Transformation of Generalized Equations. J. Autom. Reasoning 11 (2): 149-184 (1993) Klaus U. Schulz: Word Equations and Related Topics, First International Workshop, IWWERT '90, Tübingen, Germany, October 1-3, 1990, Proceedings Springer 1992 Franz Baader , Klaus U. Schulz: Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. CADE 1992 : 50-65 Franz Baader , Klaus U. Schulz: General A- and AX-Unification via Optimized. IWWERT 1991 : 23-42 Klaus U. Schulz: Makanin's Algorithm for Word Equations - Two Improvements and a Generalization. IWWERT 1990 : 85-150 Klaus U. Schulz: Preferential cumulative reasoning and nonmonotonic semantic nets. The Logic of Theory Change 1989 : 223-240 1 [ 3 ] [ 4 ] [ 7 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 15 ] [ 18 ] 2 [ 17 ] 3 [ 17 ] [ 24 ] [ 29 ] [ 31 ] [ 34 ] [ 36 ] 4 [ 17 ] 5 [ 40 ] 6 [ 32 ] 7 [ 13 ] [ 22 ] 8 [ 32 ] 9 [ 17 ] 10 [ 36 ] 11 [ 39 ] 12 [ 23 ] [ 24 ] [ 29 ] [ 31 ] [ 33 ] [ 34 ] [ 36 ] [ 37 ] [ 38 ] [ 41 ] 13 [ 26 ] [ 30 ] [ 39 ] [ 40 ] 14 [ 40 ] 15 [ 30 ] [ 39 ] [ 40 ] 16 [ 16 ] [ 19 ] [ 25 ] [ 27 ] [ 35 ] 17 [ 17 ] 18 [ 30 ] 19 [ 28 ] [ 31 ] [ 33 ] [ 34 ] [ 36 ] [ 37 ] [ 38 ] [ 41 ]  ©2006 Association for Computing Machinery |
