 | 2011 |
|---|
| 11 |       | Tomoya Tanjo,
Naoyuki Tamura,
Mutsunori Banbara:
A Compact and Efficient SAT-Encoding of Finite Domain CSP.
SAT 2011: 375-376 |
| 2010 |
|---|
| 10 | | Naoyuki Tamura,
Tomoya Tanjo,
Mutsunori Banbara:
Solving Constraint Satisfaction Problems with SAT Technology.
FLOPS 2010: 19-23 |
| 9 | | Mutsunori Banbara,
Haruki Matsunaka,
Naoyuki Tamura,
Katsumi Inoue:
Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers.
LPAR (Yogyakarta) 2010: 112-126 |
| 8 | | Takehide Soh,
Katsumi Inoue,
Naoyuki Tamura,
Mutsunori Banbara,
Hidetomo Nabeshima:
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem.
Fundam. Inform. 102(3-4): 467-487 (2010) |
| 2009 |
|---|
| 7 | | Naoyuki Tamura,
Akiko Taga,
Satoshi Kitagawa,
Mutsunori Banbara:
Compiling finite linear CSP into SAT.
Constraints 14(2): 254-272 (2009) |
| 2006 |
|---|
| 6 | | Naoyuki Tamura,
Akiko Taga,
Satoshi Kitagawa,
Mutsunori Banbara:
Compiling Finite Linear CSP into SAT.
CP 2006: 590-603 |
| 5 | | Katsumi Inoue,
Takehide Soh,
Seiji Ueda,
Yoshito Sasaura,
Mutsunori Banbara,
Naoyuki Tamura:
A competitive and cooperative approach to propositional satisfiability.
Discrete Applied Mathematics 154(16): 2291-2306 (2006) |
| 2005 |
|---|
| 4 | | Mutsunori Banbara,
Naoyuki Tamura,
Katsumi Inoue:
Prolog Cafe : A Prolog to Java Translator System.
INAP 2005: 1-11 |
| 2001 |
|---|
| 3 | | Mutsunori Banbara,
Kyoung-Sun Kang,
Takaharu Hirai,
Naoyuki Tamura:
Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic.
ICLP 2001: 315-330 |
| 1999 |
|---|
| 2 | | Mutsunori Banbara,
Naoyuki Tamura:
Translating a Linear Logic Programming Language into Java.
Electr. Notes Theor. Comput. Sci. 30(3): 20-45 (1999) |
| 1998 |
|---|
| 1 |  | Mutsunori Banbara,
Naoyuki Tamura:
Compiling Resources in a Linear Logic Programming Language.
Implementation Technology for Programming Languages based on Logic 1998: 32-45 |
Data released under the ODC-BY 1.0 license — See also our legal information page