Masahiko Sakai

According to our database, Masahiko Sakai authored at least 43 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Navit(oo)n: Open Source Mobile Robot Project for Nakanoshima Robot Challenge.

Shunya Hara, Toshihiko Shimizu, Masayoshi Ozawa, Masahiko Sakai, Tadahiro Oyama, Julien Samuel Amar

J. Robotics Mechatronics, December, 2023

Trash Detection Algorithm Suitable for Mobile Robots Using Improved YOLO.

Ryotaro Harada, Tadahiro Oyama, Kenji Fujimoto, Toshihiko Shimizu, Masayoshi Ozawa, Julien Samuel Amar, Masahiko Sakai

J. Adv. Comput. Intell. Intell. Informatics, July, 2023

8+8=4: Formalizing Time Units to Handle Symbolic Music Durations.

Emmanouil Karystinaios, Francesco Foscarin, Florent Jacquemard, Masahiko Sakai, Satoshi Tojo, Gerhard Widmer

CoRR, 2023

2021

Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions.

Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda

CoRR, 2021

2020

ASAP: a dataset of aligned scores and performances for piano transcription.

Francesco Foscarin, Andrew McLeod, Philippe Rigaux, Florent Jacquemard, Masahiko Sakai

Proceedings of the 21th International Society for Music Information Retrieval Conference, 2020

2019

Conditions for confluence of innermost terminating term rewriting systems.

Sayaka Ishizuki, Michio Oyamaguchi, Masahiko Sakai

Appl. Algebra Eng. Commun. Comput., 2019

A Parse-Based Framework for Coupled Rhythm Quantization and Score Structuring.

Francesco Foscarin, Florent Jacquemard, Philippe Rigaux, Masahiko Sakai

Proceedings of the Mathematics and Computation in Music - 7th International Conference, 2019

2018

Transformation of Combinatorial Optimization Problems Written in Extended SQL into Constraint Problems.

Genki Sakanashi, Masahiko Sakai

Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

2017

Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers.

Tomohiro Sasano, Naoki Nishida, Masahiko Sakai, Tomoya Ueyama

Proceedings of the Proceedings Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2017

Reduced Dependency Spaces for Existential Parameterised Boolean Equation Systems.

Yutaro Nagae, Masahiko Sakai

Proceedings of the Proceedings Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2017

2016

Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems.

Ryota Nakayama, Naoki Nishida, Masahiko Sakai

Proceedings of the Proceedings Third International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2016

An Extension of Proof Graphs for Disjunctive Parameterised Boolean Equation Systems.

Yutaro Nagae, Masahiko Sakai, Hiroyuki Seki

Proceedings of the Proceedings Third International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2016

2015

Construction of an ROBDD for a PB-Constraint in Band Form and Related Techniques for PB-Solvers.

Masahiko Sakai, Hidetomo Nabeshima

IEICE Trans. Inf. Syst., 2015

Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent.

Masahiko Sakai, Michio Oyamaguchi, Mizuhito Ogawa

Proceedings of the Automated Deduction - CADE-25, 2015

Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies.

Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai

Proceedings of the Automated Deduction - CADE-25, 2015

2014

Inverse Unfold Problem and Its Heuristic Solving.

Masanori Nagashima, Tomofumi Kato, Masahiko Sakai, Naoki Nishida

Proceedings of the First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2014

2013

On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms.

Naoki Nishida, Masahiko Sakai, Yasuhiro Nakano

Proceedings of the Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, 2013

2012

Determinization of conditional term rewriting systems.

Masanori Nagashima, Masahiko Sakai, Toshiki Sakabe

Theor. Comput. Sci., 2012

Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity

Naoki Nishida, Masahiko Sakai, Toshiki Sakabe

Log. Methods Comput. Sci., 2012

Improving Determinization of Grammar Programs for Program Inversion.

Minami Niwa, Naoki Nishida, Masahiko Sakai

Proceedings of the Logic-Based Program Synthesis and Transformation, 2012

2011

Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity.

Naoki Nishida, Masahiko Sakai, Toshiki Sakabe

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Controlled Term Rewriting.

Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai

Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

2010

Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent.

Masahiko Sakai, Mizuhito Ogawa

Inf. Process. Lett., 2010

Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs.

Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe

IEICE Trans. Inf. Syst., 2010

Proving Injectivity of Functions via Program Inversion in Term Rewriting.

Naoki Nishida, Masahiko Sakai

Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009

Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques.

Keiichirou Kusakari, Masahiko Sakai

IEICE Trans. Inf. Syst., 2009

Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems.

Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui

IEICE Trans. Inf. Syst., 2009

2008

Completion after Program Inversion of Injective Functions.

Naoki Nishida, Masahiko Sakai

Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming, 2008

Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems.

Yoshiharu Kojima, Masahiko Sakai

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

2007

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems.

Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe

Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming, 2007

Undecidable Properties on Length-Two String Rewriting Systems.

Masahiko Sakai, Yi Wang

Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming, 2007

Enhancing dependency pair method using strong computability in simply-typed term rewriting.

Keiichirou Kusakari, Masahiko Sakai

Appl. Algebra Eng. Commun. Comput., 2007

2006

Transformation for Refining Unraveled Conditional Term Rewriting Systems.

Naoki Nishida, Tomohiro Mizutani, Masahiko Sakai

Proceedings of the Sixth International Workshop on Reduction Strategies in Rewriting and Programming, 2006

Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems.

Yi Wang, Masahiko Sakai

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2005

On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems.

Masahiko Sakai, Keiichirou Kusakari

IEICE Trans. Inf. Syst., 2005

Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting.

Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe

IEICE Trans. Inf. Syst., 2005

Partial Inversion of Constructor Term Rewriting Systems.

Naoki Nishida, Masahiko Sakai, Toshiki Sakabe

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2003

Narrowing-based simulation of term rewriting systems with extra variables.

Naoki Nishida, Masahiko Sakai, Toshiki Sakabe

Proceedings of the 12th International Workshop on Functional and Constraint Logic Programming, 2003

2002

Descendants and Head Normalization of Higher-Order Rewrite Systems.

Hideto Kasuya, Masahiko Sakai, Kiyoshi Agusa

Proceedings of the Functional and Logic Programming, 6th International Symposium, 2002

1998

Semantics and Strong Sequentiality of Priority Term Rewriting Systems.

Masahiko Sakai, Yoshihito Toyama

Theor. Comput. Sci., 1998

1997

Algebraic specification with provision for the automatic addition of error descriptions.

Takeshi Hamaguchi, Masahiko Sakai, Shinichirou Yamamoto, Kiyoshi Agusa

Syst. Comput. Jpn., 1997

1996

Error description on algebraic specification and its automatic addition.

Takeshi Hamaguchi, Shinichirou Yamamoto, Kiyoshi Agusa, Masahiko Sakai

Syst. Comput. Jpn., 1996

1992

Algebraic specification and automatic generation of compilers.

Masahiko Sakai, Toshiki Sakabe, Yasuyoshi Inagaki

Syst. Comput. Jpn., 1992