Masahiko Sakai

51 papers A 2C 2Misc 2Journal 24Unranked 20
YearRankTypeTitle / Venue / Authors
2023 — conf
8 + 8 = 4: Formalizing Time Units to Handle Symbolic Music Durations.
CMMR
Emmanouil Karystinaios, Francesco Foscarin, Florent Jacquemard, Masahiko Sakai, Satoshi Tojo, Gerhard Widmer
2023 J jnl
8+8=4: Formalizing Time Units to Handle Symbolic Music Durations.
CoRR
Emmanouil Karystinaios, Francesco Foscarin, Florent Jacquemard, Masahiko Sakai, Satoshi Tojo, Gerhard Widmer
2023 J jnl
Navit(oo)n: Open Source Mobile Robot Project for Nakanoshima Robot Challenge.
J. Robotics Mechatronics
Shunya Hara, Toshihiko Shimizu, Masayoshi Ozawa, Masahiko Sakai, Tadahiro Oyama, Julien Samuel Amar
2023 J jnl
Trash Detection Algorithm Suitable for Mobile Robots Using Improved YOLO.
J. Adv. Comput. Intell. Intell. Informatics
Ryotaro Harada, Tadahiro Oyama, Kenji Fujimoto, Toshihiko Shimizu, Masayoshi Ozawa, Julien Samuel Amar, Masahiko Sakai
2021 J jnl
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions.
CoRR
Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda
2020 — conf
ASAP: a dataset of aligned scores and performances for piano transcription.
ISMIR
Francesco Foscarin, Andrew McLeod, Philippe Rigaux, Florent Jacquemard, Masahiko Sakai
2019 — conf
A Parse-Based Framework for Coupled Rhythm Quantization and Score Structuring.
MCM
Francesco Foscarin, Florent Jacquemard, Philippe Rigaux, Masahiko Sakai
2019 J jnl
Conditions for confluence of innermost terminating term rewriting systems.
Appl. Algebra Eng. Commun. Comput.
Sayaka Ishizuki, Michio Oyamaguchi, Masahiko Sakai
2018 C conf
Transformation of Combinatorial Optimization Problems Written in Extended SQL into Constraint Problems.
PPDP
Genki Sakanashi, Masahiko Sakai
2017 — conf
Reduced Dependency Spaces for Existential Parameterised Boolean Equation Systems.
WPTE@FSCD
Yutaro Nagae, Masahiko Sakai
2017 — conf
Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers.
WPTE@FSCD
Tomohiro Sasano, Naoki Nishida, Masahiko Sakai, Tomoya Ueyama
2016 — conf
An Extension of Proof Graphs for Disjunctive Parameterised Boolean Equation Systems.
WPTE@FSCD
Yutaro Nagae, Masahiko Sakai, Hiroyuki Seki
2016 — conf
Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems.
WPTE@FSCD
Ryota Nakayama, Naoki Nishida, Masahiko Sakai
2015 J jnl
Construction of an ROBDD for a PB-Constraint in Band Form and Related Techniques for PB-Solvers.
IEICE Trans. Inf. Syst.
Masahiko Sakai, Hidetomo Nabeshima
2015 A conf
Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent.
CADE
Masahiko Sakai, Michio Oyamaguchi, Mizuhito Ogawa
2015 A conf
Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies.
CADE
Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai
2014 — ed.
First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@RTA 2014, Vienna, Austria, July 13, 2014
WPTE@RTA/TLCA
Manfred Schmidt-Schauß, Masahiko Sakai, David Sabel, Yuki Chiba
2014 — conf
Inverse Unfold Problem and Its Heuristic Solving.
WPTE@RTA/TLCA
Masanori Nagashima, Tomofumi Kato, Masahiko Sakai, Naoki Nishida
2013 — conf
On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms.
TTATT
Naoki Nishida, Masahiko Sakai, Yasuhiro Nakano
2012 J jnl
A Sound Type System for Typing Runtime Errors.
Inf. Media Technol.
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, Naoki Nishida
2012 J jnl
Determinization of conditional term rewriting systems.
Theor. Comput. Sci.
Masanori Nagashima, Masahiko Sakai, Toshiki Sakabe
2012 C conf
Improving Determinization of Grammar Programs for Program Inversion.
LOPSTR
Minami Niwa, Naoki Nishida, Masahiko Sakai
2012 J jnl
Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
Log. Methods Comput. Sci.
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
2011 — conf
Controlled Term Rewriting.
FroCoS
Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai
2011 J jnl
Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems.
Inf. Media Technol.
Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe
2011 — conf
Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity.
RTA
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
2011 J jnl
Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems
CoRR
Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui
2010 J jnl
Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs.
IEICE Trans. Inf. Syst.
Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe
2010 Misc conf
Proving Injectivity of Functions via Program Inversion in Term Rewriting.
FLOPS
Naoki Nishida, Masahiko Sakai
2010 J jnl
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent.
Inf. Process. Lett.
Masahiko Sakai, Mizuhito Ogawa
2009 J jnl
Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems.
Inf. Media Technol.
Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe
2009 J jnl
Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes.
Inf. Media Technol.
Hideto Kasuya, Masahiko Sakai, Kiyoshi Agusa
2009 J jnl
Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems.
IEICE Trans. Inf. Syst.
Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui
2009 J jnl
Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques.
IEICE Trans. Inf. Syst.
Keiichirou Kusakari, Masahiko Sakai
2008 — conf
Completion after Program Inversion of Injective Functions.
WRS@RTA
Naoki Nishida, Masahiko Sakai
2008 — conf
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems.
RTA
Yoshiharu Kojima, Masahiko Sakai
2007 — conf
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems.
WRS@RDP
Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe
2007 J jnl
Enhancing dependency pair method using strong computability in simply-typed term rewriting.
Appl. Algebra Eng. Commun. Comput.
Keiichirou Kusakari, Masahiko Sakai
2007 — conf
Undecidable Properties on Length-Two String Rewriting Systems.
WRS@RDP
Masahiko Sakai, Yi Wang
2006 — conf
Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems.
RTA
Yi Wang, Masahiko Sakai
2006 — conf
Transformation for Refining Unraveled Conditional Term Rewriting Systems.
WRS@FLoC
Naoki Nishida, Tomohiro Mizutani, Masahiko Sakai
2005 J jnl
On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems.
IEICE Trans. Inf. Syst.
Masahiko Sakai, Keiichirou Kusakari
2005 — conf
Partial Inversion of Constructor Term Rewriting Systems.
RTA
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
2005 J jnl
Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting.
IEICE Trans. Inf. Syst.
Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe
2003 — conf
Narrowing-based simulation of term rewriting systems with extra variables.
WFLP
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
2002 Misc conf
Descendants and Head Normalization of Higher-Order Rewrite Systems.
FLOPS
Hideto Kasuya, Masahiko Sakai, Kiyoshi Agusa
1998 J jnl
Semantics and Strong Sequentiality of Priority Term Rewriting Systems.
Theor. Comput. Sci.
Masahiko Sakai, Yoshihito Toyama
1997 J jnl
Algebraic specification with provision for the automatic addition of error descriptions.
Syst. Comput. Jpn.
Takeshi Hamaguchi, Masahiko Sakai, Shinichirou Yamamoto, Kiyoshi Agusa
1996 J jnl
Error description on algebraic specification and its automatic addition.
Syst. Comput. Jpn.
Takeshi Hamaguchi, Shinichirou Yamamoto, Kiyoshi Agusa, Masahiko Sakai
1996 — conf
Semantics and Strong Sequentiality of Priority Term Rewriting Systems.
RTA
Masahiko Sakai, Yoshihito Toyama
1992 J jnl
Algebraic specification and automatic generation of compilers.
Syst. Comput. Jpn.
Masahiko Sakai, Toshiki Sakabe, Yasuyoshi Inagaki