Index Browse   Bibliographies My selection

Search: in All Authors Titles Conferences Journals Keywords Comments   (word length ≥ 3)       Login

References of Joachim Niehren   Order by:   Type | Year

<< 2004 >>

1 Ruth Fuchss, Alexander Koller, Joachim Niehren and Stefan Thater. Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis. In Proceedings of the 42nd ACL, Barcelona, 2004.     google

<< 2003 >>

2 Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren and Sven Thiel. An Efficient Graph Algorithm for Dominance Constraints. In Journal of Algorithms, Vol. 48:194--219, 2003. [Abstract]     google [Annote] 3 Katrin Erk, Alexander Koller and Joachim Niehren. Processing Underspecified Semantic Descriptions in the Constraint Language for Lambda Structures. In Research on Language and Computation, Vol. 1:127--169, 2003. [Abstract]     google [Annote] 4 Katrin Erk and Joachim Niehren. Well-Nested Parallelism Constraints for Ellipsis Resolution. In Proceedings of EACL'03, Budapest, 2003.     google 5 Alexander Koller, Joachim Niehren and Stefan Thater. Bridging the Gap between Underspecification Formalisms: Hole Semantics as Dominance Constraints. In Proceedings of the 10th Conference of The European Chapter of the Association for Computational Linguistics, Pages 195--202, Budapest, Hungary, 2003.     google 6 Joachim Niehren and Stefan Thater. Bridging the Gap between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, Pages 367--374, Sapporo, Japan, 2003.     google 7 Ruth Fuchss, Joachim Niehren and Stefan Thater. Minimal Recursion Semantics as Dominance Constraints: A Preliminary Evaluation. In Prospects and Advances in the Syntax/Semantics Interface, Pages 51--55, Nancy, France, 2003.     google

<< 2002 >>

8 Alexander Koller and Joachim Niehren. Constraint Programming in Computational Linguistics. In Dave Barker-Plummer, David I. Beaver, Johan van Benthem and Patrick Scotto di Luzio editors, Words, Proofs, and Diagrams, CSLI Press, Stanford, 2002. [Abstract]     google Note: Extended version of a paper at the 8th Stanford Workshop on Logic, Language, and Computation (1999). [Annote]

<< 2001 >>

9 Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren and Sven Thiel. An Efficient Algorithm for the Configuration Problem of Dominance Graphs. In 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 7-9, ACM Press, Washington D.C., USA, 2001. [Abstract]     google [Annote] 10 Manuel Bodirsky, Katrin Erk, Alexander Koller and Joachim Niehren. Beta Reduction Constraints. In Aart Middeldorp editor, 12th International Conference on Rewriting Techniques and Applications (RTA'01), May 22-24, Pages 31-46, Springer-Verlag, Utrecht, The Netherlands, 2001. [Abstract]     google [Annote] 11 Manuel Bodirsky, Katrin Erk, Alexander Koller and Joachim Niehren. Underspecified Beta Reduction. In Proceedings of the 39th Annual Meeting of the Association of Computational Linguistics (ACL'01), July 6-11, Pages 74-81, Toulouse, France, 2001. [Abstract]     google [Annote] 12 Markus Egg, Alexander Koller and Joachim Niehren. The Constraint Language for Lambda Structures. In Journal of Logic, Language, and Information, Vol. 10(4):457-485, 2001.     google [Annote] 13 Martin Müller, Joachim Niehren and Ralf Treinen. The First-Order Theory of Ordering Constraints over Feature Trees. In Discrete Mathematics and Theoretical Computer Science, Vol. 4(2):193-234, 2001. [Abstract]     google [Annote]

<< 2000 >>

