Lemma Reusing for SAT based Planning and Scheduling. - Hidetomo Nabeshima; Takehide Soh; Katsumi Inoue; Koji Iwanuma (ICAPS, 2006)

A competitive and cooperative approach to propositional satisfiability. - Katsumi Inoue; Takehide Soh; Seiji Ueda; Yoshito Sasaura; Mutsunori Banbara; Naoyuki Tamura (Discret. Appl. Math., 2006)

Analyzing Pathways Using ASP-Based Approaches. - Oliver Ray; Takehide Soh; Katsumi Inoue (ANB, 2010)

Identifying Necessary Reactions in Metabolic Pathways by Minimal Model Generation. - Takehide Soh; Katsumi Inoue (ECAI, 2010)

Finding Minimal Reaction Sets in Large Metabolic Pathways. - Takehide Soh; Katsumi Inoue (WCB@ICLP, 2010)

A SAT-based Method for Solving the Two-dimensional Strip Packing Problem. - Takehide Soh; Katsumi Inoue; Naoyuki Tamura; Mutsunori Banbara; Hidetomo Nabeshima (Fundam. Informaticae, 2010)

Compiling Pseudo-Boolean Constraints to SAT with Order Encoding. - Naoyuki Tamura; Mutsunori Banbara; Takehide Soh (ICTAI, 2013)

Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems. - Takehide Soh; Naoyuki Tamura; Mutsunori Banbara (SAT, 2013)

Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. - Mutsunori Banbara; Martin Gebser; Katsumi Inoue; Torsten Schaub; Takehide Soh; Naoyuki Tamura; Matthias Weise (CoRR, 2013)

Answer set programming as a modeling language for course timetabling. - Mutsunori Banbara; Takehide Soh; Naoyuki Tamura; Katsumi Inoue; Torsten Schaub (Theory Pract. Log. Program., 2013)

Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. - Takehide Soh; Daniel Le Berre; Stéphanie Roussel 001; Mutsunori Banbara; Naoyuki Tamura (JELIA, 2014)

A Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings. - Takehide Soh; Mutsunori Banbara; Naoyuki Tamura (ICTAI, 2015)

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 (LPNMR, 2015)

Implementing Efficient All Solutions SAT Solvers. - Takahisa Toda; Takehide Soh (ACM J. Exp. Algorithmics, 2016)

Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. - Takehide Soh; Mutsunori Banbara; Naoyuki Tamura; Daniel Le Berre (CP, 2017)

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 (LPNMR, 2017)

Proposal and Evaluation of Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings. - Takehide Soh; Mutsunori Banbara; Naoyuki Tamura (Int. J. Artif. Intell. Tools, 2017)

teaspoon : solving the curriculum-based course timetabling problems with answer set programming. - Mutsunori Banbara; Katsumi Inoue; Benjamin Kaufmann; Tenda Okimoto; Torsten Schaub; Takehide Soh; Naoyuki Tamura; Philipp Wanko (Ann. Oper. Res., 2019)

Core Challenge 2022: Solver and Graph Descriptions. - Takehide Soh; Yoshio Okamoto; Takehiro Ito (CoRR, 2022)

SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks. - Takehide Soh; Morgan Magnin; Daniel Le Berre; Mutsunori Banbara; Naoyuki Tamura (BIOINFORMATICS, 2023)

SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks. - Takehide Soh; Morgan Magnin; Daniel Le Berre; Mutsunori Banbara; Naoyuki Tamura (CMSB, 2023)

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. - Takehiro Ito; Jun Kawahara; Yu Nakahata; Takehide Soh; Akira Suzuki 001; Junichi Teruyama; Takahisa Toda (CPAIOR, 2023)

Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability. - Takahisa Toda; Takehiro Ito; Jun Kawahara; Takehide Soh; Akira Suzuki 001; Junichi Teruyama (ICTAI, 2023)

Hamiltonian Cycle Reconfiguration with Answer Set Programming. - Takahiro Hirate; Mutsunori Banbara; Katsumi Inoue; Xiao-Nan Lu; Hidetomo Nabeshima; Torsten Schaub; Takehide Soh; Naoyuki Tamura (JELIA, 2023)

Core Challenge 2023: Solver and Graph Descriptions. - Takehide Soh; Tomoya Tanjo; Yoshio Okamoto; Takehiro Ito (CoRR, 2023)

A Study on Production Scheduling Methods for Ready-Made Meal Industries. - Hinari Hamada; Nobutada Fujii; Shunsuke Watanabe; Takehide Soh; Ruriko Watanabe; Kohei Nakayama; Yuji Mishima; Kazuo Yoshinaga (APMS (2), 2024)

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 (KR, 2024)

ASP-Based Large Neighborhood Prioritized Search for Course Timetabling. - Irumi Sugimori; Katsumi Inoue; Hidetomo Nabeshima; Torsten Schaub; Takehide Soh; Naoyuki Tamura; Mutsunori Banbara (LPNMR, 2024)

CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract). - Takehide Soh; Tomoya Tanjo; Yoshio Okamoto; Takehiro Ito (SOCS, 2024)

Scalable Hard Instances for Independent Set Reconfiguration. - Takehide Soh; Takumu Watanabe; Jun Kawahara; Akira Suzuki 001; Takehiro Ito (SEA, 2024)

Dominating Set Reconfiguration with Answer Set Programming. - Masato Kato; Mutsunori Banbara; Torsten Schaub; Takehide Soh; Naoyuki Tamura (Theory Pract. Log. Program., 2024)

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 (SAT, 2025)

The ASP-based Nurse Scheduling System at the University of Yamanashi Hospital. - Hidetomo Nabeshima; Mutsunori Banbara; Torsten Schaub; Takehide Soh (CoRR, 2025)