Weighted Path Orders are Semantic Path Orders
Teppei Saito, Nao Hirokawa
Proceedings of the 14th International Symposium on Frontiers of Combining Systems, LNCS, 14279, -, 2023
Left-Linear Completion with AC Axioms Johannes Niederhauser, Nao Hirokawa, Aart Middeldorp
Proceedings of the 29th International Conference on Automated Deduction,LNCS, 14132, 401-418, 2023
Hydra Battles and AC Termination Nao Hirokawa, Aart Middeldorp
Proceedings of the 8th International Conference on Formal Structures of Computation and Deduction, Leibniz International Proceedings in Informatics, 260, 12:1-12:16, 2023
Compositional Confluence Criteria Kiraku Shintani, Nao Hirokawa
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, Leibniz International Proceedings in Informatics, 228, 28:1-28:19, 2022
Completion and Reduction Orders
Nao Hirokawa
6th International Conference on Formal Structures for Computation and Deduction (FSCD), Leibniz International Proceedings in Informatics, 195, 2:1-2:9, 2021
Abstract Completion, Formalized
Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler
Logical Methods in Computer Science (LMCS), 15, 3, 1:1-1:19, 2019
Confluence by Critical Pair Analysis Revisited
Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi
Proceedings of the 27th International Conference on Automated Deduction (CADE), Lecture Notes in Computer Science, 11716, 319-335, 2019
Cops and CoCoWeb: Infrastructure for Confluence Tools
Nao Hirokawa, Julian Nagele, Aart Middeldorp
Proceedings of the 9th International Joint Conference on Automated Reasoning (IJCAR), Lecture Notes in Artificial Intelligence, 10900, 346-353, 2018
Confluence Competition 2018 Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, Harald Zankl
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction (FSCD), Leibnitz International Proceedings in Informatics, 108, 32:1-32:5, 2018
Infinite Runs in Abstract Completion
Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction (FSCD), Leibnitz International Proceedings in Informatics, 84, 19:1-19:16, 2017
AC-KBO Revisited
Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp
Theory and Practice of Logic Programming (TPLP), 16, 2, 163-188, 2016
CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems
Kiraku Shintani, Nao Hirokawa
Proceedings of the 25th International Conference on Automated Deduction (CADE), Lecture Notes in Artificial Intelligence, 9195, 127-136, 2015
Leftmost Outermost Revisited
Nao Hirokawa, Aart Middeldorp, Georg Moser
Proceedings of the 26th International Conference on Rewriting Techniques and Applications (RTA), Leibnitz International Proceedings in Informatics, 36, 209-222, 2015
Confluence Competition 2015 Takahito Aoto, Nao Hirokawa, Julian Nagele, Naoki Nishida, Harald Zankl
Proceedings of the 25th International Conference on Automated Deduction (CADE), Lecture Notes in Artificial Intelligence, 9195, 101-104, 2015
Automated Complexity Analysis Based on Context-Sensitive Rewriting Nao Hirokawa, 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-271, 2014
AC-KBO Revisited Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp
Proceedings of the 12th International Symposium on Functional and Logic Programming (FLOPS), Lecture Notes in Computer Science, 8475, 319-335, 2014
Uncurrying for Termination and Complexity
Nao Hirokawa, Aart Middeldorp, Harald Zankl
Journal of Automated Reasoning, 50, 3, 279-315, 2013
Confluence of Non-Left-Linear TRSs via Relative Termination
Dominik Klein, Nao Hirokawa
Proceedings of the 18th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Notes in Computer Science, 7180, 258-273, 2012
Maximal Completion
Dominik Klein, Nao Hirokawa
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications (RTA), Leibnitz International Proceedings in Informatics, 10, 71-80, 2011
Uncurrying for Innermost Termination and Derivational Complexity
Harald Zankl, Nao Hirokawa, Aart Middeldorp
Proceedings of the 5th International Workshop on Higher-Order Rewriting (HOR), Electronic Proceedings in Theoretical Computer Science, 49, 46-57, 2011
Decreasing Diagrams and Relative Termination
Nao Hirokawa, Aart Middeldorp
Journal of Automated Reasoning (JAR), 47, 4, 481-501, 2011
KBO Orientability
Harald Zankl, Nao Hirokawa, Aart Middeldorp
Journal of Automated Reasoning., 43, 2, 173-201, 2009
Uncurrying for Termination Nao Hirokawa, Aart Middeldorp, Harald Zankl
Proceedings of the 15th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Lecture Notes in Computer Science, 5330, 667-681, 2008
Complexity, Graphs, and the Dependency Pair Method Nao Hirokawa, Georg Moser
Proceedings of the 15th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Lecture Notes in Computer Science, 5330, 652-666, 2008
Predictive Labeling Nao Hirokawa, Aart Middeldorp
Proceedings of the 17th International Conference on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, 4098, 313-327, 2006
Tyrolean Termination Tool Nao Hirokawa, Aart Middeldorp
Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, 3467, 175-184, 2005
Polynomial Interpretations with Negative Coefficients Nao Hirokawa, Aart Middeldorp
Proceedings of the 7th International Conference on Artificial Intelligence and Symbolic Mathematical Computation (AISC), Lecture Notes in Artificial Intelligence, 3249, 185-198, 2004
Dependency Pairs Revisited Nao Hirokawa, Aart Middeldorp
Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, 3091, 249-268, 2004
Automating the Dependency Pair Method Nao Hirokawa, Aart Middeldorp
Proceedings of the 19th International Conference on Automated Deduction (CADE), Lecture Notes in Artificial Intelligence, 2741, 32-46, 2003
Tsukuba Termination Tool Nao Hirokawa, Aart Middeldorp
Proceedings of the 14th International Conference on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, 2706, 311-320, 2003