14 Denys Duchier and Joachim Niehren. Dominance Constraints with Set Operators. In J. Lloyd and V. Dahl editors, 1st International Conference on Computational Logic (CL '00), July 24-28, (1861):326-341, Springer, Imperial College, London, UK, 2000. [Abstract]     google [Annote] 15 Katrin Erk and Joachim Niehren. Parallelism Constraints. In L. Bachmair editor, 11th International Conference on Rewriting Techniques and Applications (RTA '00), July 10-12, Springer, University of East Anglia, Norwich, UK, 2000. [Abstract]     google [Annote] 16 Alexander Koller, Kurt Mehlhorn and Joachim Niehren. A Polynomial-Time Fragment of Dominance Constraints. In 38th Annual Meeting of the Association of Computational Linguistics (ACL '00), October 1-8, Hong Kong, 2000. [Abstract]     google [Annote] 17 Alexander Koller and Joachim Niehren. Constraint Programming in Computational Linguistics. In Dave Barker-Plummer, D. Beaver, Johan van Benthem and P. Scotto di Luzio editors, 8th CSLI Workshop on Logic Language and Computation, May 30, CSLI, Stanford, 2000. [Abstract]     google [Annote] 18 Alexander Koller and Joachim Niehren. On Underspecified Processing of Dynamic Semantics. In 18th International Conference on Computational Linguistics (COLING '00), July 31 - August 4, Pages 460-466, Morgan Kaufmann, Saarbrücken, Germany, 2000. [Abstract]     google [Annote] 19 Alexander Koller, Joachim Niehren and Kristina Striegnitz. Relaxing Underspecified Semantic Representations for Reinterpretation. In Grammars, Vol. 3(2-3), 2000. [Abstract]     google [Annote] 20 Martin Müller and Joachim Niehren. Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic. In Information and Computation, Vol. 159(1-2):22-58, 2000. [Abstract]     google [Annote] 21 Martin Müller, Joachim Niehren and Andreas Podelski. Ordering Constraints over Feature Trees. In Constraints, an International Journal, Vol. 5(1-2):7-42, 2000. [Abstract]     google [Annote] 22 Joachim Niehren. Uniform Confluence in Concurrent Computation. In Journal of Functional Programming, Vol. 10(3):1-47, 2000. [Abstract]     google [Annote] 23 Joachim Niehren, Ralf Treinen and Sophie Tison. On Rewrite Constraints and Context Unification. In Information Processing Letters, Vol. 74(1-2):35-40, 2000. [Abstract]     google [Annote]

<< 1999 >>

