| 2026 | CPM | The Smallest String Attractors of Fibonacci and Period-Doubling Words. | Mutsunori Banbara, Hideo Bannai, Peaker Guo, Dominik Kppl, Takuya Mieno, Yoshio Okamoto |
| 2026 | KR | Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis. | Mutsunori Banbara, Hideo Bannai, Takashi Horiyama, Dominik Kppl, Takuya Mieno, Hidetomo Nabeshima |
| 2026 | KR | SRIP: A SAT-based System for Independent Set Reconfiguration. | Takehide Soh, Akifumi Kuwahara, Mutsunori Banbara, Naoyuki Tamura, Yasuaki Kobayashi, Yuta Nozaki, Takehiro Ito |
| 2025 | ECAI | Multi-Objective Combinatorial Reconfiguration Considering Cost and Length by Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. | Kazuki Takada, Mutsunori Banbara, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Torsten Schaub, Ryuhei Uehara |
| 2025 | IJCAI | A SAT-based Method for Counting All Singleton Attractors in Boolean Networks. | Rei Higuchi, Takehide Soh, Daniel Le Berre, Morgan Magnin, Mutsunori Banbara, Naoyuki Tamura |
| 2025 | SAT | SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints. | Ryoga Ohashi, Takehide Soh, Daniel Le Berre, Hidetomo Nabeshima, Mutsunori Banbara, Katsumi Inoue, Naoyuki Tamura |
| 2024 | KR | Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming. | Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara |
| 2024 | LPNMR | ASP-Based Large Neighborhood Prioritized Search for Course Timetabling. | Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara |
| 2024 | SOFSEM | On the Computational Complexity of Generalized Common Shape Puzzles. | Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara |
| 2024 | WALCOM | Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. | Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara |
| 2023 | JELIA | Hamiltonian Cycle Reconfiguration with Answer Set Programming. | Takahiro Hirate, Mutsunori Banbara, Katsumi Inoue, Xiao-Nan Lu, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura |
| 2023 | JELIA | Recongo: Bounded Combinatorial Reconfiguration with Answer Set Programming. | Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub |
| 2023 | PADL | Solving Vehicle Equipment Specification Problems with Answer Set Programming. | Raito Takeuchi, Mutsunori Banbara, Naoyuki Tamura, Torsten Schaub |
| 2017 | CP | Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. | Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Daniel Le Berre |
| 2017 | LPNMR | catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming. | Mutsunori Banbara, Katsumi Inoue, Hiromasa Kaneyuki, Tenda Okimoto, Torsten Schaub, Takehide Soh, Naoyuki Tamura |
| 2015 | ICTAI | A Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings. | Takehide Soh, Mutsunori Banbara, Naoyuki Tamura |
| 2015 | LPNMR | aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. | Mutsunori Banbara, Martin Gebser, Katsumi Inoue, Max Ostrowski, Andrea Peano, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Matthias Weise |
| 2014 | JELIA | Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. | Takehide Soh, Daniel Le Berre, Stphanie Roussel, Mutsunori Banbara, Naoyuki Tamura |
| 2013 | ICTAI | Compiling Pseudo-Boolean Constraints to SAT with Order Encoding. | Naoyuki Tamura, Mutsunori Banbara, Takehide Soh |
| 2013 | SAT | Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems. | Takehide Soh, Naoyuki Tamura, Mutsunori Banbara |
| 2012 | ICLP | Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix. | Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue |
| 2012 | SAT | Azucar: A SAT-Based CSP Solver Using Compact Order Encoding - (Tool Presentation). | Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara |
| 2011 | SAT | A Compact and Efficient SAT-Encoding of Finite Domain CSP. | Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara |
| 2010 | FLOPS | Solving Constraint Satisfaction Problems with SAT Technology. | Naoyuki Tamura, Tomoya Tanjo, Mutsunori Banbara |
| 2010 | LPAR | Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers. | Mutsunori Banbara, Haruki Matsunaka, Naoyuki Tamura, Katsumi Inoue |
| 2006 | CP | Compiling Finite Linear CSP into SAT. | Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara |
| 2001 | ICLP | Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic. | Mutsunori Banbara, Kyoung-Sun Kang, Takaharu Hirai, Naoyuki Tamura |
| 1998 | ICLP | Compiling Resources in a Linear Logic Programming Language. | Mutsunori Banbara, Naoyuki Tamura |