BibTex

Joachim Niehren`s Publications on Computational Linguistics


International Journals

  1. [2003] Ernst Althaus and Denys Duchier and Alexander Koller and Kurt Mehlhorn and Joachim Niehren and Sven Thiel, An Efficient Graph Algorithm for Dominance Constraints, Algorithms 1 48, 194--219
  2. [2001] Markus Egg and Alexander Koller and Joachim Niehren, The Constraint Language for Lambda Structures, Journal of Logic, Language and Information 10, 457-485
  3. [2000] Martin Müller and Joachim Niehren and Andreas Podelski, Ordering Constraints over Feature Trees, Constraints, an International Journal 1--2 5, 7--42
  4. [2000] Alexander Koller and Joachim Niehren and Kristina Striegnitz, Relaxing Underspecified Semantic Representations for Reinterpretation, Grammars 2/3 3, 217-241

International Conferences

  1. [2008] Marco Kuhlmann and Joachim Niehren, Logics and Automata for Totally Ordered Trees, 19th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 5117, 217-231
  2. [2005] Joachim Niehren and Mateu Villaret, Describing Lambda Terms in Context Unification, 5th International Conference on Logical Aspects in Computational Linguistics, Lecture Notes in Artificial Intelligence 3492, 221-237
  3. [2004] Ruth Fuchss and Alexander Koller and Joachim Niehren and Stefan Thater, Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis, 42th Meeting of the Association for Computational Linguistics, 247-254
  4. [2004] Manuel Bodirsky and Denys Duchier and Sebastian Miele and Joachim Niehren, A New Algorithm for Normal Dominance Constraints, ACM-SIAM Symposium on Discrete Algorithms, 54-78
  5. [2003] Katrin Erk and Joachim Niehren, Well-Nested Parallelism Constraints for Ellipsis Resolution, 11th Conference of the European Chapter of the Association of Computational Linguistics, 115--122
  6. [2003] Joachim Niehren and Stefan Thater, Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints, 41st Meeting of the Association of Computational Linguistics, 367-374
  7. [2003] Alexander Koller and Joachim Niehren and Stefan Thater, Bridging the Gap Between Underspecification Formalisms: Hole Semantics as Dominance Constraints, Meeting of the European Chapter of the Association of Computational Linguistics, 195-202
  8. [2001] Manuel Bodirsky and Katrin Erk and Alexander Koller and Joachim Niehren, Underspecified Beta Reduction, 39th Annual Meeting of the Association for Computational Linguistics, 74-81
  9. [2001] Joachim Niehren and Alexander Koller, Dominance Constraints in Context Unification, Proceedings of the 3rd International Conference on Logical Aspects of Computational Linguistics (Dec. 1998, Grenoble, France), Lecture Notes in Computer Science 2014, 199-218
  10. [2001] Ernst Althaus and Denys Duchier and Alexander Koller and Kurt Mehlhorn and Joachim Niehren and Sven Thiel, An Efficient Algorithm for the Configuration Problem of Dominance Graphs, Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 815--824
  11. [2001] Alexander Koller and Joachim Niehren and Ralf Treinen, Dominance Constraints: Algorithms and Complexity, Third International Conference on Logical Aspects of Computational Linguistics (Dec. 1998, Grenoble, France), Lecture Notes in Computer Science 2014, 106-125
  12. [2000] Denys Duchier and Joachim Niehren, Dominance Constraints with Set Operators, Proceedings of the First International Conference on Computational Logic (CL2000), Lecture Notes in Computer Science 1861, 326-341
  13. [2000] Alexander Koller and Kurt Mehlhorn and Joachim Niehren, A Polynomial-Time Fragment of Dominance Constraints, 38th Annual Meeting of the Association of Computational Linguistics, 368--375
  14. [2000] Alexander Koller and Joachim Niehren, On Underspecified Processing of Dynamic Semantics, 18th International Conference on Computational Linguistics, 460--466
  15. [1999] Alexander Koller and Joachim Niehren and Kristina Striegnitz, Relaxing Underspecified Semantic Representations for Reinterpretation, 6th Meeting on Mathematics of Language, 74--87
  16. [1998] Markus Egg and Joachim Niehren and Peter Ruhrberg and Feiyu Xu, Constraints over Lambda-Structures in Semantic Underspecification, Joined 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING/ACL'98), 353--359
  17. [1997] Martin Müller and Joachim Niehren and Andreas Podelski, Ordering Constraints over Feature Trees, 3rd International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science 1330, 297--311
  18. [1997] Joachim Niehren and Manfred Pinkal and Peter Ruhrberg, A Uniform Approach to Underspecification and Parallelism, 35th Annual Meeting of the Association of Computational Linguistics, 410-417

Books or Book Chapters

  1. [2002] Alexander Koller and Joachim Niehren, Constraint Programming in Computational Linguistics, Words, Proofs, and Dialog 141, 95-122
  2. [1999] Alexander Koller and Joachim Niehren, Scope Underspecification and Processing, Reader for the ESSLLI summer school.





Valid HTML 4.01! Valid CSS!