Sequential Prolog Machine PEK. - Naoyuki Tamura; Koichi Wada 003; Hideo Matsuda; Yukio Kaneda; Sadao Maekawa (FGCS, 1984)

Implementing Parallel Prolog on a Multiprocessor Machine. - Naoyuki Tamura; Yukio Kaneda (SLP, 1984)

A Very Fast Prolog Complier on Multiple Architectures. - Toshiaki Kurokawa; Naoyuki Tamura; Yasuo Asakawa; Hideaki Komatsu (FJCC, 1986)

Knowledge-Based Optimization in Prolog Compiler. - Naoyuki Tamura (FJCC, 1986)

An Optimizing Prolog Compiler. - Hideaki Komatsu; Naoyuki Tamura; Yasuo Asakawa; Toshiaki Kurokawa (LP, 1986)

Sequential Prolog Machine PEK. - Yukio Kaneda; Naoyuki Tamura; Koichi Wada 003; Hideo Matsuda; Shumin Kuo; Sadao Maekawa (New Gener. Comput., 1986)

Introduction of a Package System into Prolog. - Hiroaki Etoh; Naoyuki Tamura; Yasuo Asakawa; Toshiyuki Hama; Hideaki Komatsu (LP, 1987)

Japanese-to-English Project PROTRAN & TWINTRAN. - Jirí Jelínek; Graham Wilcock; Osamu Nishida; Takehiko Yoshimi; Marco J. W. Bos; Naoyuki Tamura; H. Murakami (COLING, 1990)

Lazy Evaluation of Reference on a Packed Shared Forest without Unpacking. - Naoyuki Tamura; Marco J. W. Bos; H. Murakami; Osamu Nishida; Takehiko Yoshimi; Jirí Jelínek (Natural Language Understanding and Logic Programming Workshop, 1991)

Resource Management Method for a Compiler System of a Linear Logic Programming Language (Poster Abstract). - Naoyuki Tamura; Yukio Kaneda (JICSLP, 1996)

Compiling Resources in a Linear Logic Programming Language. - Mutsunori Banbara; Naoyuki Tamura (Implementation Technology for Programming Languages based on Logic, 1998)

Efficient Implementation of a Linear Logic Programming Language. - Joshua S. Hodas; K. M. Watkins; Naoyuki Tamura; Kyoung-Sun Kang (IJCSLP, 1998)

VSOP fuzzy numbers and their fuzzy ordering. - Kiyomitsu Horiuchi; Naoyuki Tamura (Fuzzy Sets Syst., 1998)

A Static Analysis for Classical Linear Logic Programming Language. - Kyoung-Sun Kang; Naoyuki Tamura (ICLP, 1999)

Translating a Linear Logic Programming Language into Java. - Mutsunori Banbara; Naoyuki Tamura (Parallelism and Implementation Technology for (Constraint) Logic Programming@ICLP, 1999)

A Static Analysis Method for a Classical Linear Logic Programming Language. - Kyoung-Sun Kang; Naoyuki Tamura (Parallelism and Implementation Technology for (Constraint) Logic Programming@ICLP, 1999)

lolliCop - A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic. - Joshua S. Hodas; Naoyuki Tamura (IJCAR, 2001)

Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic. - Mutsunori Banbara; Kyoung-Sun Kang; Takaharu Hirai; Naoyuki Tamura (ICLP, 2001)

Efficient Represenation of Discrete Sets for Constraint Programming. - Shuji Ohnishi; Hiroaki Tasaka; Naoyuki Tamura (CP, 2003)

Prolog Cafe : A Prolog to Java Translator System. - Mutsunori Banbara; Naoyuki Tamura; Katsumi Inoue (INAP, 2005)

Calc/Cream: OpenOffice Spreadsheet Front-End for Constraint Programming. - Naoyuki Tamura (INAP, 2005)

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

Low Cost Rendering Method for Virtual Factory Considering Interpolation of Occluded Objects. - Hiroki Takahashi; Naoyuki Tamura; Toshihiko Furue; Osamu Yoshie (J. Mobile Multimedia, 2007)

Compiling finite linear CSP into SAT. - Naoyuki Tamura; Akiko Taga; Satoshi Kitagawa; Mutsunori Banbara (Constraints An Int. J., 2009)

Solving Constraint Satisfaction Problems with SAT Technology. - Naoyuki Tamura; Tomoya Tanjo; Mutsunori Banbara (FLOPS, 2010)

Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers. - Mutsunori Banbara; Haruki Matsunaka; Naoyuki Tamura; Katsumi Inoue (LPAR (Yogyakarta), 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)

A Compact and Efficient SAT-Encoding of Finite Domain CSP. - Tomoya Tanjo; Naoyuki Tamura; Mutsunori Banbara (SAT, 2011)

Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix. - Mutsunori Banbara; Naoyuki Tamura; Katsumi Inoue (ICLP (Technical Communications), 2012)

Azucar: A SAT-Based CSP Solver Using Compact Order Encoding - (Tool Presentation). - Tomoya Tanjo; Naoyuki Tamura; Mutsunori Banbara (SAT, 2012)

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)

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)

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)

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)

Solving Vehicle Equipment Specification Problems with Answer Set Programming. - Raito Takeuchi; Mutsunori Banbara; Naoyuki Tamura; Torsten Schaub (PADL, 2023)

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)

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)