Masahiko Sakai

Publication Activity (10 Years)

Years Active: 1992-2023
Publications (10 Years): 15

Top Topics

Combinatorial Optimization

Constraint Problems

Top Venues

J. Adv. Comput. Intell. Intell. Informatics

Publications

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