Nombre de documents

113

Joachim Niehren's publications


Article dans une revue28 documents

  • Guillaume Madelaine, Elisa Tonello, Cédric Lhoussaine, Joachim Niehren. Simplification of Reaction Networks, Confluence and Elementary Modes. MDPI - Computation, http://www.mdpi.com/journal/computation, 2017, Multiscale and Hybrid Modeling of the Living Systems. <hal-01471074>
  • 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>
  • 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, Special Issue of CMSB'2015, <10.1016/j.biosystems.2016.08.003>. <hal-01350517>
  • Manfred Schmidt-Schauss, David Sabel, Joachim Niehren, Jan Schwinghammer. Observational Program Calculi and the Correctness of Translations. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 577, pp.98-124. <10.1016/j.tcs.2015.02.027>. <hal-00824349>
  • Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui. Early Nested Word Automata for XPath Query Answering on XML Streams. Theoretical Computer Science, Elsevier, 2015, pp.100-127. <hal-00966625>
  • 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>
  • Antoine Ndione, Aurélien Lemay, Joachim Niehren. Approximate Membership for Regular Languages modulo the Edit Distance. Theoretical Computer Science, Elsevier, 2013, 487, pp.37-49. <hal-00801970>
  • Joachim Niehren, Jérôme Champavère, Rémi Gilleron, Aurélien Lemay. Query Induction with Schema-Guided Pruning Strategies. Journal of Machine Learning Research, Journal of Machine Learning Research, 2013, 14, pp.927−964. <inria-00607121v2>
  • Olivier Gauwin, Joachim Niehren, Sophie Tison. Queries on XML Streams with Bounded Delay and Concurrency. Information and Computation, Elsevier, 2011, Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), 209 (3), pp.409-442. <10.1016/j.ic.2010.08.003>. <inria-00491495>
  • Mathias John, Cédric Lhoussaine, Joachim Niehren, Adelinde Uhrmacher. The Attributed Pi Calculus with Priorities. Transactions on Computational Systems Biology, Springer, 2010, Lecture Notes in Computer Science, XII (5945), pp.13-76. <inria-00422969>
  • Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Efficient Inclusion Checking for Deterministic Tree Automata and XML Schemas. Information and Computation, Elsevier, 2009, 207 (11), pp.1181-1208. <10.1016/j.ic.2009.03.003>. <inria-00366082v3>
  • Olivier Gauwin, Joachim Niehren, Yves Roos. Streaming Tree Automata. Information Processing Letters, Elsevier, 2008, 109 (1), pp.13-17. <inria-00288445v3>
  • Katrin Erk, Joachim Niehren. Dominance Constraints in Stratified Context Unification. Information Processing Letters, Elsevier, 2007, 101 (4), pp.141-147. <inria-00094787>
  • Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Interactive Learning of Node Selecting Tree Transducers. Machine Learning, Springer Verlag, 2007, Machine Learning, 66 (1), pp.33-67. <10.1007/s10994-006-9613-8>. <inria-00087226v5>
  • Wim Martens, Joachim Niehren. On the Minimization of XML-Schemas and Tree Automata for Unranked Trees. Journal of Computer and System Science, Elsevier, 2007, Journal of Computer and System Science, 73 (4), pp.550-583. <10.1016/j.jcss.2006.10.021>. <inria-00088406v2>
  • Joachim Niehren, Jan Schwinghammer, Gert Smolka. A Concurrent Lambda Calculus with Futures. Theoretical Computer Science, Elsevier, 2006, Theoretical Computer Science, 364 (3), pp.338-356. <10.1016/j.tcs.2006:08.016>. <inria-00090434v2>
  • Céline Kuttler, Joachim Niehren. Gene Regulation in the Pi Calculus: Simulating Cooperativity at the Lambda Switch. Transactions on Computational Systems Biology, Springer, 2006, Lecture Notes in Bioinformatics 4230 , pp.24-55. <inria-00089218v2>
  • Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, et al.. An Efficient Graph Algorithm for Dominance Constraints. Journal of Algorithms in Cognition, Informatics and Logic, Elsevier, 2003, Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms, 48 (1), pp.194-219. <http://portal.acm.org/citation.cfm?id=989537>. <10.1016/S0196-6774(03)00050-6>. <inria-00536539>
  • Joachim Niehren, Tim Priesnitz. Non-Structural Subtype Entailment in Automata Theory. Information and Computation, Elsevier, 2003, 169 (2), pp.319-354. <inria-00536540>
  • 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>
  • 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>
  • 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. Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic. Information and Computation, Elsevier, 2000, 159 (1/2), pp.22--58. <inria-00536798>
  • 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>
  • 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, Andreas Podelski. Ordering Constraints over Feature Trees. Constraints, an International Journal, Elsevier, 2000, 5 (1--2), pp.7--42. <inria-00536799>
  • Joachim Niehren. Uniform Confluence in Concurrent Computation. Journal on Functional Programming, Elsevier, 2000, 10 (5), pp.453-499. <inria-00536801>

