Publications by Stephan Kepser
Publications by Stephan Kepser |
|
Stephan Kepser. On the Complexity of RSRL. To appear in Journal of Language and Computation, Geert-Jan Kruijf, Larry Moss, and Richard Oehrle (eds.), in press.
Stephan Kepser and James Rogers.
The Equivalence of Tree Adjoining Grammars and
Monadic Linear Context-free Tree Grammars. In
Journal of Logic, Language, and Information,
Gerald Penn (ed.), in press.
Preprint
Stephan Kepser.
On Monadic Second-Order Theories of Multidominance Structures.
In
The Mathematics of Language,
Christian Ebert, Gerhard Jäger, and Jens Michaelis (eds.),
pp. 117-128.
LNCS 6149, Springer 2010.
Paper
Stephan Kepser, Uwe Mönnich, and Frank Morawietz.
Regular Query Techniques for XML-Documents.
In Linguistic modeling of information and Markup Languages,
Dieter Metzing and Andreas Witt (eds), pp. 249-266.
Springer 2010.
Book
Contents
Stephan Kepser and James Rogers.
The Equivalence of Tree Adjoining Grammars and
Monadic Linear Context-free Tree Grammars. In
The Mathematics of Language,
Christian Ebert, Gerhard Jäger, and Jens Michaelis (eds.),
pp. 129-144.
LNCS 6149, Springer 2010.
Paper
Hans-Jörg Tiede and Stephan Kepser.
Monadic Second-Order Logic and Transitive Closure Logics over Trees.
In Research on Language and Computation, 7(1): 41-54.
Paper
(draft)
Stephan Kepser.
On Monadic Second-Order Theories over Multidominance Structures. In
The 11th Meeting on Mathematics of Language 11, Christian Ebert, Gerhard Jäger,Marcus
Kracht, and Jens Michaelis (eds.), pp. 57-64, 2009.
Paper
Hendrik Maryns and Stephan Kepser.
MonaSearch - A Tool for Querying Linguistic Treebanks.
In Treebanks and Linguistic Theories 2009,
Frank Van Eynde, Anette Frank, Koenraad De Smedt (eds),
pp. 29-40, 2009
Paper
Firtz Hamm and Stephan Kepser (eds.).
Logics for Linguistic Structures.
Trends in Linguistics 201, Mouton de Gruyter.
Book
Stephan Kepser.
A Landscape of Logics for Finite Unordered Unranked
Trees. In
Formal Grammar 2008, Philippe de Groote, Laura Kallmeyer,
Gerald Penn, and Giorgio Satta (eds.), 2008.
Paper
Gerhard Jäger and Stephan Kepser.
Automata, Complexity, and Optimality Theory. In
Cognitive Foundations of Interpretation,
Gerlof Bouma, Irene Krämer, Joost Zwarts
(eds.), pp. 95-110, 2007.
Book
Stephan Kepser and Jim Rogers.
The Equivalence of Tree Adjoining Grammars and Monadic
Linear Context-free Tree Grammars.
In Mathematics of Language 10,
Marcus Kracht, Gerald Penn, and Ed Stabler (eds.), 2007.
Extended abstract
Jim Rogers and Stephan Kepser (eds.).
Model Theoretic Syntax at 10. Proceedings, workshop at ESSLLI
2007.
Proceedings
Stephan Kepser.
Properties of Binary Transitive Closure Logic over Trees.
In Formal Grammar 2006, Paola Monachesi, Gerald Penn, Giorgio
Satta, and Shuly Wintner (eds.), pp. 77-89, 2006.
Paper
Postproceedings version (with stronger results)
Stephan Kepser and Uwe Mönnich.
Closure Properties of Linear Context-Free Tree Languages with an
Application to Optimality Theory.
In Theoretical Computer Science, 354(1), 82-97, 2006.
Paper
Corrigendum: Corollary 5 is true only if the CFTG is linear and
non-deleting.
Hans-Jörg Tiede and Stephan Kepser.
Monadic Second-Order Logic and Transitive
Closure Logics over Trees .
In 13th Workshop on Logic, Language, Information and
Computation,
Grigori Mints (ed.),
Electronic Notes in Theoretical Computer Science, Volume 165, pages 189-199,
2006.
Paper
Stephan Kepser.
Using MONA for Querying Linguistic Treebanks.
In Proceedings HLT/EMNLP 2005, Chris Brew, Lee-Feng Chien,
Katrin Kirchhoff (eds.), pp. 555-563, 2005.
Paper
Stephan Kepser and Marga Reis (eds).
Linguistic Evidence - Empirical, Theoretical, and Computational
Perspectives. Mouton de Gruyter, 2005
Book
Stefanie Herrman, Hartmut Keck, and Stephan Kepser.
A Multi-Modal Documentation System for Warao.
In Proceedings LREC 2004, Maria Teresa Lino et al. (eds.),
vol. IV, pp. 1377-1380, 2004.
Paper
Stephan Kepser.
Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear
Time. In Journal of Logic, Language, and Information,
13: 457-470, 2004.
Paper
Stephan Kepser. Bidirectional Optimality for Regular Tree Languages. In Formal Grammar 2004, Gerhard Jäger, Paola Monachesi, Gerald Penn and Shuly Wintner (eds.), pp. 63-76, 2004.
Stephan Kepser.
A Simple Proof of the Turing-Completeness of XSLT and XQuery.
In Extreme Markup Languages 2004,
Tommie Usdin (ed.), 2004.
Paper
Stephan Kepser.
On the Complexity of RSRL.
In Proceedings FG-MOL 2001, Larry Moss and
Richard Oehrle (eds.). Electronic Notes in Theoretical Computer
Science 53, pp. 146-162, 2004.
Paper
Revised version submitted to Language and
Computation.
Stephan Kepser and Marga Reis (eds.). Linguistic Evidence - Empirical, Theoretical, and Computational Perspectives. Preproceedings, 2004.
Stephan Kepser, Ilona Steiner, and Wolfgang Sternefeld.
Annotating and Querying a Treebank of Suboptimal Structures.
In Treebanks and Linguistic Theories 2004, Sandra Kübler and
Joakim Nivre (eds.), pp. 63-74, 2004.
Paper
Stephan Kepser.
Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear
Time. In Proceedings Mathematics of Language (MoL8),
Dick Oehrle and Jim Rogers (eds.), pp. 93 - 104, 2003.
Paper
Stephan Kepser.
Finite Structure Query - A Tool for Querying Syntactically
Annotated Corpora.
In EACL 2003, Ann Copestake and Jan Hajic (eds.),
pp. 179-186, 2003.
Paper
Stephan Kepser and Uwe Mönnich.
Graph Properties of HPSG Feature Structures.
In Formal Grammar 2003, Gerhard Jäger, Paola Monachesi, Gerald Penn,
and Shuly Wintner (eds.), pp. 115 - 124, 2003.
Paper
Stephan Kepser and Uwe Mönnich.
(Un-)Decidability Results for Head-Driven Phrase Structure Grammar.
In Proceedings Algebraic Methods in Language Processing (AMiLP-3),
Giuseppe Scollo and Anton Nijholt (eds.), pp. 141-152, 2003.
Paper
Stephan Kepser and Uwe Mönnich.
A Note on the Complexity of Optimality Theory.
In Proceedings Algebraic Methods in Language Processing (AMiLP-3),
Giuseppe Scollo and Anton Nijholt (eds.), pp. 153-166, 2003.
Paper
Stephan Kepser, Uwe Mönnich, and Frank Morawietz.
Model Checking Secondary Relations.
In Formal Grammar 2002, Gerhard Jäger, Paola Monachesi, Gerald Penn,
and Shuly Wintner (eds.), pp. 65 - 75, 2002.
Paper
Klaus U. Schulz and Stephan Kepser.
Combination of Constraint Solvers II: Rational Amalgamation.
In Theoretical Computer Science, 266/1-2, pp. 113-157, 2001.
Abstract
Paper
Uwe Mönnich, Frank Morawietz and Stephan Kepser.
A Regular Query for Context-Sensitive Relations.
In IRCS Workshop Linguistic Databases 2001,
Steven Bird, Peter Buneman, Mark Liberman (eds.), pp. 187-195, 2001.
Abstract
Paper
Stephan Kepser.
A Coalgebraic Modelling of Head-Driven Phrase Structure
Grammar.
In Proceedings AMiLP2000, D. Heylen, A. Nijholt, G. Scollo
(eds.), pp. 81-95, 2000.
Abstract
Paper
Stephan Kepser and Jörn Richts.
UniMoK: A System for Combining Equational Unification
Algorithms.
In Proceedings of Rewriting Techniques and Applications 1999,
M. Rusinovitch and P. Narendran (eds.), pp. 248-251, Springer LNCS
1631, 1999.
Paper
Franz Baader, Klaus U. Schulz, Jörn Richts, and Stephan Kepser.
Abschlussbericht an die DFG. Final project report, 1998.
Paper (available only in German.)
Stephan Kepser.
Negation in Combining Constraint Systems.
In Frontiers of Combining Systems 2, Papers presented at FroCoS'98.
Maarten de Rijke and Dov Gabbay (eds.), Research Studies Press/Wiley,
pp. 177-192, 1999.
Abstract
Paper
Stephan Kepser and Jörn Richts.
Optimisation Techniques for Combining Constraint Solvers.
In Frontiers of Combining Systems 2, Papers presented at FroCoS'98.
Maarten de Rijke and Dov Gabbay (eds.), Research Studies Press/Wiley,
pp. 193-210, 1999.
Abstract
Paper
Stephan Kepser.
Combination of Constraint Systems.
Ph.D. dissertation at CIS. CIS Report 98-118, 1998.
English Abstract
deutsche Zusammenfassung
full Thesis (580 Kb PS file)
Stephan Kepser and Klaus U. Schulz.
Combination of Constraint Solvers II: Rational Amalgamation. in
Proceedings of the second International Conference on Constraint
Programming, CP-96, pp. 282-296, Springer LNCS 1118, 1996.
Abstract
Long Version
Klaus U. Schulz and Stephan Kepser.
Unif'96 Extended Abstracts of the Tenth International Workshop
on Unification. CIS Report 96-91, 1996.
Abstract
Full Report
Stephan Kepser.
A Satisfiability Algorithm for a Typed Feature Logic.
m.a. thesis. Arbeitsberichte des SFB 340, Nr. 60; 1994.
Paper
A Regular Query for Context-Sensitive Relations Workshop "Linguistic Databases", LDC, Philadelphia, USA; 11-13 December 2001.
Ein Beweis zur Turing-Vollständigkeit von XSLT Workshop "Semistructured Data", Herrsching, Germany; 21-22 February 2002.
Linguistische Datenbanken Workshop "Semistructured Data", Herrsching, Germany; 21-22 February 2002.
Model Checking Secondary Relations Formal Grammar 2002, Trento, Italia, 3.-4. August 2002.
Unpublished and potentially unfinished technical reports. Comments are wellcome.
Stephan Kepser.
A Landscape of
Logics for Finite Unordered Unranked Trees.
Technical report, CRC 441. 16th April 2008.
Stephan Kepser.
A Coalgebraic Modelling of Head-Driven
Phrase Structure Grammar.
Technical report, CRC 441. Current version dates 15.6.2000.