| 2009 |
|---|
| 25 | EE | Koji Iwanuma,
Katsumi Inoue,
Hidetomo Nabeshima:
Reconsideration of circumscriptive induction with pointwise circumscription.
J. Applied Logic 7(3): 307-317 (2009) |
| 2008 |
|---|
| 24 | EE | Hidetomo Nabeshima,
Koji Iwanuma,
Katsumi Inoue:
Complete Pruning Methods and a Practical Search Strategy for SOL.
LPAR Workshops 2008 |
| 2006 |
|---|
| 23 | | Hidetomo Nabeshima,
Takehide Soh,
Katsumi Inoue,
Koji Iwanuma:
Lemma Reusing for SAT based Planning and Scheduling.
ICAPS 2006: 103-113 |
| 22 | EE | 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 |
| 21 | EE | Katsumi Inoue,
Koji Iwanuma,
Hidetomo Nabeshima:
Consequence finding and computing answers with defaults.
J. Intell. Inf. Syst. 26(1): 41-58 (2006) |
| 2005 |
|---|
| 20 | | Hidetomo Nabeshima,
Hirohito Nozawa,
Koji Iwanuma:
Effective SAT Planning by Lemma-Reusing.
Artificial Intelligence and Applications 2005: 1-5 |
| 19 | EE | 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 |
| 18 | EE | Koji Iwanuma,
Katsumi Inoue,
Hidetomo Nabeshima:
Upside-Down Transformation in SOL/Connection Tableaux and Its Application.
ICTAC 2005: 166-179 |
| 2004 |
|---|
| 17 | EE | Katsumi Inoue,
Koji Iwanuma,
Hidetomo Nabeshima:
Consequence Finding in Default Theories.
FQAS 2004: 459-472 |
| 16 | EE | Katsumi Inoue,
Koji Iwanuma:
Speculative Computation Through Consequence-Finding in Multi-Agent Environments.
Ann. Math. Artif. Intell. 42(1-3): 255-291 (2004) |
| 2003 |
|---|
| 15 | EE | Hidetomo Nabeshima,
Koji Iwanuma,
Katsumi Inoue:
SOLAR: A Consequence Finding System for Advanced Reasoning.
TABLEAUX 2003: 257-263 |
| 2002 |
|---|
| 14 | EE | Hidetomo Nabeshima,
Koji Iwanuma,
Katsumi Inoue:
Effective SAT Planning by Speculative Computation.
Australian Joint Conference on Artificial Intelligence 2002: 726-728 |
| 13 | | Koji Iwanuma,
Katsumi Inoue:
Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments.
CLIMA III 2002: 149-162 |
| 12 | EE | Masayuki Umehara,
Koji Iwanuma,
Hidetomo Nabeshima:
A Case-Based Recognition of Semantic Structures in HTML Documents.
IDEAL 2002: 141-147 |
| 11 | EE | Koji Iwanuma,
Katsumi Inoue:
Minimal Answer Computation and SOL.
JELIA 2002: 245-258 |
| 10 | EE | Koji Iwanuma,
Katsumi Inoue:
Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments.
Electr. Notes Theor. Comput. Sci. 70(5): (2002) |
| 2000 |
|---|
| 9 | | Chiaki Sakama,
Katsumi Inoue,
Koji Iwanuma,
Ken Satoh:
A Defeasible Reasoning System in Multi-Agent Environment.
CL-2000 Workshop on Computational Logic in Multi-Agent Systems 2000: 1-6 |
| 8 | | Ken Satoh,
Katsumi Inoue,
Koji Iwanuma,
Chiaki Sakama:
Speculative Computation by Abduction under Incomplete Communication Environments.
ICMAS 2000: 263-270 |
| 7 | EE | Masayuki Umehara,
Koji Iwanuma:
A Case-Based Transformation from HTML to XML.
IDEAL 2000: 410-415 |
| 1999 |
|---|
| 6 | EE | Koji Iwanuma,
Kenichi Kishino:
Lemma Generalization and Non-unit Lemma Matching for Model Elimination.
ASIAN 1999: 163-176 |
| 1997 |
|---|
| 5 | | Koji Iwanuma:
Lemma Matching for a PTTP-based Top-down Theorem Prover.
CADE 1997: 146-160 |
| 1996 |
|---|
| 4 | EE | Koji Iwanuma,
Kazuhiko Oota:
An Extension of Pointwise Circumscription.
Artif. Intell. 86(2): 391-402 (1996) |
| 1994 |
|---|
| 3 | | Koji Iwanuma:
Conservative Query Normalization on Parallel Circumscription.
CADE 1994: 296-310 |
| 1988 |
|---|
| 2 | | Koji Iwanuma,
Masateru Harao:
Knowledge Representation and Inference Based on First-Order Modal Logic.
FGCS 1988: 499-506 |
| 1987 |
|---|
| 1 | | Koji Iwanuma,
Masateru Harao:
Knowledge Representation and Inference Based on First-Order Modal Logic.
LP 1987: 236-251 |