Communication dans un congrès76 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>
  • 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>
  • 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>
  • Antoine Mbaye Ndione, Aurélien Lemay, Joachim Niehren. Sublinear DTD Validity. 9th International Conference on. Language and Automata Theory and Applications, Mar 2015, Nice, France. 2015. <hal-00803696>
  • Pavel Labath, Joachim Niehren. A Uniform Programming Language for Implementing XML Standards. 41st SOFSEM: International Conference on Current Trends in Theory and Practice of Computer Science, Jan 2015, Pec pod Sněžkou, Czech Republic. Springer, 2015, Lecture Notes in Computer Science. <http://researchers.lille.inria.fr/~niehren/Papers/X-Fun/1.pdf>. <hal-00954692>
  • 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>
  • 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>
  • 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>
  • Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren. Attractor Equivalence: An Observational Semantics for Reaction Networks. First International Conference on Formal Methods in Macro-Biology, Sep 2014, Nouméa, New Caledonia. Springer-Verlag, pp.82-101, 2014, Lecture Notes in Bioinformatics. <hal-00990924>
  • Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawomir Staworko, Marc Tommasi. Learning Sequential Tree-to-Word Transducers. 8th International Conference on Language and Automata Theory and Applications, Mar 2014, Madrid, Spain. Springer, 2014. <hal-00912969>
  • Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. Deterministic Automata for Unordered Trees. Fifth International Symposium on Games, Automata, Logics and Formal Verification (Gandalf), Sep 2014, Verona, Italy. EPTCS, 161, pp.189-202, 2014, <http://arxiv.org/abs/1408.5966>. <10.4204/EPTCS.161.17>. <hal-01020236>
  • Mathias John, Mirabelle Nebut, Joachim Niehren. Knockout Prediction for Reaction Networks with Partial Kinetic Information. 14th International Conference on Verification, Model Checking, and Abstract Interpretation, Jan 2013, Rome, Italy. Springer, 7737, pp.355-374, 2013, Lecture Notes in Computer Science. <hal-00692499>
  • 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>
  • Mathias John, François Coutte, Mirabelle Nebut, Philippe Jacques, Joachim Niehren. Knockout Prediction for Reaction Networks with Partial Kinetic Information: Application to Surfactin Overproduction in Bacillus subtilis. 3rd International Symposium on Antimicrobial Peptides, Jun 2012, Lille, France. 2012. <hal-00702295>
  • 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>
  • Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawomir Staworko, Marc Tommasi. Normalization of Sequential Top-Down Tree-to-Word Transducers. 5th International Conference on Language Automata Theory and Appliciations, May 2011, Tarragona, Spain. Springer, 2011, LNCS. <inria-00566291>
  • Mathias John, Cédric Lhoussaine, Joachim Niehren, Cristian Versari. Biochemical Reaction Rules with Constraints. 20th European Symposium on Programming Languages, Mar 2011, Saarbrücken, Germany. Springer, 6602, pp.338-357, 2011, LNCS. <inria-00544387>
  • Olivier Gauwin, Joachim Niehren. Streamable Fragments of Forward XPath. 16th International Conference on Implementation and Application of Automata, Jul 2011, Blois, France. pp.3-15, 2011. <inria-00442250>
  • Aurélien Lemay, Sebastian Maneth, Joachim Niehren. A Learning Algorithm for Top-Down XML Transformations. ACM. 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Jun 2010, Indianapolis, United States. ACM Press, pp.285-296, 2010. <inria-00460489v2>
  • Mathias John, Cédric Lhoussaine, Joachim Niehren. Dynamic Compartments in the Imperative Pi Calculus. Computational Methods in Systems Biology, 7th International Conference, Aug 2009, Bologna, Italy. Spinger, 5688, pp.235-250, 2009, LNCS; Computational Methods in Systems Biology, 7th International Conference. <10.1007/978-3-642-03845-7>. <inria-00422970>
  • Olivier Gauwin, Joachim Niehren, Sophie Tison. Earliest Query Answering for Deterministic Nested Word Automata. 17th International Symposium on Fundamentals of Computer Theory, Sep 2009, Wraclaw, Poland. SV, 5699, pp.121-132, 2009, LNCS. <inria-00390236v2>
  • Jan Schwinghammer, David Sabel, Manfred Schmidt-Schauss, Joachim Niehren. Correctly Translating Concurrency Primitives. Andreas Rossberg. The 2009 SIGPLAN Workshop on ML, Oct 2009, Edinburgh, United Kingdom. pp.27-38, 2009, ACM Digital Library. <inria-00429239>
  • Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren. Equivalence of Deterministic Nested Word to Word Transducers. Maciej Gebala and Malgorzata Korzeniowska and Witold Charatonik. Fundamentals of Computation Theory, Sep 2009, Wroclaw, Poland. Springer, 5699, pp.310-322, 2009, Lecture Notes in Computer Science; Fundamentals of Computation Theory. <10.1007/978-3-642-03409-1_28>. <inria-00423961>
  • Olivier Gauwin, Joachim Niehren, Sophie Tison. Bounded Delay and Concurrency for Earliest Query Answering. Adrian Horia Dediu and Armand Mihai Ionescu and Carlos Martin-Vide. 3rd International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. Springer, 5457, pp.350-361, 2009, Lecture Notes in Computer Science; Language and Automata Theory and Applications. <10.1007/978-3-642-00982-2>. <inria-00348463>
  • Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Schema-Guided Induction of Monadic Queries. Clark, Alexander and Coste, François and Miclet, Laurent. 9th International Colloquium on Grammatical Inference, Sep 2008, Saint-Malo, France. Springer, 5278, pp.15-28, 2008, Lecture Notes in Artificial Intelligence; Grammatical Inference: Algorithms and Applications. <10.1007/978-3-540-88009-7_2>. <inria-00309408v2>
  • Marco Kuhlmann, Joachim Niehren. Logics and Automata for Totally Ordered Trees. 19th International Conference on Rewriting Techniques and Applications, Jun 2008, Linz, Austria. Springer Verlag, 5117, pp.217-231, 2008, Lecture Notes in Computer Science. <inria-00610420>
  • Mathias John, Cédric Lhoussaine, Joachim Niehren, Adelinde Uhrmacher. The Attributed Pi Calculus. Springer. Computational Methods in Systems Biology, 6th International Conference CMSB, Oct 2008, Rostock, Germany. Lecture Notes in Bioinformatics, pp.83-102, 2008. <inria-00308970v4>
  • Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison. Complexity of Earliest Query Answering with Streaming Tree Automata. ACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X), Jan 2008, San Francisco, United States. 2008. <inria-00336169>
  • Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel. Adequacy of compositional translations for observational semantics. 5th IFIP International Conference on Theoretical Computer Science, Sep 2008, Milano, Italy. Springer Verlag, 273, pp.521-535, 2008, IFIP. <inria-00257279v7>
  • Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. Martin-Vide, Carlos and Otto, Friedrich and Fernau, Henning. 2nd International Conference on Language and Automata Theory and Applications, Mar 2008, Tarragona, Spain. Springer, 5196, pp.184-195, 2008, Lecture Notes in Computer Science; Language and Automata Theory and Applications. <inria-00192329v6>
  • Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer. Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. 23rd Conference on Mathematical Foundations of Programming Semantics, Apr 2007, New Orleans, United States. 173, pp.313-337, 2007, Electronic Notes in Theoretical Computer Science. <inria-00128861>
  • Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison. Polynomial Time Fragments of XPath with Variables. 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Jun 2007, Beijing, China. pp.205-214, 2007. <inria-00135678>
  • Céline Kuttler, Cédric Lhoussaine, Joachim Niehren. A Stochastic Pi Calculus for Concurrent Objects. Second International Conference on Algebraic Biology, Jul 2007, Linz, Austria. SV, 4545, pp.232-246, 2007. <inria-00121104v3>
  • Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison. Composing Monadic Queries in Trees. Giuseppe Castagna and Mukund Raghavachari. PLAN-X, 2006, Unknown, Unknown or Invalid Region. BRICS, Department of Computer Science, University of Aarhus, pp.61-70, 2006, <10.1007/978-3-319-04939-7_13>. <hal-01196266>
  • Aurélien Lemay, Joachim Niehren, Rémi Gilleron. Learning n-ary Node Selecting Tree Transducers from Completely Annotated Examples. 8th International Colloquium on Grammatical Inference, Sep 2006, Tokyo, Japan. Springer Verlag, 4201, pp.253-267, 2006, Lecture Notes in Artificial Intelligence. <inria-00088077v2>
  • Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison. N-ary Queries by Tree Automata. Gavin M. Bierman and Christoph Koch. 10th International Symposium on Database Programming Languages, 2005, Trondheim, Norway. Springer, 3774, pp.217--231, 2005, Lecture Notes in Computer Science. <inria-00536522>
  • Joachim Niehren, Mateu Villaret. Describing Lambda Terms in Context Unification. Philippe Blache, Edward P. Stabler, Joan Busquets and Richard Moot. 5th International Conference on Logical Aspects in Computational Linguistics, 2005, Bordeaux, France. Springer, 3492, pp.221-237, 2005, Lecture Notes in Computer Science. <inria-00536524>
  • Jordi Levy, Joachim Niehren, Mateu Villaret. Well-nested Context Unification. Robert Nieuwenhuis. 20th International Conference on Automated Deduction, 2005, Tallinn, Estonia. Springer, 3632, pp.149-163, 2005, Lecture Notes in Computer Science. <inria-00536525>
  • Wim Martens, Joachim Niehren. Minimizing Tree Automata for Unranked Trees. Gavin M. Bierman and Christoph Koch. 10th International Symposium on Database Programming Languages, 2005, Trondheim, Norway. Springer, 3774, pp.232--246, 2005, Lecture Notes in Computer Science. <inria-00536521>
  • Joachim Niehren, Tim Priesnitz, Zhendong Su. Complexity of Subtype Satisfiability over Posets. Shmuel Sagiv. 14th European Symposium on Programming, 2005, Edinburgh, United Kingdom. Springer, 3444, pp.357-373, 2005, Lecture Notes in Computer Science. <inria-00536523>
  • Julien Carme, Aurélien Lemay, Joachim Niehren. Learning Node Selecting Tree Transducer from Completely Annotated Examples. Georgios Paliouras and Yasubumi Sakakibara. 7th International Colloquium on Grammatical Inference, 2004, Athens, Greece. Springer, 3264, pp.91--102, 2004, Lecture Notes in Artificial Intelligence. <inria-00536528>
  • Ruth Fuchss, Alexander Koller, Joachim Niehren, Stefan Thater. Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis. 42th Meeting of the Association for Computational Linguistics, 2004, Barcelona, Spain. pp.247-254, 2004. <inria-00536532>
  • Julien Carme, Joachim Niehren, Marc Tommasi. Querying Unranked Trees with Stepwise Tree Automata. Vincent van Oostrom. 19th International Conference on Rewriting Techniques and Applications, 2004, Aachen, Georgia. Springer, 3091, pp.105--118, 2004, LNCS. <inria-00536529>
  • Ralph Debusmann, Denys Duchier, Joachim Niehren. The XDG Grammar Development Kit. Peter van Roy. 2nd International Conference on Multiparadigm Programming in , 2004, Charleroi, Belgium. Springer, 3389, pp.190--201, 2004, Lecture Notes in Artificial Intelligence. <inria-00536530>
  • Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele. A New Algorithm for Normal Dominance Constraints. J. Ian Munro. ACM-SIAM Symposium on Discrete Algorithms - SODA'2003, Jan 2004, New Orleans, Louisiana, United States. ACM Press, pp.59-67, 2004, SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. <http://portal.acm.org/citation.cfm?id=982801>. <inria-00536536>
  • Katrin Erk, Joachim Niehren. Well-Nested Parallelism Constraints for Ellipsis Resolution. 10th Conference of the European Chapter of the Association for Computational Linguistics, 2003, Budapest, Hungary. pp.115--122, 2003. <inria-00536541>
  • Joachim Niehren, Stefan Thater. Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints. 41st Meeting of the Association of Computational Linguistics (ACL), 2003, Saporo, Japan. pp.367-374, 2003. <inria-00536543>
  • Alexander Koller, Joachim Niehren, Stefan Thater. Bridging the Gap Between Underspecification Formalisms: Hole Semantics as Dominance Constraints. 10th Meeting of the European Chapter of the Association of Computational Linguistics, 2003, Budapest, Hungary. pp.195-202, 2003. <inria-00536542>
  • 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>
  • 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>
  • 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. Underspecified Beta Reduction. 39th Annual Meeting of the Association for Computational Linguistics, 2001, Toulouse, France. pp.74-81, 2001. <inria-00536805>
  • 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>
  • Joachim Niehren, Tim Priesnitz. Non-Structural Subtype Entailment in Automata Theory. Naoki Kobayashi and Benjamin C. Pierce. 4th International Symposium on Theoretical Aspects of Computer Software, 2001, Sendai, Japan. Springer, 2215, pp.360--384, 2001, Lecture Notes in Computer Science. <inria-00536514>
  • 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>
  • 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, Joachim Niehren. On Underspecified Processing of Dynamic Semantics. 18th International Conference on Computational Linguistics, 2000, Saarbrücken, Georgia. pp.460--466, 2000. <inria-00536810>
  • 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, 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>
  • 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. 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>
  • 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>
  • 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>
  • 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>
  • 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>
  • 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>
  • 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, 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>
  • 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>
  • 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. 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>
  • 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>

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

  • 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>
  • Antoine Ndione, Aurélien Lemay, Joachim Niehren. Sublinear DTD Validity. Long version of a Lata 15 paper. 2015. <hal-01187016>
  • 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. Learning Top-Down Tree Transformations with Regular Inspection. 2016. <hal-01357631>
  • Adrien Boiret, Aurélien Lemay, Joachim Niehren. A Learning Algorithm for Top-Down Tree Transducers. 2016. <hal-01357627>

Rapport3 documents

  • Anthony Lick, Joachim Niehren. Early = Earliest?. [Research Report] inria lille. 2013. <hal-00873742>
  • Pavel Labath, Joachim Niehren. A Functional Language for Hyperstreaming XSLT. [Research Report] inria lille. 2013. <hal-00806343>
  • Guillaume Bagan, Joachim Niehren. Constant Delay Enumeration for Acyclic Conjunctive Queries over X-Doublebar Structures. [Research Report] 2011. <inria-00609719>