default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaoyuki Tamura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j9]Mutsunori Banbara
, Katsumi Inoue, Benjamin Kaufmann, Tenda Okimoto, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Philipp Wanko:
teaspoon : solving the curriculum-based course timetabling problems with answer set programming. Ann. Oper. Res. 275(1): 3-37 (2019)- 2017
- [j8]Takehide Soh, Mutsunori Banbara, Naoyuki Tamura:
Proposal and Evaluation of Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings. Int. J. Artif. Intell. Tools 26(1): 1760005:1-1760005:29 (2017) - 2013
- [j7]Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, Katsumi Inoue, Torsten Schaub:
Answer set programming as a modeling language for course timetabling. Theory Pract. Log. Program. 13(4-5): 783-798 (2013) - 2010
- [j6]Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo Nabeshima:
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem. Fundam. Informaticae 102(3-4): 467-487 (2010) - 2009
- [j5]Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara:
Compiling finite linear CSP into SAT. Constraints An Int. J. 14(2): 254-272 (2009) - 2007
- [j4]Hiroki Takahashi, Naoyuki Tamura, Toshihiko Furue, Osamu Yoshie:
Low Cost Rendering Method for Virtual Factory Considering Interpolation of Occluded Objects. J. Mobile Multimedia 3(3): 265-282 (2007) - 2006
- [j3]Katsumi Inoue, Takehide Soh, Seiji Ueda, Yoshito Sasaura, Mutsunori Banbara, Naoyuki Tamura:
A competitive and cooperative approach to propositional satisfiability. Discret. Appl. Math. 154(16): 2291-2306 (2006) - 1998
- [j2]Kiyomitsu Horiuchi, Naoyuki Tamura:
VSOP fuzzy numbers and their fuzzy ordering. Fuzzy Sets Syst. 93(2): 197-210 (1998) - 1986
- [j1]Yukio Kaneda, Naoyuki Tamura, Koichi Wada, Hideo Matsuda, Shumin Kuo, Sadao Maekawa:
Sequential Prolog Machine PEK. New Gener. Comput. 4(1): 51-66 (1986)
Conference and Workshop Papers
- 2024
- [c40]Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara:
Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming. KR 2024 - [c39]Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara:
ASP-Based Large Neighborhood Prioritized Search for Course Timetabling. LPNMR 2024: 57-70 - 2023
- [c38]Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura:
SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks. BIOINFORMATICS 2023: 163-174 - [c37]Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura:
SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks. CMSB 2023: 175-183 - [c36]Takahiro Hirate, Mutsunori Banbara, Katsumi Inoue, Xiao-Nan Lu, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura:
Hamiltonian Cycle Reconfiguration with Answer Set Programming. JELIA 2023: 262-277 - [c35]Raito Takeuchi, Mutsunori Banbara, Naoyuki Tamura, Torsten Schaub:
Solving Vehicle Equipment Specification Problems with Answer Set Programming. PADL 2023: 232-249 - 2017
- [c34]Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Daniel Le Berre:
Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. CP 2017: 596-614 - [c33]Mutsunori Banbara, Katsumi Inoue, Hiromasa Kaneyuki, Tenda Okimoto, Torsten Schaub, Takehide Soh, Naoyuki Tamura:
catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming. LPNMR 2017: 265-278 - 2015
- [c32]Takehide Soh, Mutsunori Banbara, Naoyuki Tamura:
A Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings. ICTAI 2015: 421-428 - [c31]Mutsunori Banbara, Martin Gebser, Katsumi Inoue, Max Ostrowski, Andrea Peano, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Matthias Weise:
aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. LPNMR 2015: 112-126 - 2014
- [c30]Takehide Soh, Daniel Le Berre, Stéphanie Roussel, Mutsunori Banbara, Naoyuki Tamura:
Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. JELIA 2014: 684-693 - 2013
- [c29]Naoyuki Tamura, Mutsunori Banbara, Takehide Soh:
Compiling Pseudo-Boolean Constraints to SAT with Order Encoding. ICTAI 2013: 1020-1027 - [c28]Takehide Soh, Naoyuki Tamura, Mutsunori Banbara:
Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems. SAT 2013: 429-436 - 2012
- [c27]Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue:
Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix. ICLP (Technical Communications) 2012: 86-97 - [c26]Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara:
Azucar: A SAT-Based CSP Solver Using Compact Order Encoding - (Tool Presentation). SAT 2012: 456-462 - 2011
- [c25]Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara:
A Compact and Efficient SAT-Encoding of Finite Domain CSP. SAT 2011: 375-376 - 2010
- [c24]Naoyuki Tamura, Tomoya Tanjo, Mutsunori Banbara:
Solving Constraint Satisfaction Problems with SAT Technology. FLOPS 2010: 19-23 - [c23]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 - 2008
- [c22]Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo Nabeshima:
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem. RCRA 2008 - 2006
- [c21]Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara:
Compiling Finite Linear CSP into SAT. CP 2006: 590-603 - [c20]Hiroki Takahashi, Naoyuki Tamura, Toshihiko Furue, Osamu Yoshie:
Low Cost Rendering Method for Virtual Factory Considering Interpolation of Occluded Objects. MoMM 2006: 169-178 - 2005
- [c19]Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue:
Prolog Cafe : A Prolog to Java Translator System. INAP 2005: 1-11 - [c18]Naoyuki Tamura:
Calc/Cream: OpenOffice Spreadsheet Front-End for Constraint Programming. INAP 2005: 81-87 - 2003
- [c17]Shuji Ohnishi, Hiroaki Tasaka, Naoyuki Tamura:
Efficient Represenation of Discrete Sets for Constraint Programming. CP 2003: 920-924 - 2001
- [c16]Joshua S. Hodas, Naoyuki Tamura:
lolliCop - A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic. IJCAR 2001: 670-684 - [c15]Mutsunori Banbara, Kyoung-Sun Kang, Takaharu Hirai, Naoyuki Tamura:
Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic. ICLP 2001: 315-330 - 1999
- [c14]Kyoung-Sun Kang, Naoyuki Tamura:
A Static Analysis for Classical Linear Logic Programming Language. ICLP 1999: 610 - [c13]Kyoung-Sun Kang, Naoyuki Tamura:
A Static Analysis Method for a Classical Linear Logic Programming Language. Parallelism and Implementation Technology for (Constraint) Logic Programming@ICLP 1999: 3-19 - [c12]Mutsunori Banbara, Naoyuki Tamura:
Translating a Linear Logic Programming Language into Java. Parallelism and Implementation Technology for (Constraint) Logic Programming@ICLP 1999: 20-45 - 1998
- [c11]Mutsunori Banbara, Naoyuki Tamura:
Compiling Resources in a Linear Logic Programming Language. Implementation Technology for Programming Languages based on Logic 1998: 32-45 - [c10]Joshua S. Hodas, K. M. Watkins, Naoyuki Tamura, Kyoung-Sun Kang:
Efficient Implementation of a Linear Logic Programming Language. IJCSLP 1998: 145-159 - 1996
- [c9]Naoyuki Tamura, Yukio Kaneda:
Resource Management Method for a Compiler System of a Linear Logic Programming Language (Poster Abstract). JICSLP 1996: 545 - 1991
- [c8]Naoyuki Tamura, Marco J. W. Bos, H. Murakami, Osamu Nishida, Takehiko Yoshimi, Jirí Jelínek:
Lazy Evaluation of Reference on a Packed Shared Forest without Unpacking. Natural Language Understanding and Logic Programming Workshop 1991: 13-26 - 1990
- [c7]Jirí Jelínek, Graham Wilcock, Osamu Nishida, Takehiko Yoshimi, Marco J. W. Bos, Naoyuki Tamura, H. Murakami:
Japanese-to-English Project PROTRAN & TWINTRAN. COLING 1990: 50-52 - 1987
- [c6]Hiroaki Etoh, Naoyuki Tamura, Yasuo Asakawa, Toshiyuki Hama, Hideaki Komatsu:
Introduction of a Package System into Prolog. LP 1987: 105-112 - 1986
- [c5]Naoyuki Tamura:
Knowledge-Based Optimization in Prolog Compiler. FJCC 1986: 237-240 - [c4]Toshiaki Kurokawa, Naoyuki Tamura, Yasuo Asakawa, Hideaki Komatsu:
A Very Fast Prolog Complier on Multiple Architectures. FJCC 1986: 963-968 - [c3]Hideaki Komatsu, Naoyuki Tamura, Yasuo Asakawa, Toshiaki Kurokawa:
An Optimizing Prolog Compiler. LP 1986: 104-115 - 1984
- [c2]Naoyuki Tamura, Koichi Wada, Hideo Matsuda, Yukio Kaneda, Sadao Maekawa:
Sequential Prolog Machine PEK. FGCS 1984: 542-550 - [c1]Naoyuki Tamura, Yukio Kaneda:
Implementing Parallel Prolog on a Multiprocessor Machine. SLP 1984: 42-48
Informal and Other Publications
- 2024
- [i3]Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara:
Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming. CoRR abs/2405.11305 (2024) - [i2]Masato Kato, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara:
Dominating Set Reconfiguration with Answer Set Programming. CoRR abs/2408.07510 (2024) - 2013
- [i1]Mutsunori Banbara, Martin Gebser, Katsumi Inoue, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Matthias Weise:
Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. CoRR abs/1312.6113 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-19 23:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
