Query database
Add entry by form
Add entry in bibtex format
Edit entries
Show variables

BibTex

Joachim Niehren`s Publications on Logics and Constraints

International Journals

  1. [2007] Katrin Erk and Joachim Niehren, Dominance Constraints in Stratified Context Unification, Information Processing Letters 4 101, 141-147
  2. [2007] Julien Carme and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Interactive Learning of Node Selecting Tree Transducers, Machine Learning 1 66, 33--67
  3. [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
  4. [2002] Katrin Erk and Alexander Koller and Joachim Niehren, Processing Underspecified Semantic Representations in the Constraint Language for Lambda Structures, Journal of Research on Language and Computation 1 1, 127--169
  5. [2001] Martin Müller and Joachim Niehren and Ralf Treinen, The First-Order Theory of Ordering Constraints over Feature Trees, Discrete Mathematics and Theoretical Computer Science 2 4, 193-234
  6. [2001] Markus Egg and Alexander Koller and Joachim Niehren, The Constraint Language for Lambda Structures, Journal of Logic, Language and Information 10, 457-485
  7. [2000] Martin Müller and Joachim Niehren, Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic, Information and Computation 1/2 159, 22--58
  8. [2000] Martin Müller and Joachim Niehren and Andreas Podelski, Ordering Constraints over Feature Trees, Constraints, an International Journal 1--2 5, 7--42
  9. [2000] Joachim Niehren and Ralf Treinen and Sophie Tison, On Rewrite Constraints and Context Unification, Information Processing Letters 1-2 74, 35--40

International Conferences

  1. [2009] Olivier Gauwin and Joachim Niehren and Sophie Tison, Bounded Delay and Concurrency for Earliest Query Answering, 3rd International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science 5457, 350-361
  2. [2008] Mathias John and Cédric Lhoussaine and Joachim Niehren and Adelinde Uhrmacher, The Attributed Pi Calculus, Computational Methods in Systems Biology, 6th International Conference, Lecture Notes in Computer Science 5307, 83-102
  3. [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
  4. [2007] Emmanuel Filiot and Joachim Niehren and Jean-Marc Talbot and Sophie Tison, Polynomial Time Fragments of XPath with Variables, 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 205-214
  5. [2006] Aurélien Lemay and Joachim Niehren and Rémi Gilleron, Learning n-ary Node Selecting Tree Transducers from Completely Annotated Examples, International Colloquium on Grammatical Inference, Lecture Notes in Artificial Intelligence 4201, 253-267
  6. [2005] Joachim Niehren and Tim Priesnitz and Zhendong Su, Complexity of Subtype Satisfiability over Posets, 14th European Symposium on Programming, Lecture Notes in Computer Science 3444, 357-373
  7. [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
  8. [2005] Joachim Niehren and Laurent Planque and Jean-Marc Talbot and Sophie Tison, N-ary Queries by Tree Automata, 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science 3774, 217--231
  9. [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
  10. [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
  11. [2004] Julien Carme and Joachim Niehren and Marc Tommasi, Querying Unranked Trees with Stepwise Tree Automata, 19th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 3091, 105--118
  12. [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
  13. [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
  14. [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
  15. [2002] Zhendong Su and Alexander Aiken and Joachim Niehren and Tim Priesnitz and Ralf Treinen, First-Order Theory of Subtyping Constraints, The 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
  16. [2002] Joachim Niehren and Mateu Villaret, Parallelism and Tree Regular Constraints, International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Lecture Notes in Artificial Intelligence 2514, 311--326
  17. [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
  18. [2001] Manuel Bodirsky and Katrin E. Erk and Alexander Koller and Joachim Niehren, Beta Reduction Constraints, International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, 31-46
  19. [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
  20. [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
  21. [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
  22. [2000] Katrin E. Erk and Joachim Niehren, Parallelism Constraints, International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 1833, 110--126
  23. [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
  24. [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
  25. [1999] Martin Müller and Joachim Niehren and Jean-Marc Talbot, Entailment of Atomic Set Constraints is PSPACE-Complete, Fourteenth Annual IEEE Symposium on Logic in Computer Sience, 285--294
  26. [1999] Joachim Niehren and Tim Priesnitz, Entailment of Non-Structural Subtype Constraints, Asian Computing Science Conference, Lecture Notes in Computer Science 1742, 251--265
  27. [1999] Alexander Koller and Joachim Niehren and Kristina Striegnitz, Relaxing Underspecified Semantic Representations for Reinterpretation, 6th Meeting on Mathematics of Language, 74--87
  28. [1998] Martin Müller and Joachim Niehren, Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic, 9th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 1379, 196--210
  29. [1998] Martin Müller and Joachim Niehren and Ralf Treinen, The First-Order Theory of Ordering Constraints over Feature Trees, 13th annual IEEE Symposium on Logic in Computer Sience, 432--443
  30. [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
  31. [1997] Martin Müller and Joachim Niehren and Andreas Podelski, Inclusion Constraints over Non-Empty Sets of Trees, Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS, Lecture Notes in Computer Science 1214, 217-231
  32. [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
  33. [1997] Joachim Niehren and Manfred Pinkal and Peter Ruhrberg, On Equality Up-to Constraints over Finite Trees, Context Unification and One-Step Rewriting, Proceedings of the International Conference on Automated Deduction, Lecture Notes in Computer Science 1249, 34-48
  34. [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
  35. [1996] Joachim Niehren, Functional Computation as Concurrent Computation, 23th Proceedings of the ACM Symposium on Principles of Programming Languages, 333--343
  36. [1995] Martin Müller and Joachim Niehren, Constraints for Free in Concurrent Computation, Asian Computing Science Conference, Lecture Notes in Computer Science 1023, 171--186
  37. [1994] Joachim Niehren and Gert Smolka, A Confluent Relational Calculus for Higher-Order Programming with Constraints, 1st International Conference on Constraints in Computational Logics, Lecture Notes in Computer Science 845
  38. [1993] Joachim Niehren and Andreas Podelski and Ralf Treinen, Equational and Membership Constraints for Infinite Trees, Proceedings. Fifth International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 690, 106-120

International Workshops

  1. [2006] Emmanuel Filiot and Joachim Niehren and Jean-Marc Talbot and Sophie Tison, Composing Monadic Queries in Trees, PLAN-X International Workshop, 61--70
  2. [2006] Céline Kuttler and Cédric Lhoussaine and Joachim Niehren, A Stochastic Pi Calculus for Concurrent Objects, 1st International Workshop on Probabilistic Automata and Logics

Books or Book Chapters

  1. [1999] Alexander Koller and Joachim Niehren, Scope Underspecification and Processing, Reader for the ESSLLI summer school.

Phd and Habilitation thesis

  1. [1994] Joachim Niehren, Funktionale Berechnung in einem uniform nebenläufigen Kalkül mit logischen Variablen, Universität des Saarlandes, Fachbereich Informatik

Others

  1. [2010] Olivier Gauwin and Joachim Niehren, Streamable Fragments of Forward XPath
  2. [2006] Zhendong Su and Alexander Aiken and Joachim Niehren and Tim Priesnitz and Ralf Treinen, First-Order Theory of Subtyping Constraints, ACM Transactions on Programming Languages and Systems





Valid HTML 4.01! Valid CSS!