Mutsunori Banbara's Web Page

[ in Japanese ]
Name:
Mutsunori BANBARA
Degree:
2002, Dr.Eng,, Kobe University
Position/Affiliation:
Associate Professor,
Information Science and Technology Center,
Kobe University, Japan
E-mail:
Contact address:
1-1, Rokko-dai, Nada, Kobe, Hyogo 657-8501 Japan
Link:
CSPASP, CSPSAT, DBLP, Google Scholar Citations

Berlin 2013

Recent Topics

  • I received a Best Teacher Special Award for Liberal Arts Education (March 2016) from Institute for Promotion of Higher Education, Kobe University.
  • I received the 20th Research Paper Award (FY 2015) from Japan Society for Software Science and Technology.
    Constraint Modeling and SAT Encoding of the Packing Array Problem (in Japanese). Computer Software, 31(1):116-130, 2014.
  • I received a Best Teacher Award for Liberal Arts Education (the first semester, 2015) from Institute for Promotion of Higher Education, Kobe University.
  • I received a Best Teacher Award for Liberal Arts Education (the first semester, 2013) from Institute for Promotion of Higher Education, Kobe University.
  • I received a Best Teacher Award for Liberal Arts Education (the first semester, 2012) from Institute for Promotion of Higher Education, Kobe University.
  • I received a 2012 Kobe University President Award.
  • ShinMaxSAT was ranked 2nd at Seventh Max-SAT Evaluation (Max-SAT 2012) on Partial Weighted Max-SAT category (Crafted).
  • I received a Best Teacher Award for Liberal Arts Education (the first semester, 2011) from Institute for Promotion of Higher Education, Kobe University.
  • I received a Best Teacher Award for Liberal Arts Education (the first semester, 2010) from Institute for Promotion of Higher Education, Kobe University.
  • Sugar was ranked 1st at Fourth International CSP Solver Competition (2009) on 3 categories out of 7 categories.
  • Sugar was ranked 1st at Third International CSP/Max-CSP Solver Competitions (2008) on 4 categories out of 10 categories.

Research Field

  • Computer Science
  • Programming and Programming Languages
  • Artificial Intelligence
  • Constraint Satisfaction and Constraint Optimization

Research Topics

  • Logic/Constraint/Answer-Set Programming
  • CSP (Constraint Satisfaction Problem) and SAT (Propositional Satisfiability (Testing))
  • CSP/SAT/∗-SAT Solvers
  • Software Testing and Test Case Generation
  • Timetabling

Software

Current Courses

  • Foundations of Informatics (in Japanese)
  • Theory of Programming Languages and Exercises
  • Advanced Topics in Programming Languages
  • Advanced Theory of Informatics

Career

DatesCareer
July 2013 — July 2014 Visiting Researcher, University of Potsdam, Germany
April 2007 — present Associate Professor, Information Science and Technology Center, Kobe University
April 2003 — March 2007 Lecturer, Information Science and Technology Center, Kobe University
April 1998 — March 2003 Lecturer, Department of Liberal Arts, Nara National College of Technology
April 1996 — March 1998 Research Associate, Department of Liberal Arts, Nara National College of Technology

Education

DatesEducation
September 2002 Dr.Eng., Graduate School of Science and Technology, Kobe University
Dissertation title: Design and Implementation of Linear Logic Programming Languages
March 1996 Master's Degree, Department of Mathematics, Graduate School of Science and Technology, Kobe University
March 1994 Bachelor's Degree, Department of Mathematics, Faculty of of Science, Kobe University

Awards

  • Best Teacher Special Award for Liberal Arts Education (March 2016) from Institute for Promotion of Higher Education, Kobe University.
  • The 20th Research Paper Award (FY 2015). Constraint Modeling and SAT Encoding of the Packing Array Problem (in Japanese). Computer Software, 31(1):116-130, 2014. Japan Society for Software Science and Technology.
  • Best Teacher Award for Liberal Arts Education (the first semester, 2015) from Institute for Promotion of Higher Education, Kobe University.
  • 1st place at algorithm design contest of DA symposium 2015, iSugar+GlueMiniSat, Tatsuya Sako, Masahiro Kawahara, Naoyuki Tamura, Mutsunori Banbara, Takehide Soh, and Hidetomo Nabeshima.
  • 1st place at algorithm design contest of DA symposium 2014, Sugar+GlueMiniSat, Naoyuki Tamura, Mutsunori Banbara, Takehide Soh, and Hidetomo Nabeshima.
  • Best Teacher Award for Liberal Arts Education (the first semester, 2013) from Institute for Promotion of Higher Education, Kobe University.
  • Best Teacher Award for Liberal Arts Education (the first semester, 2012) from Institute for Promotion of Higher Education, Kobe University.
  • 2012 Kobe University President Award.
  • 2nd place at Seventh Max-SAT Evaluation (Max-SAT 2012) on Partial Weighted Max-SAT category (Crafted), ShinMaxSAT (co-author), Principal author: Kengo Honjo.
  • Best Teacher Award for Liberal Arts Education (the first semester, 2011) from Institute for Promotion of Higher Education, Kobe University.
  • Best Teacher Award for Liberal Arts Education (the first semester, 2010) from Institute for Promotion of Higher Education, Kobe University.
  • 1st place at Fourth International CSP Solver Competition (2009) on 3 categories out of 7 categories, Sugar (co-author), Principal author: Naoyuki Tamura.
  • 1st place at Third International CSP/Max-CSP Solver Competitions (2008) on 4 categories out of 10 categories, Sugar (co-author), Principal author: Naoyuki Tamura.

Professional Activities

  • Member of Editorial Board, Special Issue on SAT evolution and applications, IPSJ MAGAZINE Vol.57, No.8 (August 2016).
  • Member of Program Committee, Workshop on Trends and Applications of Answer Set Programming (TAASP 2016)
  • Member of Program Committee, The 32nd International Conference on Logic Programming (ICLP 2016)
  • Member of Organizing Committee (2016 — 2017), Information Processing Society of Japan Kansai Branch
  • Member of Planning Board (2013 — 2014), Japan Society for Software Science and Technology
  • Member of Program Committee, The 21st European Conference on Artificial Intelligence (ECAI 2014)
  • Member of Program Committee, The 15th JSSST Workshop on Programming and Programming Languages (PPL 2013)
  • Member of Editorial Board, Special Issue on Software Papers, Computer Software (Journal of Japan Society for Software Science and Technology), 29(4), 2012.
  • Member of Program Committee, The 29th Annual Conference of Japan Society for Software Science and Technology (JSSST 2012)
  • Local Co-Chair, Eleventh International Symposium on Functional and Logic Programming (FLOPS 2012)
  • Member of Editorial Board, Special Issue on Software Papers, Computer Software (Journal of Japan Society for Software Science and Technology), 28(4), 2011.
  • Member of Program Committee, The 28th Annual Conference of Japan Society for Software Science and Technology (JSSST 2011)
  • Member of Planning Committee (Kansai, 2011 — 2012), Japan Society for Software Science and Technology
  • Member of Program Committee, The 13th JSSST Workshop on Programming and Programming Languages (PPL 2011)
  • Member of Editorial Board, Special Issue on Software Papers, Computer Software (Journal of Japan Society for Software Science and Technology), 27(4), 2010.
  • Member of Program Committee, The 27th Annual Conference of Japan Society for Software Science and Technology (JSSST 2010)
  • Member of Program Committee, The 11th JSSST Workshop on Programming and Programming Languages (PPL 2009)
  • Member of Local Organizing Committee, The 10th Asian Logic Conference (ALC 10)
  • Member of Editorial Board (2007 — 2012), Computer Software (Journal of Japan Society for Software Science and Technology)
  • Member of Steering Committee (2004 — 2006), Special Interest Group on Programming, Information Processing Society of Japan
  • Member of Local Organizing Committee, TAKEUTI SYMPOSIUM : Symposium on Mathematical Logic '03 (SML 2003)

