Nombre de documents

54

Joachim Niehren's publications


Article dans une revue12 documents

  • Joachim Niehren, Cristian Versari, Mathias John, François Coutte, Philippe Jacques. Predicting Changes of Reaction Networks with Partial Kinetic Information. BioSystems, Elsevier, 2016, Special Issue of CMSB 2015, pp.47. <hal-01239198v2>
  • Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren, Elisa Tonello. Structural simplification of chemical reaction networks in partial steady states. BioSystems, Elsevier, 2016, <10.1016/j.biosystems.2016.08.003>. <hal-01350517>
  • Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. Automata for Unordered Trees. Information and Computation, Elsevier, 2016, <10.1016/j.ic.2016.07.012>. <hal-01179493>
  • François Coutte, Joachim Niehren, Debarun Dhali, Mathias John, Cristian Versari, et al.. Modeling Leucine’s Metabolic Pathway and Knockout Prediction Improving the Production of Surfactin, a Biosurfactant from Bacillus Subtilis. Biotechnology Journal, Wiley-VCH Verlag, 2015, 10 (8), pp.1216-34. <hal-01153704>
  • Katrin Erk, Alexander Koller, Joachim Niehren. Processing Underspecified Semantic Representations in the Constraint Language for Lambda Structures. Journal on Research in Language and Computation, Elsevier, 2002, 1 (1), pp.127--169. <inria-00536796>
  • Markus Egg, Alexander Koller, Joachim Niehren. The Constraint Language for Lambda Structures. Journal of Logic, Language and Information, Springer Verlag, 2001, 10, pp.457-485. <inria-00536795>
  • Martin Müller, Joachim Niehren, Ralf Treinen. The First-Order Theory of Ordering Constraints over Feature Trees. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, 4 (2), pp.193-234. <inria-00536800>
  • Joachim Niehren. Uniform Confluence in Concurrent Computation. Journal on Functional Programming, Elsevier, 2000, 10 (5), pp.453-499. <inria-00536801>
  • Alexander Koller, Joachim Niehren, Kristina Striegnitz. Relaxing Underspecified Semantic Representations for Reinterpretation. Grammars, Springer Verlag, 2000, 3 (2/3), pp.217-241. <inria-00536797>
  • Martin Müller, Joachim Niehren. Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic. Information and Computation, Elsevier, 2000, 159 (1/2), pp.22--58. <inria-00536798>
  • Martin Müller, Joachim Niehren, Andreas Podelski. Ordering Constraints over Feature Trees. Constraints, an International Journal, Elsevier, 2000, 5 (1--2), pp.7--42. <inria-00536799>
  • Joachim Niehren, Ralf Treinen, Sophie Tison. On Rewrite Constraints and Context Unification. Information Processing Letters, Elsevier, 2000, 74 (1-2), pp.35--40. <inria-00536802>

