default search action
Mutsunori Banbara
Person information
- affiliation: Nagoya University, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c26]Irumi Sugimori, Katsumi Inoue
, Hidetomo Nabeshima
ASP-Based Large Neighborhood Prioritized Search for Course Timetabling. LPNMR 2024: 57-70 - [c25]Mutsunori Banbara
On the Computational Complexity of Generalized Common Shape Puzzles. SOFSEM 2024: 55-68 - [c24]Yuya Yamada, Mutsunori Banbara
Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. WALCOM 2024: 242-256 - [i8]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) - [i7]Masato Kato, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara:
Dominating Set Reconfiguration with Answer Set Programming. CoRR abs/2408.07510 (2024) - 2023
- [c23]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 - [c22]Takehide Soh
SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks. CMSB 2023: 175-183 - [c21]Takahiro Hirate, Mutsunori Banbara
Hamiltonian Cycle Reconfiguration with Answer Set Programming. JELIA 2023: 262-277 - [c20]Yuya Yamada, Mutsunori Banbara
Recongo: Bounded Combinatorial Reconfiguration with Answer Set Programming. JELIA 2023: 278-286 - [c19]Raito Takeuchi, Mutsunori Banbara
Solving Vehicle Equipment Specification Problems with Answer Set Programming. PADL 2023: 232-249 - [i6]Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara:
On the Computational Complexity of Generalized Common Shape Puzzles. CoRR abs/2305.10749 (2023) - [i5]Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub:
Bounded Combinatorial Reconfiguration with Answer Set Programming. CoRR abs/2307.10688 (2023) - 2022
- [i4]Shin-ichi Minato, Mutsunori Banbara, Takashi Horiyama, Jun Kawahara, Ichigaku Takigawa, Yutaro Yamaguchi:
Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions. CoRR abs/2201.08118 (2022) - 2021
- [i3]Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda:
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions. CoRR abs/2110.05184 (2021)
2010 – 2019
- 2019
- [j7]Mutsunori Banbara
teaspoon : solving the curriculum-based course timetabling problems with answer set programming. Ann. Oper. Res. 275(1): 3-37 (2019) - 2017
- [j6]Takehide Soh
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) - [j5]Mutsunori Banbara
Clingcon: The next generation. Theory Pract. Log. Program. 17(4): 408-461 (2017) - [c18]Takehide Soh
Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. CP 2017: 596-614 - [c17]Mutsunori Banbara
catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming. LPNMR 2017: 265-278 - [i2]Mutsunori Banbara, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub:
Clingcon: The Next Generation. CoRR abs/1705.04569 (2017) - 2015
- [c16]Takehide Soh
A Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings. ICTAI 2015: 421-428 - [c15]Mutsunori Banbara, Martin Gebser, Katsumi Inoue
aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. LPNMR 2015: 112-126 - 2014
- [c14]Takehide Soh
Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. JELIA 2014: 684-693 - 2013
- [j4]Mutsunori Banbara
Answer set programming as a modeling language for course timetabling. Theory Pract. Log. Program. 13(4-5): 783-798 (2013) - [c13]Naoyuki Tamura
Compiling Pseudo-Boolean Constraints to SAT with Order Encoding. ICTAI 2013: 1020-1027 - [c12]Takehide Soh, Naoyuki Tamura
Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems. SAT 2013: 429-436 - [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) - 2012
- [c11]Mutsunori Banbara, Naoyuki Tamura
Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix. ICLP (Technical Communications) 2012: 86-97 - [c10]Tomoya Tanjo, Naoyuki Tamura
Azucar: A SAT-Based CSP Solver Using Compact Order Encoding - (Tool Presentation). SAT 2012: 456-462 - 2011
- [c9]Tomoya Tanjo, Naoyuki Tamura
A Compact and Efficient SAT-Encoding of Finite Domain CSP. SAT 2011: 375-376 - 2010
- [j3]Takehide Soh
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem. Fundam. Informaticae 102(3-4): 467-487 (2010) - [c8]Naoyuki Tamura
Solving Constraint Satisfaction Problems with SAT Technology. FLOPS 2010: 19-23 - [c7]Mutsunori Banbara
Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers. LPAR (Yogyakarta) 2010: 112-126
2000 – 2009
- 2009
- [j2]Naoyuki Tamura
Compiling finite linear CSP into SAT. Constraints An Int. J. 14(2): 254-272 (2009) - 2008
- [c6]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
- [j1]Katsumi Inoue
A competitive and cooperative approach to propositional satisfiability. Discret. Appl. Math. 154(16): 2291-2306 (2006) - [c5]Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara:
Compiling Finite Linear CSP into SAT. CP 2006: 590-603 - 2005
- [c4]Mutsunori Banbara
Prolog Cafe : A Prolog to Java Translator System. INAP 2005: 1-11 - 2001
- [c3]Mutsunori Banbara, Kyoung-Sun Kang, Takaharu Hirai, Naoyuki Tamura:
Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic. ICLP 2001: 315-330
1990 – 1999
- 1999
- [c2]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
- [c1]Mutsunori Banbara, Naoyuki Tamura:
Compiling Resources in a Linear Logic Programming Language. Implementation Technology for Programming Languages based on Logic 1998: 32-45
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-11-07 20:32 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: