Hidetomo Nabeshima
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
20
Venues
13
Active years
2000–2026
Best venue rank
A*
Where they publish
Papers
20 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | KR | Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis. | Mutsunori Banbara, Hideo Bannai, Takashi Horiyama, Dominik Kppl, Takuya Mieno, Hidetomo Nabeshima |
| 2025 | SAT | SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints. | Ryoga Ohashi, Takehide Soh, Daniel Le Berre, Hidetomo Nabeshima, Mutsunori Banbara, Katsumi Inoue, Naoyuki Tamura |
| 2024 | KR | Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming. | Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara |
| 2024 | LPNMR | ASP-Based Large Neighborhood Prioritized Search for Course Timetabling. | Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara |
| 2023 | JELIA | Hamiltonian Cycle Reconfiguration with Answer Set Programming. | Takahiro Hirate, Mutsunori Banbara, Katsumi Inoue, Xiao-Nan Lu, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura |
| 2020 | SAT | Reproducible Efficient Parallel SAT Solving. | Hidetomo Nabeshima, Katsumi Inoue |
| 2017 | SAT | Coverage-Based Clause Reduction Heuristics for CDCL Solvers. | Hidetomo Nabeshima, Katsumi Inoue |
| 2015 | ILP | Completing signaling networks by abductive reasoning with perturbation experiments. | Adrien Rougny, Yoshitaka Yamamoto, Hidetomo Nabeshima, Gauvain Bourgne, Anne Poupon, Katsumi Inoue, Christine Froidevaux |
| 2013 | ICTAI | On-the-Fly Lazy Clause Simplification Based on Binary Resolvents. | Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue |
| 2010 | ILP | Hypothesizing about Causal Networks with Positive and Negative Effects by Meta-level Abduction. | Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima |
| 2009 | IJCAI | Evaluating Abductive Hypotheses using an EM Algorithm on BDDs. | Katsumi Inoue, Taisuke Sato, Masakazu Ishihata, Yoshitaka Kameya, Hidetomo Nabeshima |
| 2009 | ILP | Discovering Rules by Meta-level Abduction. | Katsumi Inoue, Koichi Furukawa, Ikuo Kobayashi, Hidetomo Nabeshima |
| 2008 | LPAR | Complete Pruning Methods and a Practical Search Strategy for SOL. | Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue |
| 2005 | ICDM | Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm. | Koji Iwanuma, Ryuichi Ishihara, Yo Takano, Hidetomo Nabeshima |
| 2005 | ILP | Inducing Causal Laws by Regular Inference. | Katsumi Inoue, Hideyuki Bando, Hidetomo Nabeshima |
| 2005 | ICTAC | Upside-Down Transformation in SOL/Connection Tableaux and Its Application. | Koji Iwanuma, Katsumi Inoue, Hidetomo Nabeshima |
| 2004 | FQAS | Consequence Finding in Default Theories. | Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima |
| 2003 | TABLEAUX | SOLAR: A Consequence Finding System for Advanced Reasoning. | Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue |
| 2002 | IDEAL | A Case-Based Recognition of Semantic Structures in HTML Documents. | Masayuki Umehara, Koji Iwanuma, Hidetomo Nabeshima |
| 2000 | ICTAI | Implementing an action language using a SAT solver. | Hidetomo Nabeshima, Katsumi Inoue, Hiromasa Haneda |