Communication dans un congrès35 documents

  • Guillaume Madelaine, Elisa Tonello, Cédric Lhoussaine, Joachim Niehren. Normalizing Chemical Reaction Networks by Confluent Structural Simplification. 14th International Conference on Computational Methods in Systems Biology (CMSB 2016), Sep 2016, Cambridge, United Kingdom. Springer, Computational Methods in Systems Biology 14th International Conference, CMSB 2016, Cambridge, UK, September 21-23, 2016, Proceedings, 9859, Lecture Notes in Bioinformatics. <http://www.springer.com/gp/book/9783319451763>. <hal-01348303>
  • Tom Sebastian, Joachim Niehren. Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams. International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Jan 2016, Harrachov, Czech Republic. 2015. <hal-01182529>
  • Adrien Boiret, Aurélien Lemay, Joachim Niehren. Learning Top-Down Tree Transducers with Regular Domain Inspection. International Conference on Grammatical Inference 2016, Oct 2016, Delft, Netherlands. International Conference on Grammatical Inference 2016, <http://icgi2016.tudelft.nl/>. <hal-01357186>
  • Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren. Structural simplification of chemical reaction networks preserving deterministic semantics. Computational Methods in Systems Biology (CMSB), Sep 2015, Nantes, France. Springer, Lecture Notes in Computer Science, 9308, pp.133-144, Lecture Notes in Computer Science. <hal-01168038>
  • Joachim Niehren, Mathias John, Cristian Versari, François Coutte, Philippe Jacques. Qualitative Reasoning about Reaction Networks with Partial Kinetic Information. Computational Methods for Systems Biology, Sep 2015, Nantes, France. 9308, pp.157-169, Lecture Notes in Computer Science. <hal-01163391v2>
  • Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. Logics for Unordered Trees with Data Constraints on Siblings. LATA : 9th International Conference on Language and Automata Theory and Applications, Mar 2015, Nice, France. pp.175-187, <http://grammars.grlmc.com/lata2015/>. <hal-01088761>
  • Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui. Early Nested Word Automata for XPath Query Answering on XML Streams. 18th International Conference on Implementation and Application of Automata, Jul 2013, Halifax, Canada. pp.292-305, 2013. <hal-00676178v2>
  • Adrien Boiret, Aurélien Lemay, Joachim Niehren. Learning Rational Functions. 16th International Conference on Developments of Language Theory, Apr 2012, Taipee, Taiwan. 2012. <hal-00692341>
  • François Coutte, Mathias John, Max Béchet, Mirabelle Nebut, Joachim Niehren, et al.. Synthetic Engineering of Bacillus subtilis to Overproduce Lipopeptide Biosurfactants. 9th European Symposium on Biochemical Engineering Science, Sep 2012, Istanbul, Turkey. 2012. <hal-00717261>
  • Zhendong Su, Alex Aiken, Joachim Niehren, Tim Priesnitz, Ralf Treinen. First-Order Theory of Subtyping Constraints. The 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002, Portland, United States. ACM Press, pp.203-216, 2002. <inria-00536828>
  • Joachim Niehren, Mateu Villaret. Parallelism and Tree Regular Constraints. International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 2002, Tblisi, Georgia. Springer, 2514, pp.311--326, 2002, Lecture Notes in Computer Science. <inria-00536827>
  • Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, et al.. An Efficient Algorithm for the Configuration Problem of Dominance Graphs. Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, Washington, DC, United States. ACM Press, pp.815--824, 2001. <inria-00536803>
  • Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren. Beta Reduction Constraints. Aart Middeldorp. International Conference on Rewriting Techniques and Applications, 2001, Utrecht, Netherlands. Springer-Verlag, Berlin, pp.31-46, 2001, Lecture Notes in Computer Science. <inria-00536804>
  • Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren. Underspecified Beta Reduction. 39th Annual Meeting of the Association for Computational Linguistics, 2001, Toulouse, France. pp.74-81, 2001. <inria-00536805>
  • Alexander Koller, Joachim Niehren. On Underspecified Processing of Dynamic Semantics. 18th International Conference on Computational Linguistics, 2000, Saarbrücken, Georgia. pp.460--466, 2000. <inria-00536810>
  • Katrin Erk, Joachim Niehren. Parallelism Constraints. International Conference on Rewriting Techniques and Applications, 2000, Norwich, United Kingdom. Springer, 1833, pp.110--126, 2000, Lecture Notes on Computer Science. <inria-00536808>
  • Alexander Koller, Kurt Mehlhorn, Joachim Niehren. A Polynomial-Time Fragment of Dominance Constraints. 38th Annual Meeting of the Association of Computational Linguistics, 2000, Hong Kong, China. pp.368--375, 2000. <inria-00536809>
  • Denys Duchier, Joachim Niehren. Dominance Constraints with Set Operators. Proceedings of the First International Conference on Computational Logic, 2000, London, United Kingdom. Springer, 1861, pp.326-341, 2000, Lecture Notes on Computer Science. <inria-00536806>
  • Joachim Niehren, Tim Priesnitz. Entailment of Non-Structural Subtype Constraints. P. S. Thiagarajan and Roland H. C. Yap. Asian Computing Science Conference, 1999, Phuket, Thailand. Springer, 1742, pp.251--265, 1999, Lecture Notes on Computer Science. <inria-00536825>
  • Alexander Koller, Joachim Niehren, Kristina Striegnitz. Relaxing Underspecified Semantic Representations for Reinterpretation. 6th Meeting on Mathematics of Language, 1999, Orlando, Florida, United States. pp.74--87, 1999. <inria-00536811>
  • Joachim Niehren, Martin Müller, Jean-Marc Talbot. Entailment of Atomic Set Constraints is PSPACE-Complete. Fourteenth Annual IEEE Symposium on Logic in Computer Sience, 1999, Trento, Italy. IEEE Computer Science Press, pp.285--294, 1999. <inria-00536817>
  • Martin Müller, Joachim Niehren, Ralf Treinen. The First-Order Theory of Ordering Constraints over Feature Trees. 13th annual IEEE Symposium on Logic in Computer Sience, 1998, Indianapolis, Indiana, United States. IEEE Computer Science Press, pp.432--443, 1998. <inria-00536818>
  • Martin Müller, Joachim Niehren. Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic. Tobias Nipkow. 9th International Conference on Rewriting Techniques and Applications, 1998, Tsukuba, Japan. Springer, 1379, pp.196--210, 1998, Lecture Notes on Computer Science. <inria-00536814>
  • Alexander Koller, Joachim Niehren, Ralf Treinen. Dominance Constraints: Algorithms and Complexity. M. Moortgat. Third International Conference on Logical Aspects of Computational Linguistics 1998 (Postproceedings 2001), 1998, Grenoble, France. Springer, 2014, pp.106-125, 2001, Lecture Notes on Computer Science. <inria-00536812>
  • Joachim Niehren, Alexander Koller. Dominance Constraints in Context Unification. M. Moortgat. 3rd International Conference on Logical Aspects of Computational Linguistics 1998 (Postproceedings 2001), 1998, Heidelberg, France. Springer, 2014, pp.199-218, 2001, Lecture Notes on Computer Science. <inria-00536820>
  • Markus Egg, Joachim Niehren, Peter Ruhrberg, 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), 1998, Montreal, Canada. pp.353--359, 1998. <inria-00536807>
  • Joachim Niehren, Manfred Pinkal, Peter Ruhrberg. On Equality Up-to Constraints over Finite Trees, Context Unification and One-Step Rewriting. Proceedings of the International Conference on Automated Deduction, 1997, Townsville, Australia. Springer, 1249, pp.34-48, 1997, Lecture Notes on Computer Science. <inria-00536822>
  • Martin Müller, Joachim Niehren, Andreas Podelski. Ordering Constraints over Feature Trees. Gert Smolka. 3rd International Conference on Principles and Practice of Constraint Programming, 1997, Schloss Hagenberg, Linz, Austria. Springer, 1330, pp.297--311, 1997, Lecture Notes on Computer Science. <inria-00536815>
  • Joachim Niehren, Manfred Pinkal, Peter Ruhrberg. A Uniform Approach to Underspecification and Parallelism. 35th Annual Meeting of the Association of Computational Linguistics, 1997, Madrid, Spain. pp.410-417, 1997. <inria-00536821>
  • Martin Müller, Joachim Niehren, Andreas Podelski. Inclusion Constraints over Non-Empty Sets of Trees. Max Dauchet. Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS, 1997, Lille, France. Springer, 1214, pp.217-231, 1997, Lecture Notes on Computer Science. <inria-00536816>
  • Joachim Niehren. Functional Computation as Concurrent Computation. 23th ACM Symposium on Principles of Programming Languages, 1996, St. Petersburg Beach, Florida, United States. ACM Press, pp.333--343, 1996. <inria-00536819>
  • Joachim Niehren, Martin Müller. Constraints for Free in Concurrent Computation. Kanchanasut, Kanchana and Lévy, Jean-Jacques. Asian Computing Science Conference, 1995, Pathumthani, Thailand. Springer, 1023, pp.171--186, 1995, Lecture Notes on Computer Science. <inria-00536813>
  • Joachim Niehren, Gert Smolka. A Confluent Relational Calculus for Higher-Order Programming with Constraints. Jean-Pierre Jouannaud. 1st International Conference on Constraints in Computational Logics, 1994, Munich, Germany. Springer, 845, 1994, Lecture Notes on Computer Science. <inria-00536826>
  • Joachim Niehren, Andreas Podelski, Ralf Treinen. Equational and Membership Constraints for Infinite Trees. Claude Kirchner. 5th International Conference on Rewriting Techniques and Applications, 1993, Montreal, Canada. Springer, 690, pp.106-120, 1993, Lecture Notes on Computer Science. <inria-00536824>
  • Joachim Niehren, Andreas Podelski. Feature Automata and Recognizable Sets of Feature Trees. Marie-Claude Gaudel and Jean-Pierre Jouannaud. TAPSOFT: Theory and Practice of Software Development: Joint International Conference CAAP/FASE/TOOLS., 1993, Orsay, France. Springer, 668, pp.356--375, 1993, Lecture Notes on Computer Science. <inria-00536823>