Competitive Research Funds

Grants-in-Aid for Scientific Research (KAKENHI)

  • 2016 — 2018 Grants-in-Aid for Scientific Research (B), “Research and Development of a New Constraint Programming System based on SAT” (No.16H02803; Co-Investigator), Principal Investigator: Prof. Naoyuki Tamura (Kobe University)
  • 2015 — 2017 Grants-in-Aid for Scientific Research (C), “ Research and Development on Constraint Answer Set Programming Using SAT Encoding” (No.15K00099; Principal Investigator)
  • 2012 — 2014 Grants-in-Aid for Scientific Research (B), “ Realization of High-Performance and Flexible Constraint Programming Systems Using Propositional Inference Techniques” (No.24300007; Co-Investigator), Principal Investigator: Prof. Naoyuki Tamura (Kobe University)
  • 2010 — 2012 Grants-in-Aid for Young Scientists (B), “Automatic Test Case Generation for Combinatorial Testing Using Various Logical Inference Engines” (No.22700032; Principal Investigator)
  • 2008 — 2011 Grants-in-Aid for Scientific Research (A), “ Study of SAT-Based Constraint Optimization Problem Solving and Its Parallel Distributed Processing” (No.20240003; Co-Investigator), Principal Investigator: Prof. Naoyuki Tamura (Kobe University)
  • 2007 — 2009 Grants-in-Aid for Young Scientists (B), “A Prolog-Based Parallel Execution System for Multiple SAT Solvers” (No.19700025; Principal Investigator)
  • 2005 — 2007 Grants-in-Aid for Scientific Research (C), “Research on a Parallel Constraint Solver System on a Grid Computing Environment” (No.17500094; Co-Investigator), Principal Investigator: Prof. Naoyuki Tamura (Kobe University)
  • 2003 — 2005 Grants-in-Aid for Young Scientists (B), “Development of a Java-Based Next-Generation Prolog Compiler System and Its Applications” (No.15700038; Principal Investigator)
  • 2002 — 2004 Grants-in-Aid for Scientific Research(C)(2), “Research of Automated Deduction System for Linear Logic” (No.14580375; Co-Investigator), Principal Investigator: Prof. Naoyuki Tamura (Kobe University)
  • 1999 — 2000 Grants-in-Aid for Scientific Research(C)(2), “Design and System Development of a Programming Language Based on a Temporal Linear Logic” (No.11680359; Co-Investigator), Principal Investigator (1999): Prof. Naoyuki Tamura (Kobe University), Principal Investigator (2000): Prof. Makoto Takahashi (Kobe University)

Other Funds

  • 2015 NII Collaborative Research Grants, “Solving Optimal Software Component Deployment Problem in Cloud” (Co-Investigator), Principal Investigator: Prof. Naoyuki Tamura (Kobe University)
  • 2015 NII Collaborative Research Grants, “ASP-based System Verification” (Principal Investigator)
  • 2014 NII Collaborative Research Grants, “Research on High-performance Educational Timetabling Systems using SAT Technology” (Co-Investigator), Principal Investigator: Prof. Takehide Soh (Kobe University)
  • 2013 NII Collaborative Research Grants, “Research on High-performance and Hi-level Constraint ASP Solvers Using Incremental Solving” (No.12; Co-Investigator), Principal Investigator: Prof. Takehide Soh (Kobe University)
  • 2012 NII Collaborative Research Grants, “Research on Constraint Answer Set Programming Using SAT Techniques” (No.37; Principal Investigator)
  • 2011 NII Collaborative Research Grants, “Research on Constraint Answer Set Programming Using SAT Techniques” (No.35; Principal Investigator)
  • 2010 NII Collaborative Research Grants, “Research on New SAT Encoding Methods, New SAT Solvers, and Their Application to Hard Problems” (No.3; Principal Investigator)
  • 2009 NII Collaborative Research Grants, “Research on Solving Methods for Hard Constraint Optimization Problems by Enhancing SAT Encoding Techniques” (No.1; Co-Investigator), Principal Investigator: Prof. Naoyuki Tamura (Kobe University)
  • 2008 NII Collaborative Research Grants, “Research on Solving Hard Constraint Optimization Problems by Using SAT Encoding” (No.1; Co-Investigator), Principal Investigator: Prof. Naoyuki Tamura (Kobe University)
  • 2007 NII Collaborative Research Grants, “Research on Efficient Implementation of Distributed SAT Systems by Using Lemma Reusing” (No.2; Co-Investigator), Principal Investigator: Prof. Hidetomo Nabeshima (University of Yamanashi)
  • 2006 NII Collaborative Research Grants, “Research on Efficient Implementation of Distributed SAT Systems by Using Lemma Reusing” (No.4; Co-Investigator), Principal Investigator: Prof. Hidetomo Nabeshima (University of Yamanashi)
  • 2005 NII Collaborative Research Grants, “Research on Design and Realization of Distributed SAT Algorithm” (No.7; Co-Investigator), Principal Investigator: Prof. Katsumi Inoue (National Institute of Informatics)
  • 2003 IPA Funds for Exploratory Software Project (The MITOH Program), “Java Implementation of a Distributed Constraint Solving System” (No.2-9; Principal Investigator), Supervising Project Manager: Nobukuni Kino
  • 2002 IPA Funds for Exploratory Software Project (The MITOH Program), “Java Implementation of a Heterogeneous Constraint Solving System” (No.4-65; Principal Investigator), Supervising Project Manager: Nobukuni Kino

Doctoral Dissertation

