Hidetomo Nabeshima

Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima: Completing causal networks by meta-level abduction. Machine Learning 91(2): 239-277 (2013)

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

Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue, Oliver Ray: SOLAR: An automated deduction system for consequence finding. AI Commun. 23(2-3): 183-203 (2010)

Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo Nabeshima: A SAT-based Method for Solving the Two-dimensional Strip Packing Problem. Fundam. Inform. 102(3-4): 467-487 (2010)

Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa: Solving Open Job-Shop Scheduling Problems by SAT Encoding. IEICE Transactions 93-D(8): 2316-2318 (2010)

Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima: Hypothesizing about Causal Networks with Positive and Negative Effects by Meta-level Abduction. ILP 2010: 114-129

Koji Iwanuma, Katsumi Inoue, Hidetomo Nabeshima: Reconsideration of circumscriptive induction with pointwise circumscription. J. Applied Logic 7(3): 307-317 (2009)

Katsumi Inoue, Taisuke Sato, Masakazu Ishihata, Yoshitaka Kameya, Hidetomo Nabeshima: Evaluating Abductive Hypotheses using an EM Algorithm on BDDs. IJCAI 2009: 810-815

Katsumi Inoue, Koichi Furukawa, Ikuo Kobayashi, Hidetomo Nabeshima: Discovering Rules by Meta-level Abduction. ILP 2009: 49-64

Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue: Complete Pruning Methods and a Practical Search Strategy for SOL. LPAR Workshops 2008

Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima: Consequence finding and computing answers with defaults. J. Intell. Inf. Syst. 26(1): 41-58 (2006)

Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, Koji Iwanuma: Lemma Reusing for SAT based Planning and Scheduling. ICAPS 2006: 103-113

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

Hidetomo Nabeshima, Hirohito Nozawa, Koji Iwanuma: Effective SAT Planning by Lemma-Reusing. Artificial Intelligence and Applications 2005: 1-5

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

Koji Iwanuma, Katsumi Inoue, Hidetomo Nabeshima: Upside-Down Transformation in SOL/Connection Tableaux and Its Application. ICTAC 2005: 166-179

Katsumi Inoue, Hideyuki Bando, Hidetomo Nabeshima: Inducing Causal Laws by Regular Inference. ILP 2005: 154-171

Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima: Consequence Finding in Default Theories. FQAS 2004: 459-472

Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue: SOLAR: A Consequence Finding System for Advanced Reasoning. TABLEAUX 2003: 257-263

Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue: Effective SAT Planning by Speculative Computation. Australian Joint Conference on Artificial Intelligence 2002: 726-728

Masayuki Umehara, Koji Iwanuma, Hidetomo Nabeshima: A Case-Based Recognition of Semantic Structures in HTML Documents. IDEAL 2002: 141-147

Hidetomo Nabeshima, Katsumi Inoue, Hiromasa Haneda: Implementing an action language using a SAT solver. ICTAI 2000: 96-103