Chapitre d'ouvrage1 document

  • Alexander Koller, Joachim Niehren. Constraint Programming in Computational Linguistics. Dave Barker-Plummer and David I. Beaver and Johan van Benthem and Patrick Scotto di Luzio. Words, Proofs, and Dialog, 141, CSLI Press, pp.95-122, 2002. <inria-00536829>

Autre publication3 documents

  • Antoine Ndione, Aurélien Lemay, Joachim Niehren. Sublinear DTD Validity. Long version of a Lata 15 paper. 2015. <hal-01187016>
  • Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. Logics for Unordered Trees with Data Constraints. Long version of LATA'15 paper. 2015, pp.40. <hal-01176763>
  • Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawomir Staworko, Marc Tommasi. Sequential Tree-to-Word Transducers: Normalization, Minimization, and Learning. Long version of Lata 14 paper. 2015. <hal-01186993>

Pré-publication, Document de travail2 documents

  • Adrien Boiret, Aurélien Lemay, Joachim Niehren. A Learning Algorithm for Top-Down Tree Transducers. 2016. <hal-01357627>
  • Adrien Boiret, Aurélien Lemay, Joachim Niehren. Learning Top-Down Tree Transformations with Regular Inspection. 2016. <hal-01357631>

Rapport1 document

  • Pavel Labath, Joachim Niehren. A Functional Language for Hyperstreaming XSLT. [Research Report] inria lille. 2013. <hal-00806343>