Refereed Journal Papers

  1. Tatsuya Sako, Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Hidetomo Nabeshima, and Katsumi Inoue. An Incremental SAT Solving Library and its Applications (in Japanese). Computer Software (to appear)
  2. Haruki Noritake, Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, and Katsumi Inoue. Constraint Modeling and SAT Encoding of the Packing Array Problem (in Japanese). Computer Software, 31(1):116-130, 2014. DOI: 10.11309/jssst.31.1_116. The 20th Research Paper Award.
  3. Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, Katsumi Inoue and Torsten Schaub. Answer Set Programming as a Modeling Language for Course Timetabling. Theory and Practice of Logic Programming, 13(4-5):783-798, Cambridge Journals, 2013. DOI: 10.1017/S1471068413000495.
  4. Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. A compact and efficient SAT encoding of finite CSP based on a numeral system of integers (in Japanese). Computer Software, 30(1):211-230, 2013. DOI: 10.11309/jssst.30.1_211.
  5. Naoyuki Tamura, Tomoya Tanjo, and Mutsunori Banbara. Domain-Specific Language Copris for Constraint Programming in Scala (in Japanese). Computer Software, 29(4):114-129, 2012. DOI: 10.11309/jssst.29.4_114.
  6. Haruki Matsunaka, Tomoya Tanjo, Mutsunori Banbara, and Naoyuki Tamura. Generating Balanced Incomplete Block Designs by SAT Encoding (in Japanese). Transactions of the Japanese Society for Artificial Intelligence, 27(2):10-15, 2012. DOI: 10.1527/tjsai.27.10.
  7. Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara and Hidetomo Nabeshima. A SAT-Based Method for Solving the Two-dimensional Strip Packing Problem. Fundamenta Informaticae, 102(3-4):467-487, IOS Press, 2010. DOI: 10.3233/FI-2010-314.
  8. Naoyuki Tamura, Tomoya Tanjo, and Mutsunori Banbara. A SAT-Based Constraint Solver and its Performance Evaluation (in Japanese). Computer Software, 27(4):183-196, 2010. DOI: 10.11309/jssst.27.4_183.
  9. Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, and Mutsunori Banbara. Compiling finite linear CSP into SAT. CONSTRAINTS, 14(2):254-272, 2009. DOI: 10.1007/s10601-008-9061-0.
  10. Mutsunori Banbara, Naoyuki Tamura, and Katsumi Inoue. A Prolog to Java Translator System and its Application (in Japanese). Computer Software, 24(3):75-86, 2007. DOI: 10.11309/jssst.24.3_75.
  11. Katsumi Inoue, Takehide Soh, Seiji Ueda, Yoshito Sasaura, Mutsunori Banbara, and Naoyuki Tamura. A Competitive and Cooperative Approach to Propositional Satisfiability. Discrete Applied Mathematics, 154(16):2291-2306, 2006. DOI: 10.1016/j.dam.2006.04.015.
  12. Naoyuki Tamura and Mutsunori Banbara. Classical Propositional Linear Logic Theorem Prover on a Linear Logic Programming Language Compiler System (in Japanese). Computer Software, 22(1):98-103, 2005. DOI: 10.11309/jssst.22.1_98.
  13. Naoyuki Tamura and Mutsunori Banbara. LLPTTP: Theorem Prover using Compiler of a Linear Logic Programming Language (in Japanese). Computer Software, 20(5):90-96, 2003. DOI: 10.11309/jssst.20.502.
  14. Mutsunori Banbara, Kyoung-Sun Kang, and Naoyuki Tamura. An Abstract Machine for a Compiler System of a Temporal Linear Logic Programming Language (in Japanese). IPSJ Transactions on Programming, 42(SIG 11(PRO 12)):52-66, 2001. CiNii.
  15. Mutsunori Banbara, Kyoung-Sun Kang, and Naoyuki Tamura. An Abstract Machine for a Compiler System of a Linear Logic Programming Language (in Japanese). Computer Software, 18(1):39-60, 2001. DOI: 10.11309/jssst.18.195.
  16. Kyoung-Sun Kang, Mutsunori Banbara, and Naoyuki Tamura. Efficient Resource Management Model for Linear Logic Programming Languages (in Japanese). Computer Software, 18(0):138-154, 2000. DOI: 10.11309/jssst.18.138.
  17. Naoyuki Tamura, Takaharu Hirai, Hideo Yoshikawa, Kyoung-Sun Kang, and Mutsunori Banbara. Logic Programming in an Intuitionistic Temporal Linear Logic (in Japanese). IPSJ Transactions on Programming, 41(SIG 4(PRO 7)):11-23, 2000. CiNii.
  18. Kyoung-Sun Kang, Mutsunori Banbara, and Naoyuki Tamura. A Static Analysis Method for a Classical Linear Logic Programming Language (in Japanese). IPSJ Transactions on Programming, 41(SIG 4(PRO 7)):42-55, 2000. CiNii.
  19. Mutsunori Banbara, Kyoung-Sun Kang, and Naoyuki Tamura. Java Implementation of a Linear Logic Programming Language (in Japanese). IPSJ Transactions on Programming, 40(SIG 10(PRO 5)):1-16, 1999. CiNii.

Refereed Conference Papers

  1. Takehide Soh, Mutsunori Banbara, and Naoyuki Tamura. A Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings. Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2015, SAT and CSP track), pp.421-428, IEEE Computer Society, 2015. DOI: 10.1109/ICTAI.2015.70.
  2. Mutsunori Banbara, Martin Gebser, Katsumi Inoue, Max Ostrowski, Andrea Peano, Torsten Schaub, Takehide Soh, Naoyuki Tamura, and Matthias Weise. aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. In: Francesco Calimeri, Giovambattista Ianni, and Miroslaw Truszczynski (eds.), Proceedings of the 13th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2015), Lecture Notes in Artificial Intelligence, Vol.9345, pp.112-126, Springer, 2015. DOI: 10.1007/978-3-319-23264-5_10.
  3. Takehide Soh, Daniel Le Berre, Stéphanie Roussel, Mutsunori Banbara and Naoyuki Tamura. Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. In: Eduardo Fermé and Joäo Leite (eds.), Proceedings of the 14th European Conference on Logics in Artificial Intelligence (JELIA 2014), Lecture Notes in Artificial Intelligence, Vol.8761, pp.684-693, Springer, 2014. DOI: 10.1007/978-3-319-11558-0_52.
  4. Naoyuki Tamura, Mutsunori Banbara, and Takehide Soh. Compiling Pseudo-Boolean Constraints to SAT with Order Encoding. Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2013, Special Track on SAT and CSP technologies, Washington DC, USA, November 2013), pp.1020-1027, IEEE Computer Society, 2013. DOI: 10.1109/ICTAI.2013.153.
  5. Takehide Soh, Naoyuki Tamura, and Mutsunori Banbara. Scarab: A Rapid Prototyping Tool for SAT-based Constraint Programming Systems. In:Matti Järvisalo and Allen Van Gelder (eds.), Proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testing (SAT 2013), Lecture Notes in Computer Science, Vol.7962, pp.429-436, Springer, 2013. DOI: 10.1007/978-3-642-39071-5_34.
  6. Mutsunori Banbara, Naoyuki Tamura, and Katsumi Inoue. Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix. In: Agostino Dovier and Vítor Santos Costa (eds.), Technical Communications of the 28th International Conference on Logic Programming (ICLP '12), LIPIcs, Vol.17, pp.86-97, Schloss Dagstuhl, 2012. DOI: 10.4230/LIPIcs.ICLP.2012.86.
  7. Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. Azucar: A SAT-Based CSP Solver Using Compact Order Encoding — (Tool Presentation). In: Alessandro Cimatti and Roberto Sebastiani (eds.), Proceedings of the 15th International Conference on Theory and Applications of Satisfiability Testing (SAT 2012), Lecture Notes in Computer Science, Vol.7317, pp.456-462, Springer, 2012. DOI: 10.1007/978-3-642-31612-8_37.
  8. Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. A Compact and Efficient SAT-Encoding of Finite Domain CSP. In: Karem A. Sakallah and Laurent Simon (eds.), Proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing (SAT 2011), Lecture Notes in Computer Science, Vol.6695, pp.375-376, Springer, 2011. DOI: 10.1007/978-3-642-21581-0_36.
  9. Mutsunori Banbara, Haruki Matsunaka, Naoyuki Tamura, and Katsumi Inoue. Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers. In: Christian G. Fermüller and Andrei Voronkov (eds.), Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-17), Lecture Notes in Computer Science, Vol.6397, pp.112-126, Springer, 2010. DOI: 10.1007/978-3-642-16242-8_9.
  10. Naoyuki Tamura, Tomoya Tanjo and Mutsunori Banbara. Solving Constraint Satisfaction Problems with SAT Technology. In: Matthias Blume, Naoki Kobayashi, and Germán Vidal (eds.), Proceedings of the 10th International Symposium on Functional and Logic Programming (FLOPS 2010), Lecture Notes in Computer Science, Vol.6009, pp.19-23, Springer, 2010. DOI: 10.1007/978-3-642-12251-4_3.
  11. Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, and Mutsunori Banbara. Compiling Finite Linear CSP into SAT. In: Frédéric Benhamou (ed.), Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming (CP 2006), Lecture Notes in Computer Science, Vol.4204, pp.590-603, Springer, 2006. DOI: 10.1007/11889205_42.
  12. Mutsunori Banbara, Naoyuki Tamura, and Katsumi Inoue. Prolog Cafe: A Prolog to Java Translator System. In: Masanobu Umeda, Armin Wolf, Oskar Bartenstein, Ulrich Geske, Dietmar Seipel, and Osamu Takata (eds.), Declarative Programming for Knowledge Management: Revised Selected Papers from the 16th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2005), Lecture Notes in Artificial Intelligence, Vol.4369, pp.1-11, Springer, 2006. DOI: 10.1007/11963578_1.
  13. Muneyuki Kawatani, Masaya Nakagawa, Akira Shiga, Satoshi Kitagawa, Shuji Ohnishi, Mutsunori Banbara, and Naoyuki Tamura. g-Hecs: a Constraint Solving System on the Grid. In: Masanobu Umeda and Armin Wolf (eds.), Proceedings of the 16th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2005), pp.191-199, Fukuoka, Japan, October 22nd-24th, 2005.
  14. Mutsunori Banbara, Kyoung-Sun Kang, Takaharu Hirai, and Naoyuki Tamura. Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic. In: Philippe Codognet (ed.), Proceedings of the 17th International Conference on Logic Programming (ICLP 2001), Lecture Notes in Computer Science, Volume.2237, pp.315-330, Springer, 2001. DOI: 10.1007/3-540-45635-X_29.

