TOP Page >  Search Result  >  Profile > Display All

Published Papers
Results per page:
Chronological sort:

 

 

Nao Hirokawa Associate Professor
School of Information Science、Intelligent Robotics Area

Results 1-20 of about 29

  • 1. Cops and CoCoWeb: Infrastructure for Confluence Tools,Nao Hirokawa, Julian Nagele, and Aart Middeldorp,Proceedings of the 9th International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence,10900,346-353,2018
  • 2. Confluence Competition 2018,Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, and Harald Zankl,Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, Leibnitz International Proceedings in Informatics,108,32:1-32:5,2018
  • 3. Infinite Runs in Abstract Completion,Nao Hirokawa, Aart Middeldorp, Christian Sternagel, and Sarah Winkler,Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, Leibnitz International Proceedings in Informatics 84,84,19:1-19:16,2017
  • 4. Confluence Competition 2015,Takahito Aoto, Nao Hirokawa, Julian Nagele, Naoki Nishida, and Harald Zankl,Proceedings of the 25th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 9195, 2015,pp.101-104
  • 5. AC-KBO Revisited,Akihisa Yamada, Sarah Winkler, Nao Hirokawa, and Aart Middeldorp,Theory and Practice of Logic Programming to appear,2015
  • 6. Leftmost Outermost Revisited,Nao Hirokawa, Aart Middeldorp, and Georg Moser,Proceedings of the 26th International Conference on Rewriting Techniques and Applications, Leibnitz International Proceedings in Informatics, 2015. to appear
  • 7. CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems,Kiraku Shintani and Nao Hirokawa,Proceedings of the 25th International Conference on Automated Deduction,2015
  • 8. A New and Formalized Proof of Abstract Completion,Nao Hirokawa, Aart Middeldorp, and Christian Sternagel,Proceedings of the 5th International Conference on Interactive Theorem Proving (ITP 2014). Lecture Notes in Computer Science,8558,292, 16,2014
  • 9. AC-KBO Revisited,Akihisa Yamada, Sarah Winkler, Nao Hirokawa, and Aart Middeldorp,Proceedings of the 12th International Symposium on Functional and Logic Programming (FLOPS 2014). Lecture Notes in Computer Science,8475,319, 17,2014
  • 10. Automated Complexity Analysis Based on Context-Sensitive Rewriting,Nao Hirokawa and Georg Moser,Proceedings of the Joint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda Calculi and Applications (RTA-TLCA 2014). Lecture Notes in Computer Science,8560,257, 15,2014
  • 11. Uncurrying for Termination and Complexity,Nao Hirokawa, Aart Middeldorp, and Harald Zankl,Journal of Automated Reasoning,50,3,279, 26
  • 12. Confluence of Non-Left-Linear TRSs via Relative Termination,Dominik Klein and Nao Hirokawa,Proceedings of the 18th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Notes in Computer Science 7180, 2012,pp. 258-273
  • 13. Uncurrying for Innermost Termination and Derivational Complexity,Harald Zankl, Nao Hirokawa, and Aart Middeldorp,Proceedings of the 5th International Workshop on Higher-Order Rewriting, Electronic Proceedings in Theoretical Computer Science,49,46, 12,2011
  • 14. Maximal Completion,Dominik Klein and Nao Hirokawa,Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, Leibnitz International Proceedings in Informatics,10,71,10,2011
  • 15. Decreasing Diagrams and Relative Termination,Nao Hirokawa and Aart Middeldorp,Journal of Automated Reasoning, 2011,47,4,pp. 481-501
  • 16. Decreasing Diagrams and Relative Termination,Nao Hirokawa and Aart Middeldorp,Proceedings of the 5th International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence,6173,487, 15,2010
  • 17. KBO Orientability,Harald Zankl, Nao Hirokawa, and Aart Middeldorp,Journal of Automated Reasoning.,43,2,173,29,2009
  • 18. Automated Complexity Analysis Based on the Dependency Pair Method,Nao Hirokawa and Georg Moser,Proceedings of the 4th International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence 5195, pp. 364-379, 2008
  • 19. Complexity, Graphs, and the Dependency Pair Method,Nao Hirokawa and Georg Moser,Proceedings of the 15th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, Lecture Notes in Computer Science 5330, 2008,pp. 652-666
  • 20. Uncurrying for Termination,Nao Hirokawa, Aart Middeldorp, and Harald Zankl,Proceedings of the 15th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, Lecture Notes in Computer Science, 2008. To appear

 1  2 Next ≫ ]