Naoyuki Tamura

55 papers A* 2A 8B 10C 2Misc 1Journal 13Unranked 19

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	A SAT-based Method for Counting All Singleton Attractors in Boolean Networks. IJCAI Rei Higuchi, Takehide Soh, Daniel Le Berre, Morgan Magnin, Mutsunori Banbara, Naoyuki Tamura
2025	A	`conf`	SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints. SAT Ryoga Ohashi, Takehide Soh, Daniel Le Berre, Hidetomo Nabeshima, Mutsunori Banbara, Katsumi Inoue, Naoyuki Tamura
2024	B	`conf`	ASP-Based Large Neighborhood Prioritized Search for Course Timetabling. LPNMR Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara
2024	J	`jnl`	Dominating Set Reconfiguration with Answer Set Programming. CoRR Masato Kato, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara
2024	J	`jnl`	Dominating Set Reconfiguration with Answer Set Programming. Theory Pract. Log. Program. Masato Kato, Mutsunori Banbara, Torsten Schaub, Takehide Soh, Naoyuki Tamura
2024	A*	`conf`	Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming. KR Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara
2024	J	`jnl`	Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming. CoRR Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara
2023	B	`conf`	Hamiltonian Cycle Reconfiguration with Answer Set Programming. JELIA Takahiro Hirate, Mutsunori Banbara, Katsumi Inoue, Xiao-Nan Lu, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura
2023	—	`conf`	SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks. CMSB Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura
2023	—	`conf`	SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks. BIOINFORMATICS Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura
2023	C	`conf`	Solving Vehicle Equipment Specification Problems with Answer Set Programming. PADL Raito Takeuchi, Mutsunori Banbara, Naoyuki Tamura, Torsten Schaub
2019	J	`jnl`	teaspoon : solving the curriculum-based course timetabling problems with answer set programming. Ann. Oper. Res. Mutsunori Banbara, Katsumi Inoue, Benjamin Kaufmann, Tenda Okimoto, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Philipp Wanko
2017	J	`jnl`	Proposal and Evaluation of Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings. Int. J. Artif. Intell. Tools Takehide Soh, Mutsunori Banbara, Naoyuki Tamura
2017	A	`conf`	Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. CP Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Daniel Le Berre
2017	B	`conf`	catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming. LPNMR Mutsunori Banbara, Katsumi Inoue, Hiromasa Kaneyuki, Tenda Okimoto, Torsten Schaub, Takehide Soh, Naoyuki Tamura
2015	B	`conf`	A Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings. ICTAI Takehide Soh, Mutsunori Banbara, Naoyuki Tamura
2015	B	`conf`	aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. LPNMR Mutsunori Banbara, Martin Gebser, Katsumi Inoue, Max Ostrowski, Andrea Peano, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Matthias Weise
2014	B	`conf`	Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. JELIA Takehide Soh, Daniel Le Berre, Stéphanie Roussel, Mutsunori Banbara, Naoyuki Tamura
2013	J	`jnl`	Answer set programming as a modeling language for course timetabling. Theory Pract. Log. Program. Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, Katsumi Inoue, Torsten Schaub
2013	J	`jnl`	Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. CoRR Mutsunori Banbara, Martin Gebser, Katsumi Inoue, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Matthias Weise
2013	B	`conf`	Compiling Pseudo-Boolean Constraints to SAT with Order Encoding. ICTAI Naoyuki Tamura, Mutsunori Banbara, Takehide Soh
2013	A	`conf`	Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems. SAT Takehide Soh, Naoyuki Tamura, Mutsunori Banbara
2012	A	`conf`	Azucar: A SAT-Based CSP Solver Using Compact Order Encoding - (Tool Presentation). SAT Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara
2012	—	`conf`	Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix. ICLP (Technical Communications) Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue
2011	A	`conf`	A Compact and Efficient SAT-Encoding of Finite Domain CSP. SAT Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara
2010	J	`jnl`	A SAT-based Method for Solving the Two-dimensional Strip Packing Problem. Fundam. Informaticae Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo Nabeshima
2010	—	`conf`	Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers. LPAR (Yogyakarta) Mutsunori Banbara, Haruki Matsunaka, Naoyuki Tamura, Katsumi Inoue
2010	Misc	`conf`	Solving Constraint Satisfaction Problems with SAT Technology. FLOPS Naoyuki Tamura, Tomoya Tanjo, Mutsunori Banbara
2009	J	`jnl`	Compiling finite linear CSP into SAT. Constraints An Int. J. Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara
2008	—	`conf`	A SAT-based Method for Solving the Two-dimensional Strip Packing Problem. RCRA Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo Nabeshima
2007	J	`jnl`	Low Cost Rendering Method for Virtual Factory Considering Interpolation of Occluded Objects. J. Mobile Multimedia Hiroki Takahashi, Naoyuki Tamura, Toshihiko Furue, Osamu Yoshie
2006	J	`jnl`	A competitive and cooperative approach to propositional satisfiability. Discret. Appl. Math. Katsumi Inoue, Takehide Soh, Seiji Ueda, Yoshito Sasaura, Mutsunori Banbara, Naoyuki Tamura
2006	A	`conf`	Compiling Finite Linear CSP into SAT. CP Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara
2006	C	`conf`	Low Cost Rendering Method for Virtual Factory Considering Interpolation of Occluded Objects. MoMM Hiroki Takahashi, Naoyuki Tamura, Toshihiko Furue, Osamu Yoshie
2005	—	`conf`	Calc/Cream: OpenOffice Spreadsheet Front-End for Constraint Programming. INAP Naoyuki Tamura
2005	—	`conf`	Prolog Cafe : A Prolog to Java Translator System. INAP Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue
2003	A	`conf`	Efficient Represenation of Discrete Sets for Constraint Programming. CP Shuji Ohnishi, Hiroaki Tasaka, Naoyuki Tamura
2001	B	`conf`	Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic. ICLP Mutsunori Banbara, Kyoung-Sun Kang, Takaharu Hirai, Naoyuki Tamura
2001	A	`conf`	lolliCop - A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic. IJCAR Joshua S. Hodas, Naoyuki Tamura
1999	—	`conf`	A Static Analysis Method for a Classical Linear Logic Programming Language. Parallelism and Implementation Technology for (Constraint) Logic Programming@ICLP Kyoung-Sun Kang, Naoyuki Tamura
1999	B	`conf`	A Static Analysis for Classical Linear Logic Programming Language. ICLP Kyoung-Sun Kang, Naoyuki Tamura
1999	—	`conf`	Translating a Linear Logic Programming Language into Java. Parallelism and Implementation Technology for (Constraint) Logic Programming@ICLP Mutsunori Banbara, Naoyuki Tamura
1998	—	`conf`	Compiling Resources in a Linear Logic Programming Language. Implementation Technology for Programming Languages based on Logic Mutsunori Banbara, Naoyuki Tamura
1998	—	`conf`	Efficient Implementation of a Linear Logic Programming Language. IJCSLP Joshua S. Hodas, K. M. Watkins, Naoyuki Tamura, Kyoung-Sun Kang
1998	J	`jnl`	VSOP fuzzy numbers and their fuzzy ordering. Fuzzy Sets Syst. Kiyomitsu Horiuchi, Naoyuki Tamura
1996	—	`conf`	Resource Management Method for a Compiler System of a Linear Logic Programming Language (Poster Abstract). JICSLP Naoyuki Tamura, Yukio Kaneda
1991	—	`conf`	Lazy Evaluation of Reference on a Packed Shared Forest without Unpacking. Natural Language Understanding and Logic Programming Workshop Naoyuki Tamura, Marco J. W. Bos, H. Murakami, Osamu Nishida, Takehiko Yoshimi, Jirí Jelínek
1990	B	`conf`	Japanese-to-English Project PROTRAN & TWINTRAN. COLING Jirí Jelínek, Graham Wilcock, Osamu Nishida, Takehiko Yoshimi, Marco J. W. Bos, Naoyuki Tamura, H. Murakami
1987	—	`conf`	Introduction of a Package System into Prolog. LP Hiroaki Etoh, Naoyuki Tamura, Yasuo Asakawa, Toshiyuki Hama, Hideaki Komatsu
1986	—	`conf`	A Very Fast Prolog Complier on Multiple Architectures. FJCC Toshiaki Kurokawa, Naoyuki Tamura, Yasuo Asakawa, Hideaki Komatsu
1986	—	`conf`	An Optimizing Prolog Compiler. LP Hideaki Komatsu, Naoyuki Tamura, Yasuo Asakawa, Toshiaki Kurokawa
1986	—	`conf`	Knowledge-Based Optimization in Prolog Compiler. FJCC Naoyuki Tamura
1986	J	`jnl`	Sequential Prolog Machine PEK. New Gener. Comput. Yukio Kaneda, Naoyuki Tamura, Koichi Wada, Hideo Matsuda, Shumin Kuo, Sadao Maekawa
1984	—	`conf`	Implementing Parallel Prolog on a Multiprocessor Machine. SLP Naoyuki Tamura, Yukio Kaneda
1984	—	`conf`	Sequential Prolog Machine PEK. FGCS Naoyuki Tamura, Koichi Wada, Hideo Matsuda, Yukio Kaneda, Sadao Maekawa