| Compiling finite linear CSP into SAT N Tamura, A Taga, S Kitagawa, M Banbara Constraints 14, 254-272, 2009 | 271 | 2009 |
| Sugar: A CSP to SAT translator based on order encoding N Tamura, M Banbara Proceedings of the Second International CSP Solver Competition, 65-69, 2008 | 83 | 2008 |
| Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers M Banbara, H Matsunaka, N Tamura, K Inoue Logic for Programming, Artificial Intelligence, and Reasoning: 17th
, 2010 | 79 | 2010 |
| SAT ソルバーの基礎 (< 特集> 最近の SAT 技術の発展) 井上克巳， 田村直之 人工知能 25 (1), 57-67, 2010 | 77* | 2010 |
| Compiling finite linear CSP into SAT N Tamura, A Taga, S Kitagawa, M Banbara Principles and Practice of Constraint Programming-CP 2006: 12th
, 2006 | 71 | 2006 |
| System description of a SAT-based CSP solver Sugar N Tamura, T Tanjo, M Banbara Proceedings of the Third International CSP Solver Competition, 71-75, 2008 | 44 | 2008 |
| Translating a linear logic programming language into Java M Banbara, N Tamura Proceedings of ICLP 99, 19-39, 1999 | 43 | 1999 |
| A SAT-based method for solving the two-dimensional strip packing problem T Soh, K Inoue, N Tamura, M Banbara, H Nabeshima Fundamenta Informaticae 102 (3-4), 467-487, 2010 | 42 | 2010 |
| Answer set programming as a modeling language for course timetabling M Banbara, T Soh, N Tamura, K Inoue, T Schaub Theory and Practice of Logic Programming 13 (4-5), 783-798, 2013 | 40 | 2013 |
| 制約最適化問題と SAT 符号化 (< 特集> 最近の SAT 技術の発展) 田村直之， 丹生智也， 番原睦則 人工知能 25 (1), 77-85, 2010 | 40 | 2010 |
| A competitive and cooperative approach to propositional satisfiability K Inoue, T Soh, S Ueda, Y Sasaura, M Banbara, N Tamura Discrete Applied Mathematics 154 (16), 2291-2306, 2006 | 38 | 2006 |
| Efficient Implementation of a Linear Logic Programming Language. JS Hodas, KM Watkins, N Tamura, KS Kang IJCSLP, 145-159, 1998 | 38 | 1998 |
| : solving the curriculum-based course timetabling problems with answer set programming M Banbara, K Inoue, B Kaufmann, T Okimoto, T Schaub, T Soh, N Tamura, ... Annals of Operations Research 275, 3-37, 2019 | 36 | 2019 |
| Prolog cafe: A prolog to java translator system M Banbara, N Tamura, K Inoue International Conference on Applications of Declarative Programming and
, 2005 | 36 | 2005 |
| Extension of WAM for a linear logic programming language N Tamura, Y Kaneda Second Fuji International Workshop on Functional and Logic Programming, 33-50, 1996 | 36 | 1996 |
| A compact and efficient SAT-encoding of finite domain CSP T Tanjo, N Tamura, M Banbara International Conference on Theory and Applications of Satisfiability
, 2011 | 35 | 2011 |
| Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem T Soh, D Le Berre, S Roussel, M Banbara, N Tamura Logics in Artificial Intelligence: 14th European Conference, JELIA 2014
, 2014 | 34 | 2014 |
| Compiling pseudo-boolean constraints to SAT with order encoding N Tamura, M Banbara, T Soh 2013 IEEE 25th International Conference on Tools with Artificial
, 2013 | 34 | 2013 |
| Azucar: A SAT-Based CSP Solver Using Compact Order Encoding: (Tool Presentation) T Tanjo, N Tamura, M Banbara International Conference on Theory and Applications of Satisfiability
, 2012 | 33 | 2012 |
| Implementing Parallel Prolog on a Multiprocessor Machine. N Tamura, Y Kaneda SLP, 42-48, 1984 | 29 | 1984 |
Mutsunori BanbaraNagoya UniversityPatvirtintas el. paštas nagoya-u.jp
