default search action
Hidetomo Nabeshima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima, Masaaki Nishino, Shuhei Denzumi, Shin-ichi Minato:
International Competition on Graph Counting Algorithms 2023. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(9): 1441-1451 (2024) - [c28]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 - [c27]Irumi Sugimori
, Katsumi Inoue
ASP-Based Large Neighborhood Prioritized Search for Course Timetabling. LPNMR 2024: 57-70 - [i2]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) - 2023
- [c26]Takahiro Hirate, Mutsunori Banbara
Hamiltonian Cycle Reconfiguration with Answer Set Programming. JELIA 2023: 262-277 - [i1]Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima, Masaaki Nishino, Shuhei Denzumi, Shin-ichi Minato:
International Competition on Graph Counting Algorithms 2023. CoRR abs/2309.07381 (2023) - 2020
- [c25]Hidetomo Nabeshima, Katsumi Inoue
Reproducible Efficient Parallel SAT Solving. SAT 2020: 123-138
2010 – 2019
- 2017
- [c24]Hidetomo Nabeshima, Katsumi Inoue
Coverage-Based Clause Reduction Heuristics for CDCL Solvers. SAT 2017: 136-144 - 2015
- [j7]Masahiko Sakai
Construction of an ROBDD for a PB-Constraint in Band Form and Related Techniques for PB-Solvers. IEICE Trans. Inf. Syst. 98-D(6): 1121-1127 (2015) - [c23]Adrien Rougny, Yoshitaka Yamamoto, Hidetomo Nabeshima, Gauvain Bourgne, Anne Poupon, Katsumi Inoue, Christine Froidevaux:
Completing signaling networks by abductive reasoning with perturbation experiments. ILP (Late Breaking Papers) 2015: 95-100 - 2014
- [c22]Yoshitaka Yamamoto, Adrien Rougny
Completing SBGN-AF Networks by Logic-Based Hypothesis Finding. FMMB 2014: 165-179 - 2013
- [j6]Katsumi Inoue
Completing causal networks by meta-level abduction. Mach. Learn. 91(2): 239-277 (2013) - [c21]Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
On-the-Fly Lazy Clause Simplification Based on Binary Resolvents. ICTAI 2013: 987-995 - 2011
- [c20]Gabriel Synnaeve, Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima, Yoshitaka Kameya, Masakazu Ishihata, Taisuke Sato:
Kinetic Models and Qualitative Abstraction for Relational Learning in Systems Biology. BIOINFORMATICS 2011: 47-54 - [c19]Gabriel Synnaeve, Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima, Yoshitaka Kameya, Masakazu Ishihata, Taisuke Sato:
Discretized Kinetic Models for Abductive Reasoning in Systems Biology. BIOSTEC (Selected Papers) 2011: 141-154 - 2010
- [j5]Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
SOLAR: An automated deduction system for consequence finding. AI Commun. 23(2-3): 183-203 (2010) - [j4]Takehide Soh
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem. Fundam. Informaticae 102(3-4): 467-487 (2010) - [j3]Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa:
Solving Open Job-Shop Scheduling Problems by SAT Encoding. IEICE Trans. Inf. Syst. 93-D(8): 2316-2318 (2010) - [c18]Katsumi Inoue
Hypothesizing about Causal Networks with Positive and Negative Effects by Meta-level Abduction. ILP 2010: 114-129
2000 – 2009
- 2009
- [j2]Koji Iwanuma, Katsumi Inoue
Reconsideration of circumscriptive induction with pointwise circumscription. J. Appl. Log. 7(3): 307-317 (2009) - [c17]Koji Iwanuma, Hidetomo Nabeshima, Katsumi Inoue:
Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation. FTP 2009 - [c16]Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa:
Minimal Model Generation with Respect to an Atom Set. FTP 2009 - [c15]Katsumi Inoue, Taisuke Sato, Masakazu Ishihata, Yoshitaka Kameya, Hidetomo Nabeshima:
Evaluating Abductive Hypotheses using an EM Algorithm on BDDs. IJCAI 2009: 810-815 - [c14]Katsumi Inoue
Discovering Rules by Meta-level Abduction. ILP 2009: 49-64 - 2008
- [c13]Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue:
Complete Pruning Methods and a Practical Search Strategy for SOL. LPAR Workshops 2008 - [c12]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
Consequence finding and computing answers with defaults. J. Intell. Inf. Syst. 26(1): 41-58 (2006) - [c11]Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, Koji Iwanuma:
Lemma Reusing for SAT based Planning and Scheduling. ICAPS 2006: 103-113 - [c10]Hidetomo Nabeshima, Reiko Miyagawa, Yuki Suzuki, Koji Iwanuma:
Rapid Synthesis of Domain-Specific Web Search Engines Based on Semi-Automatic Training-Example Generation. Web Intelligence 2006: 769-772 - 2005
- [c9]Hidetomo Nabeshima, Hirohito Nozawa, Koji Iwanuma:
Effective SAT Planning by Lemma-Reusing. Artificial Intelligence and Applications 2005: 1-5 - [c8]Koji Iwanuma, Ryuichi Ishihara, Yo Takano, Hidetomo Nabeshima:
Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm. ICDM 2005: 186-193 - [c7]Koji Iwanuma, Katsumi Inoue
Upside-Down Transformation in SOL/Connection Tableaux and Its Application. ICTAC 2005: 166-179 - [c6]Katsumi Inoue, Hideyuki Bando, Hidetomo Nabeshima:
Inducing Causal Laws by Regular Inference. ILP 2005: 154-171 - 2004
- [c5]Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima:
Consequence Finding in Default Theories. FQAS 2004: 459-472 - 2003
- [c4]Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
SOLAR: A Consequence Finding System for Advanced Reasoning. TABLEAUX 2003: 257-263 - 2002
- [c3]Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue:
Effective SAT Planning by Speculative Computation. Australian Joint Conference on Artificial Intelligence 2002: 726-728 - [c2]Masayuki Umehara, Koji Iwanuma, Hidetomo Nabeshima:
A Case-Based Recognition of Semantic Structures in HTML Documents. IDEAL 2002: 141-147 - 2000
- [c1]Hidetomo Nabeshima, Katsumi Inoue
Implementing an action language using a SAT solver. ICTAI 2000: 96-103
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 22:12 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: