| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Hidetomo Nabeshima 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 1 [ 6 ] 2 [ 1 ] 3 [ 1 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] 4 [ 8 ] 5 [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 7 ] [ 8 ] [ 9 ] 6 [ 9 ] 7 [ 8 ] 8 [ 2 ]  ©2006 Association for Computing Machinery |