24 Alexander Koller and Joachim Niehren. Scope Underspecification and Processing. Technical report, Reader for the ESSLLI summer school, 1999. [Abstract]     google [Annote] 25 Alexander Koller, Joachim Niehren and Kristina Striegnitz. Relaxing Underspecified Semantic Representations for Reinterpretation. In 6th Meeting on Mathematics of Language (MOL6), July 23-25, Pages 74-87, Orlando, Florida, USA, 1999. [Abstract]     google [Annote] 26 Joachim Niehren. Uniform Confluence in Concurrent Computation. Technical report, Technical Report, Universität des Saarlandes, Programming Systems Lab, Saarbrücken, 1999. [Abstract]     google [Annote] 27 Joachim Niehren, Martin Müller and Jean-Marc Talbot. Entailment of Atomic Set Constraints is PSPACE-Complete. In 14th Annual IEEE Symposium on Logic in Computer Science (LICS '99), July 2-5, Pages 285-294, IEEE Press, Trento, Italy, 1999. [Abstract]     google [Annote] 28 Joachim Niehren and Tim Priesnitz. Characterizing Subtype Entailment in Automata Theory. Technical report, Technical Report, Universität des Saarlandes, Saarbrücken, 1999. [Abstract]     google [Annote] 29 Joachim Niehren and Tim Priesnitz. Entailment of Non-Structural Subtype Constraints. In Asian Computing Science Conference, December 10-12, (1742):251-265, Springer, Phuket, Thailand, 1999. [Abstract]     google [Annote]

<< 1998 >>

30 Markus Egg, Alexander Koller, Joachim Niehren and Peter Ruhrberg. Constraints over Lambda Structures, Antecedent Contained Deletion, and Quantifier Identities. Technical report, Technical Report, Computational Linguistics and Programming Systems Lab, University of the Saarland, Saarbrücken, 1998. [Abstract]     google 31 Markus Egg, Joachim Niehren, Peter Ruhrberg and Feiyu Xu. Constraints over Lambda-Structures in Semantic Underspecification. In ACL editor, 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING-ACL'98), August 10-14, Vol. 1:353-359, Morgan Kaufmann Publishers, Montréal, Québec, Canada, 1998. [Abstract]     google [Annote] 32 Alexander Koller, Joachim Niehren and Ralf Treinen. Dominance Constraints: Algorithms and Complexity. In 3rd International Conference on Logical Aspects of Computational Linguistics (LACL '98), December 14-16, Grenoble, France, 1998. [Abstract]     google [Annote] 33 Martin Müller and Joachim Niehren. Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic. In T. Nipkow editor, 9th International Conference on Rewriting Techniques and Applications (RTA '98), March 30 - April 1, (1379):196-210, Springer-Verlag, Tsukuba, Japan, 1998. [Abstract]     google [Annote] 34 Martin Müller, Joachim Niehren and Ralf Treinen. The First-Order Theory of Ordering Constraints over Feature Trees. In 13th Annual IEEE Symposium on Logic in Computer Sience (LICS '98), June 21 - 24, Pages 432-443, IEEE Press, Indianapolis, Indiana, USA, 1998. [Abstract]     google [Annote] 35 Joachim Niehren and Alexander Koller. Dominance Constraints in Context Unification. In M. Moortgat editor, 3rd International Conference on Logical Aspects of Computational Linguistics (LACL '98), December 14-16, (2014):199-218, Springer, Grenoble, France, 1998. [Abstract]     google [Annote] 36 Joachim Niehren, Martin Müller and Jean-Marc Talbot. Entailment of Atomic Set Constraints is PSPACE-Complete. Technical report, Technical Report, Universität des Saarlandes, Programming Systems Lab, Saarbrücken, 1998. [Abstract]     google [Annote]

<< 1997 >>

37 Martin Müller and Joachim Niehren. Entailment of Set Constraints is not Feasible. Technical report, Technical Report, Universität des Saarlandes, Programming Systems Lab, Saarbrücken, 1997. [Abstract]     google [Annote] 38 Martin Müller, Joachim Niehren and Andreas Podelski. Ordering Constraints over Feature Trees. In Gert Smolka editor, 3rd International Conference on Principles and Practice of Constraint Programming (CP '97), October 29 - November 1, (1330):297-311, Springer, Schloss Hagenberg, Austria, 1997. [Abstract]     google [Annote] 39 Martin Müller, Joachim Niehren and Gert Smolka. Typed Concurrent Programming with Logic Variables. Technical report, Technical Report, Universität des Saarlandes, Programming Systems Lab, Saarbrücken, September 1997. [Abstract]     google [Annote] 40 Joachim Niehren, Martin Müller and Andreas Podelski. Inclusion Constraints over Non-Empty Sets of Trees. In M. Bidoit and M. Dauchet editors, 7th International Joint Conference CAAP/ FASE. Theory and Practice of Software Development (TAPSOFT '97), April 14-18, (1214):217-231, Springer, Lille, France, 1997. [Abstract]     google [Annote] 41 Joachim Niehren, Manfred Pinkal and Peter Ruhrberg. On Equality up-to Constraints over Finite Trees, Context Unification and One-Step Rewriting. In W. McCune editor, 14th International Conference on Automated Deduction (CADE 14), July 13-17, (1249):34-48, Springer, Townsville, Australia, 1997. [Abstract]     google [Annote] 42 Joachim Niehren, Manfred Pinkal and Peter Ruhrberg. A Uniform Approach to Underspecification and Parallelism. In P. R. Cohen and Wolfgang Wahlster editors, 35th Annual Meeting of the Association of Computational Linguistics (ACL), July 7-12, Pages 410-417, ACL, Madrid, Spain, 1997. [Abstract]     google [Annote]

<< 1996 >>

43 Joachim Niehren. Functional Computation as Concurrent Computation. In 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '96), January 21-24, Pages 333-343, ACM Press, St. Petersburg Beach, Florida, USA, 1996. [Abstract]     google Note: longer version appeared as DFKI Research Report RR-95-14. [Annote]

<< 1995 >>

44 Joachim Niehren. Functional Computation as Concurrent Computation. Technical report, Research Report RR-95-14, DFKI, Saarbrücken, 1995.     google

Last modified: Thu October 16 2014 19:11:34