Refereed Workshop Papers

  1. Mutsunori Banbara, Martin Gebser, Katsumi Inoue, Torsten Schaub, Takehide Soh, Naoyuki Tamura and Matthias Weise. Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. In: Michael Fink Yuliya Lierler (eds.), Proceedings of the Sixth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2013), pp.33-48, 2013.
  2. Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. Proposal of a Compact and Efficient SAT Encoding Using a Numeral System of Any Base. The First International Workshop on the Cross-Fertilization Between CSP and SAT (CSPSAT 2011), Michigan, USA, June 18th, 2011.
  3. Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. Towards a Compact and Efficient SAT-Encoding of Finite Linear CSP. The 9th International Workshop on Constraint Modelling and Reformulation (ModRef 2010), St Andrews, Scotland, UK, September 6th, 2010.
  4. Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, and Hidetomo Nabeshima. A SAT-Based Method for Solving the Two-dimensional Strip Packing Problem. In: Marco Gavanelli and Toni Mancini (eds.), Proceedings of the 15th International RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2008), No.16 (15 pages), CEUR Workshop Proceedings (CEUR-WS.org), Vol.451, 2008.
  5. Takehide Soh, Katsumi Inoue, Mutsunori Banbara, and Naoyuki Tamura. Experimental Results for Solving Job-Shop Scheduling Problems with Multiple SAT Solvers. In: Proceedings of the first International Workshop on Distributed and Speculative Constraint Processing (DSCP 2005), pp.25-38, 2005.
  6. Makoto Kikuchi, Ichiro Nagasaka, and Mutsunori Banbara. Channel Theory for User-Interactions in Constraint Satisfaction and Design. In: Barry O'Sullivan and Eugene C. Freuder (eds.), Proceedings of Third International Workshop on User-Interaction in Constraint Satisfaction, pp.56-69, 2003.
  7. Mutsunori Banbara and Naoyuki Tamura. Translating a Linear Logic Programming Language into Java. In: Inês de Castro Dutra, Vítor Santos Costa, Gopal Gupta, Enrico Pontelli, Manuel Carro, and Péter Kacsuk (eds.), Proceedings of the International Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming (in connection with ICLP '99, International Conference on Logic Programming), Electronic Notes in Theoretical Computer Science, Vol.30 Issue.3:20-45, 2000. DOI: 10.1016/S1571-0661(05)80111-2.
  8. Mutsunori Banbara and Naoyuki Tamura. Compiling Resources in a Linear Logic Programming Language. In: Konstantinos Sagonas (ed.), Proceedings of the International Workshop on Implementation Technologies for Programming Languages Based on Logic (in connection with JICSLP '98, Joint International Conference and Symposium on Logic Programming), pp.32-45, 1998.

Survey Papers

  1. Mutsunori Banbara and Hidetomo Nabeshima. SAT Evolution (in Japanese). Special Issue on SAT evolution and applications, IPSJ MAGAZINE, 57(8):704-709, 2016.
  2. Naoyuki Tamura, Takehide Soh, and Mutsunori Banbara. Satisfiability and Puzzles —How to solve problems with a SAT solver— (in Japanese). Special Issue on SAT evolution and applications, IPSJ MAGAZINE, 57(8):710-715, 2016.
  3. Naoyuki Tamura, Tomoya Tanjo, and Mutsunori Banbara. Constraint Optimization Problems and SAT Encodings (in Japanese). Journal of the Japanese Society for Artificial Intelligence, 25(1):77-85, 2010. CiNii.
  4. Mutsunori Banbara and Naoyuki Tamura. SAT-Based System Verification (in Japanese). Journal of the Japanese Society for Artificial Intelligence, 25(1):122-129, 2010. CiNii.

System Description / Tool Presentation Papers

  1. Naoyuki Tamura and Mutsunori Banbara. Intuitionistic Linear Logic Programming Language LLP and its Compiler Systems (in Japanese). Computer Software, 30(2): 83-89, 2013. DOI: 10.11309/jssst.30.2_83.
  2. Naoyuki Tamura, Tomoya Tanjo, and Mutsunori Banbara. System Description of a SAT-Based CSP Solver Sugar. In: M.R.C. van Dongen, Christophe Lecoutre, and Olivier Roussel (eds.), Proceedings of the Third International CSP Solver Competition (in conjunction with the Thirteenth International Conference on Principles and Practice of Constraint Programming (CP 2008)), pp.71-75, 2008.
  3. Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. Sugar++: A SAT-Based MAX-CSP/COP Solver. In: M.R.C. van Dongen, Christophe Lecoutre, and Olivier Roussel (eds.), Proceedings of the Third International CSP Solver Competition (in conjunction with the Thirteenth International Conference on Principles and Practice of Constraint Programming (CP 2008)), pp.77-82, 2008.
  4. Naoyuki Tamura and Mutsunori Banbara. Sugar: A CSP to SAT Translator Based on Order Encoding. In: M.R.C. van Dongen, Christophe Lecoutre, and Olivier Roussel (eds.), Proceedings of the Second International CSP Solver Competition (in conjunction with the Twelfth International Conference on Principles and Practice of Constraint Programming (CP 2006)), pp.65-69, 2006.
  5. Naoyuki Tamura and Mutsunori Banbara. Prolog Cafe: A Prolog to Java Translator System (in Japanese). Journal of the Japanese Society for Artificial Intelligence, 21(4):455-462, 2006. CiNii.

Other Publications

  1. Masahiro Kawahara, Takehide Soh, Mutsunori Banbara, and Naoyuki Tamura. Constraint Models for SAT-based Subgraph Search (in Japanese). The 30th Annual Conference of the Japanese Society for Artificial Intelligence (JSAI 2016), 1D4-OS-02a-4, The Japanese Society for Artificial Intelligence, 2016.
  2. Tatsuya Sako, Masahiro Kawahara, Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, and Hidetomo Nabeshima. Solving Numberlink by a SAT-based Constraint Solver and its Evaluation (in Japanese). The 30th Annual Conference of the Japanese Society for Artificial Intelligence (JSAI 2016), 1D4-OS-02a-3, The Japanese Society for Artificial Intelligence, 2016.
  3. Naoyuki Tamura, Katsumi Inoue, Hidetomo Nabeshima, Mutsunori Banbara, and Takehide Soh. Solving Optimal Software Component Configuration Problem in Cloud (in Japanese). SIG-FPAI-B503, pp.19-24, The Japanese Society for Artificial Intelligence, 2016.
  4. Hiromasa Kaneyuki, Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, Katsumi Inoue, and Tenda Okimoto. Test Case Generation of Constrained Combinatorial Testing with Answer Set Programming (in Japanese). The 18th JSSST Workshop on Programming and Programming Languages (PPL 2016), C1 category, Japan Society for Software Science and Technology, 2016.
  5. Maxime Clement, Tenda Okimoto, Katsumi Inoue, and Mutsunori Banbara. \Sigma-Optimal Solutions in Multi-Objective Timetabling. In: Proceedings of Joint Agent Workshops & Symposium 2015 (JAWS 2015), pp.122-127, 2015.
  6. Masahiro Kawahara, Takehide Soh, Mutsunori Banbara, and Naoyuki Tamura. Implementation and Evaluation of an Efficient Subgraph Search Tool using SAT Solvers (in Japanese). The 32st Conference of Japan Society for Software Science and Technology (JSSST 2015), PPL3-1, Japan Society for Software Science and Technology, 2015.
  7. Tatsuya Sako, Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Hidetomo Nabeshima, and Katsumi Inoue. iSugar : A SAT-based Constraint Solver Utilizing Incremental SAT Method (in Japanese). The 32st Conference of Japan Society for Software Science and Technology (JSSST 2015), PPL6-1, Japan Society for Software Science and Technology, 2015.
  8. Takehide Soh, Mutsunori Banbara, and Naoyuki Tamura. A Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings (in Japanese). The 32st Conference of Japan Society for Software Science and Technology (JSSST 2015), PPL6-3, Japan Society for Software Science and Technology, 2015.
  9. Hiromasa Kaneyuki, Mutsunori Banbara, Takehide Soh, Naoyuki Tamura and Katsumi Inoue. Applying Constraint Answer Set Programming to Combinatorial Test Case Generation Problems (in Japanese). The 29th Annual Conference of the Japanese Society for Artificial Intelligence (JSAI 2015), 2H5-OS-03b-5, The Japanese Society for Artificial Intelligence, 2015. JSAI Annual Conference Award.
  10. Takehide Soh, Mutsunori Banbara and Naoyuki Tamura. Prototyping Tool for SAT-based Constraint Programming Systems in Scala (in Japanese). The 31st Conference of Japan Society for Software Science and Technology (JSSST 2014), SOFT1-1, Japan Society for Software Science and Technology, 2014.
  11. Takehide Soh, Haruki Noritake, Mutsunori Banbara, Naoyuki Tamura and Katsumi Inoue. Studies on a Design of Constraint Answer Set Programming Systems (in Japanese). The 31st Conference of Japan Society for Software Science and Technology (JSSST 2014), PPL2-3, Japan Society for Software Science and Technology, 2014.
  12. Naoyuki Tamura, Takehide Soh, Mutsunori Banbara and Hidetomo Nabeshima. Solving Numberlink by a SAT-based Constraint Solver (in Japanese). DA Symposium 2014, DA2014-7B-2, pp.215-220, IPSJ SIG-SLDM, Information Processing Society of Japan, 2014
  13. Atsushi Sakoda, Takehide Soh, Mutsunori Banbara, and Naoyuki Tamura. Solving Post-Enrollment Course Timetabling using Cardinality Constraint and SAT Solvers (in Japanese). The 28th Annual Conference of the Japanese Society for Artificial Intelligence (JSAI 2014), 1D5-OS-11b-7, The Japanese Society for Artificial Intelligence, 2014.
  14. Takehide Soh, Daniel Le Berre, Stéphanie Roussel, Mutsunori Banbara, and Naoyuki Tamura. SAT-based CP System Scarab and its Application to Hamiltonian Cycle Problem (in Japanese). The 28th Annual Conference of the Japanese Society for Artificial Intelligence (JSAI 2014), 1D5-OS-11b-6in, The Japanese Society for Artificial Intelligence, 2014.
  15. Haruki Noritake, Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, and Katsumi Inoue. Constraint Modeling and SAT Encoding of the Packing Array Problem (in Japanese). The 30th Conference of Japan Society for Software Science and Technology (JSSST 2013), PPL1-1, Japan Society for Software Science and Technology, 2013.
  16. Takehide Soh, Naoyuki Tamura, Mutsunori Banbara, Daniel Le Berre, and Stéphanie Roussel. Scarab: A Prototyping Tool for SAT-based Constraint Programming Systems in Scala (in Japanese). The 30th Conference of Japan Society for Software Science and Technology (JSSST 2013), PPL2-5, Japan Society for Software Science and Technology, 2013.
  17. Atsushi Sakoda, Takehide Soh, Mutsunori Banbara, and Naoyuki Tamura. Constraint Models of the Square Packing Problem and their SAT Encodings (in Japanese). The 27th Annual Conference of the Japanese Society for Artificial Intelligence (JSAI 2013), 2E5-OS-09b-1, The Japanese Society for Artificial Intelligence, 2013.
  18. Haruki Noritake, Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, and Katsumi Inoue. Constructing Packing Arrays by SAT Encoding (in Japanese). The 15th JSSST Workshop on Programming and Programming Languages (PPL 2013), C1 category, Japan Society for Software Science and Technology, 2013.
  19. Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, and Katsumi Inoue. My Bookmark: SAT Solvers (in Japanese). Journal of the Japanese Society for Artificial Intelligence, 28(2):343-348, March 2013.
  20. Naoyuki Tamura, Mutsunori Banbara, Katsutoshi Hirayama, and Takehide Soh. Report of 2012 FLOPS International Symposium (in Japanese). Computer Software, 30(1):16-19, 2013.
  21. Junko Izumi, Hiroshi Ichiji, Katsuhiko Gondow, Mitaro Namiki, Mutsunori Banbara, and Hiroshi Hosobe. Introduction to the Special Issue on Software Papers (in Japanese). Computer Software, 29(4):2, 2012.
  22. Hidetomo Nabeshima, Miyuki Koshimura, and Mutsunori Banbara. Report on SAT Competition and Max-SAT Evaluation (in Japanese). Computer Software, 29(4):9-14, 2012.
  23. Mina Suzue, Naoyuki Tamura, Mutsunori Banbara, Takehide Soh, and Itsuo Hatono. Encoding Curriculum based Course Timetabling Problems into Pseudo-Boolean Optimization Problems (in Japanese). The 29th Conference of Japan Society for Software Science and Technology (JSSST 2012), 7A-2, Japan Society for Software Science and Technology, 2012.
  24. Haruki Noritake, Mutsunori Banbara, Naoyuki Tamura, and Katsumi Inoue. Constructing Packing Arrays by SAT Encoding (in Japanese). The 26th Annual Conference of the Japanese Society for Artificial Intelligence (JSAI 2012), 1E3-OS-4-1, The Japanese Society for Artificial Intelligence, 2012.
  25. Taisuke Funakoshi, Mutsunori Banbara, and Naoyuki Tamura. Study of a SAT Encoding of Hamiltonian Cycle Problem (in Japanese). The 26th Annual Conference of the Japanese Society for Artificial Intelligence (JSAI 2012), 1E3-OS-4-2, The Japanese Society for Artificial Intelligence, 2012.
  26. Mutsunori Banbara, Katsumi Inoue, Naoyuki Tamura, Takehide Soh, and Tomoya Tanjo. Research on Constraint Answer Set Programming Using SAT Techniques (in Japanese). Overview of the Results of the 2011 NII Collaborative Research, No.35, National Institute of Informatics, 2011.
  27. Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. A Compact and Efficient SAT Encoding of Finite CSP Based on a Numeral System of Integers (in Japanese). The 28th Conference of Japan Society for Software Science and Technology (JSSST 2011), 2A-4, Japan Society for Software Science and Technology, 2011.
  28. Naoyuki Tamura, Tomoya Tanjo, and Mutsunori Banbara. A SAT-Based Constraint Solver Sugar and its Scala Interface (in Japanese). The 28th Conference of Japan Society for Software Science and Technology (JSSST 2011), 6E-3, Japan Society for Software Science and Technology, 2011.
  29. Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. A Compact and Efficient SAT Encoding of Finite CSP on Integers (in Japanese). The 25th Annual Conference of the Japanese Society for Artificial Intelligence (JSAI 2011), 3J1-OS7-1in, The Japanese Society for Artificial Intelligence, 2011.
  30. Haruki Matsunaka, Tomoya Tanjo, Mutsunori Banbara, and Naoyuki Tamura. Generating Balanced Incomplete Block Designs by SAT Encodings (in Japanese). The 25th Annual Conference of the Japanese Society for Artificial Intelligence (JSAI 2011), 3J1-OS7-2, The Japanese Society for Artificial Intelligence, 2011.
  31. Naoyuki Tamura, Tomoya Tanjo, and Mutsunori Banbara. SAT-Based Constraint Solver Sugar (in Japanese). SIG-FPAI-B004, pp.15-17, The Japanese Society for Artificial Intelligence, 2011.
  32. Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. A Compact and Efficient SAT-encoding of Finite Linear CSP (in Japanese). SIG-FPAI-B004, pp.19-24, The Japanese Society for Artificial Intelligence, 2011.
  33. Junko Izumi, Hiroshi Ichiji, Katsuhiko Gondow, Kazuyuki Shudo, Mitaro Namiki, Hiroshi Hosobe, and Mutsunori Banbara. Introduction to the Special Issue on Software Papers (in Japanese). Computer Software, 28(4):1, 2011. DOI: 10.11309/jssst.28.4_1.
  34. Mutsunori Banbara, Katsumi Inoue, Naoyuki Tamura, Hidetomo Nabeshima, Miyuki Koshimura, Takehide Soh, and Tomoya Tanjo. Research on New SAT Encoding Methods, New SAT Solvers, and Their Application to Hard Problems (in Japanese). Overview of the Results of the 2010 NII Collaborative Research, No.3, pp.114-119, National Institute of Informatics, 2010.
  35. Junko Izumi, Hiroshi Ichiji, Kenji Kono, Katsuhiko Gondow, Masashi Toyoda, and Mutsunori Banbara. Introduction to the Special Issue on Software Papers (in Japanese). Computer Software, 27(4):1, 2010. DOI: 10.11309/jssst.27.4_1.
  36. Mutsunori Banbara, Haruki Matsunaka, Naoyuki Tamura, and Katsumi Inoue. Generating Combinatorial Test Cases by SAT Techniques (in Japanese). The 27th Conference of Japan Society for Software Science and Technology (JSSST 2010), 1B-3, Japan Society for Software Science and Technology, 2010.
  37. Naoyuki Tamura, Katsumi Inoue, Mutsunori Banbara, Hidetomo Nabeshima, Miyuki Koshimura, Takehide Soh, and Tomoya Tanjo. Research on Solving Methods for Hard Constraint Optimization Problems by Enhancing SAT Encoding Techniques (in Japanese). Overview of the Results of the 2009 NII Collaborative Research, No.1, pp.69-72, National Institute of Informatics, 2009.
  38. Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. SAT Encodings of Constraint Satisfaction Problems and their Application to Graph Coloring Problems (in Japanese). The 26th Conference of Japan Society for Software Science and Technology (JSSST 2009), 2A-1, Japan Society for Software Science and Technology, 2009.
  39. Naoyuki Tamura, Katsumi Inoue, Mutsunori Banbara, Katsutoshi Hirayama, Koji Iwanuma, Hidetomo Nabeshima, Miyuki Koshimura, and Takehide Soh. Research on Solving Hard Constraint Optimization Problems by Using SAT Encoding (in Japanese). Overview of the Results of the 2008 NII Collaborative Research, No.1, pp.163-166, National Institute of Informatics, 2008.
  40. Hidetomo Nabeshima, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Katsutoshi Hirayama, Koji Iwanuma, Takao Kawamura, Miyuki Koshimura, Satoshi Kitagawa, and Akiko Taga. Research on Efficient Implementation of Distributed SAT Systems by Using Lemma Reusing (in Japanese). Overview of the Results of the 2007 NII Collaborative Research, No.2, pp.209-213, National Institute of Informatics, 2007.
  41. Naoyuki Tamura, Akiko Taga, Mutsunori Banbara, Takehide Soh, Hidetomo Nabeshima, and Katsumi Inoue. Solving Shop Scheduling Problems by SAT Encoding (in Japanese). Proceedings of the Scheduling Symposium 2007, G1-2, pp.97-102, Scheduling Society of Japan, 2007.
  42. Akiko Taga, Naoyuki Tamura, Satoshi Kitagawa, and Mutsunori Banbara. Solving SAT-Encoded Shop Scheduling Problems on Grid Computing Environment (in Japanese). Proceedings of the Scheduling Symposium 2007, G1-4, pp.109-114, Scheduling Society of Japan, 2007.
  43. Hidetomo Nabeshima, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Katsutoshi Hirayama, Koji Iwanuma, and Takao Kawamura. Research on Efficient Implementation of Distributed SAT Systems by Using Lemma Reusing (in Japanese). Overview of the Results of the 2006 NII Collaborative Research, No.4, pp.273-278, National Institute of Informatics, 2006.
  44. Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Katsutoshi Hirayama, and Takehide Soh. Research on Design and Realization of Distributed SAT Algorithm (in Japanese). Overview of the Results of the 2005 NII Collaborative Research, No.7, pp.17-22, National Institute of Informatics, 2005.
  45. Mutsunori Banbara, Naoyuki Tamura, and Katsumi Inoue. A Prolog to Java Translator System and its Application (in Japanese). The 22nd Conference of Japan Society for Software Science and Technology (JSSST 2005), 3B-2, Japan Society for Software Science and Technology, 2005.
  46. Naoyuki Tamura and Mutsunori Banbara. Classical Propositional Linear Logic Theorem Prover on a Linear Logic Programming Language Compiler System (in Japanese). The 21st Conference of Japan Society for Software Science and Technology (JSSST 2004), 6C-2, Japan Society for Software Science and Technology, 2004.
  47. Naoyuki Tamura, Hideaki Okamoto, Shuji Ohnishi, and Mutsunori Banbara. Constraint Programming on the OpenOffice.org Calc Spreadsheet (in Japanese). Proceedings of the 2004 Annual Conference of Electronics, Information and Systems Society, pp.618-621, OS11-4, The Institute of Electrical Engineers of Japan, 2004.
  48. Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue, Takao Kawamura, and Hisashi Tamaki. Java Implementation of a Distributed Constraint Solving System (in Japanese). Report for the 2003 IPA Exploratory Software Project, 30 pages, 2004.
  49. Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue, Takao Kawamura, and Hisashi Tamaki. Java Implementation of a Distributed Constraint Solving System (in Japanese). Software Design, December 2003 issue, pp.134, Gijutsu-Hyohron Co., Ltd., 2003.
  50. Seiji Ueda, Satoshi Ukai, Katumi Inoue, Mutsunori Bandara, Naoyuki Tamura, and Takao Kawamura. Consideration on Parallel Execution of SAT Solvers (in Japanese). IEICE Technical Report. Artificial Intelligence and Knowledge-Based Processing 103(103):41-46, The Institute of Electronics, Information and Communication Engineers, 2003. CiNii.
  51. Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue, and Takao Kawamura. Java Implementation of a Heterogeneous Constraint Solving System (in Japanese). Report for the 2002 IPA Exploratory Software Project, 26 pages, 2003.
  52. Naoyuki Tamura and Mutsunori Banbara. LLPTTP: Theorem Prover using Compiler of a Linear Logic Programming Language (in Japanese). The 19th Conference of Japan Society for Software Science and Technology (JSSST 2002), 7A-4, Japan Society for Software Science and Technology, 2002.
  53. Mutsunori Banbara and Naoyuki Tamura. Java Implementation of a Linear Logic Programming Language. In: Proceedings of the Symposium on Industrial Applications of PROLOG (INAP'97), pp.56-63, Prolog Association of Japan, 1997.
  54. Mutsunori Banbara, Eiji Sugiyama, Kyoung-Sun Kang, and Naoyuki Tamura. Towards a Logic Programming Based on Linear Logic (in Japanese). In: Proceedings of the Symposium on Industrial Applications of PROLOG (INAP'95), pp.65-72, Prolog Association of Japan, 1995.

Invited Talks

  1. Mutsunori Banbara. University Course Timetabling with Answer Set Programming. The 3rd Workshop on Hybrid Reasoning for Intelligent Systems, University of Dresden, Germany, November 20, 2013.

Oral Presentations and Speeches

  1. Tatsuya Sako, Masahiro Kawahara, Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, and Hidetomo Nabeshima. An Efficient Numberlink Solver with Incremental SAT (in Japanese). The 18th JSSST Workshop on Programming and Programming Languages (PPL 2016), Japan Society for Software Science and Technology, Okayama, Japan, March 7th, 2016.
  2. Tatsuya Sako, Masahiro Kawahara, Naoyuki Tamura, Mutsunori Banbara, Takehide Soh, and Hidetomo Nabeshima. Solving the Numberlink puzzle by a SAT-based constraint solver and its optimization (in Japanese). DA Symposium 2015, ADC-2, IPSJ SIG-SLDM, Information Processing Society of Japan, Kaga, Japan, August 27th, 2015.
  3. Mutsunori Banbara. SAT-based Constraint Solver Sugar and Application to Combinatorial Designs (in Japanese). The 4th RIMS Joint Research 'Designs, Codes, Graphs and Related Areas', Research Institute for Mathematical Sciences, Kyoto University, Japan, July 9th, 2015.
  4. Takehide Soh, Mutsunori Banbara, and Naoyuki Tamura. Scarab: a Constraint Programming System with Advanced SAT Techniques (in Japanese). The 17th JSSST Workshop on Programming and Programming Languages (PPL 2015), Japan Society for Software Science and Technology, Matsuyama, Japan, March 4th, 2015.
  5. Takehide Soh, Daniel Le Berre, Stéphanie Roussel, Mutsunori Banbara and Naoyuki Tamura. Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. The 5th International Workshop on Pragmatics of SAT (PoS 2014), Vienna, Austria, July 13, 2014.
  6. Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, Katsumi Inoue, Torsten Schaub. Answer Set Programming as a Modeling Language for Course Timetabling (in Japanese). The 16th JSSST Workshop on Programming and Programming Languages (PPL 2014), Japan Society for Software Science and Technology, kumamoto, Japan, March 6th, 2014.
  7. Naoyuki Tamura, Mutsunori Banbara, and Takehide Soh. PBSugar: Compiling Pseudo-Boolean Constraints to SAT with Order Encoding. The 4th International Workshop on Pragmatics of SAT (PoS 2013), University of Helsinki, Finland, July 8, 2013.
  8. Takehide Soh, Naoyuki Tamura, Mutsunori Banbara, Daniel Le Berre, and Stéphanie Roussel. System Architecture and Implementation of a Prototyping Tool for SAT-based Constraint Programming Systems. The 4th International Workshop on Pragmatics of SAT (PoS 2013), University of Helsinki, Finland, July 8, 2013.
  9. Naoyuki Tamura, Takehide Soh, Mutsunori Banbara, and Katsumi Inoue. CSPSAT Projects and their SAT Related Tools. The 16th International Conference on Theory and Applications of Satisfiability Testing (SAT 2013), Combined tool demo and poster session, University of Helsinki, Finland, July 11, 2013.
  10. Takehide Soh, Naoyuki Tamura, and Mutsunori Banbara. Scarab: A Rapid Prototyping Tool for SAT-based Constraint Programming Systems on Scala (in Japanese). The 15th JSSST Workshop on Programming and Programming Languages (PPL 2013), Japan Society for Software Science and Technology, Aizuwakamatsu, Japan, March 5th, 2013.
  11. Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue, and Hidetomo Nabeshima. Generating Event-Sequence Test Cases by Constraint Programming and Answer Set Programming. The 2012 CRIL-NII Collaborative Meeting on Reasoning about Dynamic Constraint Networks, Université d'Artois, Lens, France, November 23th, 2012.
  12. Mutsunori Banbara. Generating Combinatorial Test Cases by SAT Techniques (in Japanese). ERATO Seminar, JST ERATO Minato Discrete Structure Manipulation System Project, Kansai Satellite Lab, Osaka, Japan, July 6th, 2012.
  13. Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. Azucar: A SAT-Based Constraint Solver Using Compact Order Encoding (in Japanese). The 14th JSSST Workshop on Programming and Programming Languages (PPL 2012), Japan Society for Software Science and Technology, Wakayama, Japan, March 8th, 2012.
  14. Mutsunori Banbara, Tomoya Tanjo, and Naoyuki Tamura. A SAT-Based Constraint Solver Sugar (in Japanese). The 11th JSSST Workshop on Programming and Programming Languages (PPL 2009), Japan Society for Software Science and Technology, Gifu, Japan, March 10th, 2009.
  15. Tomoya Tanjo, Mutsunori Banbara, and Naoyuki Tamura. Design and Implementation of a Prolog to Java Translator System (in Japanese). The 11th JSSST Workshop on Programming and Programming Languages (PPL 2009), Japan Society for Software Science and Technology, Gifu, Japan, March 10th, 2009.
  16. Hirofumi Tajima, Akiko Taga, Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. Demonstration of a SAT-Based Constraint Solving System Sugar (in Japanese). The 24th Conference of Japan Society for Software Science and Technology (JSSST 2007), PQ-6, Japan Society for Software Science and Technology, Nara Institute of Science and Technology, Japan, September 13th, 2007.
  17. Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara. Demonstration of a Prolog to Java Translator System Prolog Cafe (in Japanese). The 24th Conference of Japan Society for Software Science and Technology (JSSST 2007), PQ-7, Japan Society for Software Science and Technology, Nara Institute of Science and Technology, Japan, September 13th, 2007.
  18. Katsumi Inoue, Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, and Hidetomo Nabeshima. Multisat: A Heterogeneous SAT Solver. The Second Franco-Japanese Workshop on Constraint Programming (FJCP 2005), Le Croisic, France, November 15th, 2005.
  19. Naoyuki Tamura, Mutsunori Banbara, and Muneyuki Kawatani. g-Hecs: A Heterogeneous Constraint Solving System on the Grid. The Second Franco-Japanese Workshop on Constraint Programming (FJCP 2005), Le Croisic, France, November 16th, 2005.
  20. Akira Shiga, Masaya Nakagawa, Muneyuki Kawatani, Satoshi Kitagawa, Shuji Ohnishi, Mutsunori Banbara, and Naoyuki Tamura. A Parallel Constraint Solving System on the Grid (in Japanese). The 22nd Conference of Japan Society for Software Science and Technology (JSSST 2005), PD-2, Japan Society for Software Science and Technology, Tohoku University, Japan, September 14th, 2005.
  21. Muneyuki Kawatani, Masaya Nakagawa, Akira Shiga, Satoshi Kitagawa, Shuji Ohnishi, Mutsunori Banbara, and Naoyuki Tamura. Design of an Open Middleware for Spreadsheet Interface to Various Systems (in Japanese). The 22nd Conference of Japan Society for Software Science and Technology (JSSST 2005), PD-3, Japan Society for Software Science and Technology, Tohoku University, Japan, September 14th, 2005.
  22. Mutsunori Banbara, Shuji Ohnishi, Katsumi Inoue, and Naoyuki Tamura. Towards a Heterogeneous Constraint Solving System on the Grid. The First Franco-Japanese Workshop on Constraint Programming (FJCP 2004), Tokyo, Japan, October 25th, 2004.
  23. Kazuto Matsuda, Muneyuki Kawatani, Hideaki Okamoto, Satoshi Kitagawa, Ohnishi Shuji, Mutsunori Banbara, and Naoyuki Tamura. Towards a Constraint Solving System on the Grid (in Japanese). The 51st IPSJ-PRO Meeting, 51-1, Information Processing Society of Japan, Tokyo University, Japan, October 21st, 2004.
  24. Muneyuki Kawatani, Hideaki Okamoto, Kazuto Matsuda, Satoshi Kitagawa, Ohnishi Shuji, Mutsunori Banbara, and Naoyuki Tamura. Some Experimental Results of Two Constraint Solving Systems on the Grid (in Japanese). The 51st IPSJ-PRO Meeting, 51-2, Information Processing Society of Japan, Tokyo University, Japan, October 21st, 2004.
  25. Hideaki Okamoto, Muneyuki Kawatani, Kazuto Matsuda, Satoshi Kitagawa, Ohnishi Shuji, Mutsunori Banbara, and Naoyuki Tamura. Constraint Programming on the OpenOffice.org Calc Spreadsheet (in Japanese). The 21st Conference of Japan Society for Software Science and Technology (JSSST 2004), PD-2, Japan Society for Software Science and Technology, Tokyo Institute of Technology, Japan, September 16th, 2004.
  26. Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue, Takao Kawamura, and Hisashi Tamaki. Java Implementation of a Distributed Constraint Solving System (in Japanese). The 14th IPAX Spring 2004, No.e-3, Information-Technology Promotion Agency (IPA), Tokyo Big Sight, Japan, May 14th, 2004.
  27. Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue, Takao Kawamura, and Hisashi Tamaki. Java Implementation of a Distributed Constraint Solving System (in Japanese). The MITOH 15 Symposium, IPA Exploratory Software Project, Tokyo International Forum, Japan, February 14th, 2004.
  28. Ohnishi Shuji, Naoyuki Tamura, and Mutsunori Banbara. Efficient Representation of Discrete Sets for Constraint Programming (in Japanese). The 20th Conference of Japan Society for Software Science and Technology (JSSST 2003), Japan Society for Software Science and Technology, Aichi Prefectural University, Japan, September 18th, 2003.
  29. Mutsunori Banbara, Tsutomu Tanizawa, and Naoyuki Tamura. Demonstration of Compiler Systems for Linear Logic Programming Languages and their Applications. Workshop on Logic and Computation with the Special Intensive Lecture Series by J-Y. Girard, Keio University, Japan, February 26th, 2003.
  30. Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue, and Takao Kawamura. Java Implementation of a Heterogeneous Constraint Solving System (in Japanese). The MITOH 14 Symposium, IPA Exploratory Software Project, Tokyo International Forum, Japan, January 23rd, 2003.
  31. Mutsunori Banbara, Kyoung-Sun Kang, and Naoyuki Tamura. An Abstract Machine for a Compiler System of a Temporal Linear Logic Programming Language (in Japanese). The 33rd IPSJ-PRO Meeting, 33-8, Information Processing Society of Japan, Tokyo University, Japan, March 27th, 2001.
  32. Kyoung-Sun Kang, Mutsunori Banbara, and Naoyuki Tamura. A Static Analysis Method for a Classical Linear Logic Programming Language (in Japanese). The 26th IPSJ-PRO Meeting, 26-6, Information Processing Society of Japan, Shizuoka, Japan, October 30th, 1999.
  33. Naoyuki Tamura, Takaharu Hirai, Hideo Yoshikawa, Kyoung-Sun Kang, and Mutsunori Banbara. Logic Programming in an Intuitionistic Temporal Linear Logic (in Japanese). The 26th IPSJ-PRO Meeting, 26-2, Information Processing Society of Japan, Shizuoka, Japan, October 29th, 1999.
  34. Mutsunori Banbara, Kyoung-Sun Kang, and Naoyuki Tamura. Java Implementation of a Linear Logic Programming Language (in Japanese). The 24th IPSJ-PRO Meeting, 24-2, Tokyo, Japan, June 17th, 1999.
  35. Mutsunori Banbara, Kyoung-Sun Kang, and Naoyuki Tamura. Compiling Intuitionistic Linear Logic Programming Languages. Workshop on Linear Logic and Applications with the Special Intensive Lecture Series by J-Y. Girard, Keio University, Japan, February 26th, 1999.

A Little Bit About Me

  • Born in 1971 in Tsuyama city, Okayama prefecture, Japan. Kendo (the 3rd grade). Traditional Japanese Swimming (Shinden-ryu, the 2nd grade).

Date: 2016-06-13 21:35:33 JST