Hidetomo Nabeshima

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 5

Top Topics

Answer Set Programming

Abductive Reasoning

Combinatorial Problems

Top Venues

IEICE Trans. Inf. Syst.

ILP (Late Breaking Papers)

Publications

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 (2024)
Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima, Masaaki Nishino, Shuhei Denzumi, Shin-ichi Minato
International Competition on Graph Counting Algorithms 2023. CoRR (2023)
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)
Hidetomo Nabeshima, Katsumi Inoue
Reproducible Efficient Parallel SAT Solving. SAT (2020)
Hidetomo Nabeshima, Katsumi Inoue
Coverage-Based Clause Reduction Heuristics for CDCL Solvers. SAT (2017)
Masahiko Sakai, Hidetomo Nabeshima
Construction of an ROBDD for a PB-Constraint in Band Form and Related Techniques for PB-Solvers. IEICE Trans. Inf. Syst. (6) (2015)
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)
Yoshitaka Yamamoto, Adrien Rougny, Hidetomo Nabeshima, Katsumi Inoue, Hisao Moriya, Christine Froidevaux, Koji Iwanuma
Completing SBGN-AF Networks by Logic-Based Hypothesis Finding. FMMB (2014)
Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima
Completing causal networks by meta-level abduction. Mach. Learn. 91 (2) (2013)
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
On-the-Fly Lazy Clause Simplification Based on Binary Resolvents. ICTAI (2013)
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)
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)
Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima
Hypothesizing about Causal Networks with Positive and Negative Effects by Meta-level Abduction. ILP (2010)
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) (2010)
Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa
Solving Open Job-Shop Scheduling Problems by SAT Encoding. IEICE Trans. Inf. Syst. (8) (2010)
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue, Oliver Ray
SOLAR: An automated deduction system for consequence finding. AI Commun. 23 (2-3) (2010)
Koji Iwanuma, Hidetomo Nabeshima, Katsumi Inoue
Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation. FTP (2009)
Katsumi Inoue, Koichi Furukawa, Ikuo Kobayashi, Hidetomo Nabeshima
Discovering Rules by Meta-level Abduction. ILP (2009)
Katsumi Inoue, Taisuke Sato, Masakazu Ishihata, Yoshitaka Kameya, Hidetomo Nabeshima
Evaluating Abductive Hypotheses using an EM Algorithm on BDDs. IJCAI (2009)
Koji Iwanuma, Katsumi Inoue, Hidetomo Nabeshima
Reconsideration of circumscriptive induction with pointwise circumscription. J. Appl. Log. 7 (3) (2009)
Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa
Minimal Model Generation with Respect to an Atom Set. FTP (2009)
Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo Nabeshima
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem. RCRA (2008)
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
Complete Pruning Methods and a Practical Search Strategy for SOL. LPAR Workshops (2008)
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)
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, Koji Iwanuma
Lemma Reusing for SAT based Planning and Scheduling. ICAPS (2006)
Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima
Consequence finding and computing answers with defaults. J. Intell. Inf. Syst. 26 (1) (2006)
Katsumi Inoue, Hideyuki Bando, Hidetomo Nabeshima
Inducing Causal Laws by Regular Inference. ILP (2005)
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)
Hidetomo Nabeshima, Hirohito Nozawa, Koji Iwanuma
Effective SAT Planning by Lemma-Reusing. Artificial Intelligence and Applications (2005)
Koji Iwanuma, Katsumi Inoue, Hidetomo Nabeshima
Upside-Down Transformation in SOL/Connection Tableaux and Its Application. ICTAC (2005)
Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima
Consequence Finding in Default Theories. FQAS (2004)
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
SOLAR: A Consequence Finding System for Advanced Reasoning. TABLEAUX (2003)
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
Effective SAT Planning by Speculative Computation. Australian Joint Conference on Artificial Intelligence (2002)
Masayuki Umehara, Koji Iwanuma, Hidetomo Nabeshima
A Case-Based Recognition of Semantic Structures in HTML Documents. IDEAL (2002)
Hidetomo Nabeshima, Katsumi Inoue, Hiromasa Haneda
Implementing an action language using a SAT solver. ICTAI (2000)