default search action
Takehide Soh
Person information
- affiliation: Kobe University, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c22]Hinari Hamada, Nobutada Fujii, Shunsuke Watanabe, Takehide Soh, Ruriko Watanabe, Kohei Nakayama, Yuji Mishima, Kazuo Yoshinaga:
A Study on Production Scheduling Methods for Ready-Made Meal Industries. APMS (2) 2024: 266-277 - [c21]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 - [c20]Irumi Sugimori
, Katsumi Inoue
ASP-Based Large Neighborhood Prioritized Search for Course Timetabling. LPNMR 2024: 57-70 - [c19]Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito:
CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract). SOCS 2024: 285-286 - [c18]Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, Takehiro Ito:
Scalable Hard Instances for Independent Set Reconfiguration. SEA 2024: 26:1-26:15 - [i7]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) - [i6]Masato Kato, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara:
Dominating Set Reconfiguration with Answer Set Programming. CoRR abs/2408.07510 (2024) - 2023
- [c17]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 - [c16]Takehide Soh
SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks. CMSB 2023: 175-183 - [c15]Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda:
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CPAIOR 2023: 167-183 - [c14]Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama:
Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability. ICTAI 2023: 294-302 - [c13]Takahiro Hirate, Mutsunori Banbara
Hamiltonian Cycle Reconfiguration with Answer Set Programming. JELIA 2023: 262-277 - [i5]Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito:
Core Challenge 2023: Solver and Graph Descriptions. CoRR abs/2310.17136 (2023) - 2022
- [i4]Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda:
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CoRR abs/2207.13959 (2022) - [i3]Takehide Soh, Yoshio Okamoto, Takehiro Ito:
Core Challenge 2022: Solver and Graph Descriptions. CoRR abs/2208.02495 (2022)
2010 – 2019
- 2019
- [j6]Mutsunori Banbara
teaspoon : solving the curriculum-based course timetabling problems with answer set programming. Ann. Oper. Res. 275(1): 3-37 (2019) - 2017
- [j5]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) - [c12]Takehide Soh
Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. CP 2017: 596-614 - [c11]Mutsunori Banbara
catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming. LPNMR 2017: 265-278 - 2016
- [j4]Takahisa Toda, Takehide Soh
Implementing Efficient All Solutions SAT Solvers. ACM J. Exp. Algorithmics 21(1): 1.12:1-1.12:44 (2016) - 2015
- [c10]Takehide Soh
A Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings. ICTAI 2015: 421-428 - [c9]Mutsunori Banbara, Martin Gebser, Katsumi Inoue
aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. LPNMR 2015: 112-126 - [i2]Takahisa Toda, Takehide Soh:
Implementing Efficient All Solutions SAT Solvers. CoRR abs/1510.00523 (2015) - 2014
- [c8]Takehide Soh
Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. JELIA 2014: 684-693 - 2013
- [j3]Mutsunori Banbara
Answer set programming as a modeling language for course timetabling. Theory Pract. Log. Program. 13(4-5): 783-798 (2013) - [c7]Naoyuki Tamura
Compiling Pseudo-Boolean Constraints to SAT with Order Encoding. ICTAI 2013: 1020-1027 - [c6]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) - 2010
- [j2]Takehide Soh
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem. Fundam. Informaticae 102(3-4): 467-487 (2010) - [c5]Oliver Ray, Takehide Soh, Katsumi Inoue
Analyzing Pathways Using ASP-Based Approaches. ANB 2010: 167-183 - [c4]Takehide Soh, Katsumi Inoue:
Identifying Necessary Reactions in Metabolic Pathways by Minimal Model Generation. ECAI 2010: 277-282 - [c3]Takehide Soh, Katsumi Inoue:
Finding Minimal Reaction Sets in Large Metabolic Pathways. WCB@ICLP 2010: 38-52
2000 – 2009
- 2008
- [c2]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) - [c1]Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, Koji Iwanuma:
Lemma Reusing for SAT based Planning and Scheduling. ICAPS 2006: 103-113
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:11 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: