Completeness of temporal and spatial logic ETSL. - Koji Iwanuma; Masateru Harao; Shoichi Noguchi (Syst. Comput. Jpn., 1987)

Knowledge Representation and Inference Based on First-Order Modal Logic. - Koji Iwanuma; Masateru Harao (FGCS, 1988)

Transformation rules for automated design of circuits by theorem-proving techniques. Transformation from recursion equations to circuit descriptions. - Masateru Harao; Koji Iwanuma (Syst. Comput. Jpn., 1989)

Automated Design of Circuits from Recursion Equations Using Theorem-Proving Technique. - Masateru Harao; Koji Iwanuma (Syst. Comput. Jpn., 1990)

Conservative Query Normalization on Parallel Circumscription. - Koji Iwanuma (CADE, 1994)

An Extension of Pointwise Circumscription. - Koji Iwanuma; Kazuhiko Oota (Artif. Intell., 1996)

Lemma Matching for a PTTP-based Top-down Theorem Prover. - Koji Iwanuma (CADE, 1997)

Lemma Generalization and Non-unit Lemma Matching for Model Elimination. - Koji Iwanuma; Kenichi Kishino (ASIAN, 1999)

A Defeasible Reasoning System in Multi-Agent Environment. - Chiaki Sakama; Katsumi Inoue; Koji Iwanuma; Ken Satoh (CL-2000 Workshop on Computational Logic in Multi-Agent Systems, 2000)

Speculative Computation by Abduction under Incomplete Communication Environments. - Ken Satoh; Katsumi Inoue; Koji Iwanuma; Chiaki Sakama (ICMAS, 2000)

A Case-Based Transformation from HTML to XML. - Masayuki Umehara; Koji Iwanuma (IDEAL, 2000)

Effective SAT Planning by Speculative Computation. - Hidetomo Nabeshima; Koji Iwanuma; Katsumi Inoue (Australian Joint Conference on Artificial Intelligence, 2002)

A Case-Based Recognition of Semantic Structures in HTML Documents. - Masayuki Umehara; Koji Iwanuma; Hidetomo Nabeshima (IDEAL, 2002)

Minimal Answer Computation and SOL. - Koji Iwanuma; Katsumi Inoue (JELIA, 2002)

Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments. - Koji Iwanuma; Katsumi Inoue (CLIMA, 2002)

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

Consequence Finding in Default Theories. - Katsumi Inoue; Koji Iwanuma; Hidetomo Nabeshima (FQAS, 2004)

Speculative Computation Through Consequence-Finding in Multi-Agent Environments. - Katsumi Inoue; Koji Iwanuma (Ann. Math. Artif. Intell., 2004)

Effective SAT Planning by Lemma-Reusing. - Hidetomo Nabeshima; Hirohito Nozawa; Koji Iwanuma (Artificial Intelligence and Applications, 2005)

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 (ICDM, 2005)

Upside-Down Transformation in SOL/Connection Tableaux and Its Application. - Koji Iwanuma; Katsumi Inoue; Hidetomo Nabeshima (ICTAC, 2005)

Lemma Reusing for SAT based Planning and Scheduling. - Hidetomo Nabeshima; Takehide Soh; Katsumi Inoue; Koji Iwanuma (ICAPS, 2006)

Rapid Synthesis of Domain-Specific Web Search Engines Based on Semi-Automatic Training-Example Generation. - Hidetomo Nabeshima; Reiko Miyagawa; Yuki Suzuki; Koji Iwanuma (Web Intelligence, 2006)

Consequence finding and computing answers with defaults. - Katsumi Inoue; Koji Iwanuma; Hidetomo Nabeshima (J. Intell. Inf. Syst., 2006)

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

Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation. - Koji Iwanuma; Hidetomo Nabeshima; Katsumi Inoue (FTP, 2009)

Reconsideration of circumscriptive induction with pointwise circumscription. - Koji Iwanuma; Katsumi Inoue; Hidetomo Nabeshima (J. Appl. Log., 2009)

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

Comparison of Upward and Downward Generalizations in CF-Induction. - Yoshitaka Yamamoto; Katsumi Inoue; Koji Iwanuma (ILP, 2011)

Heuristic Inverse Subsumption in Full-Clausal Theories. - Yoshitaka Yamamoto; Katsumi Inoue; Koji Iwanuma (ILP, 2012)

Non-monotone Dualization via Monotone Dualization. - Yoshitaka Yamamoto; Koji Iwanuma; Katsumi Inoue (ILP (Late Breaking Papers), 2012)

Inverse subsumption for complete explanatory induction. - Yoshitaka Yamamoto; Katsumi Inoue; Koji Iwanuma (Mach. Learn., 2012)

On-the-Fly Lazy Clause Simplification Based on Binary Resolvents. - Hidetomo Nabeshima; Koji Iwanuma; Katsumi Inoue (ICTAI, 2013)

Completing SBGN-AF Networks by Logic-Based Hypothesis Finding. - Yoshitaka Yamamoto; Adrien Rougny; Hidetomo Nabeshima; Katsumi Inoue; Hisao Moriya; Christine Froidevaux; Koji Iwanuma (FMMB, 2014)

Resource-oriented approximation for frequent itemset mining from bursty data streams. - Yoshitaka Yamamoto; Koji Iwanuma; Shoshi Fukuda (SIGMOD Conference, 2014)

Online pattern mining for high-dimensional data streams. - Yoshitaka Yamamoto; Koji Iwanuma (IEEE BigData, 2015)

An On-Line Approximation Algorithm for Mining Frequent Closed Itemsets Based on Incremental Intersection. - Koji Iwanuma; Yoshitaka Yamamoto; Shoshi Fukuda (EDBT, 2016)

On-Line Approximation Mining for Frequent Closed Itemsets Greater than or Equal to Size K. - Takumi Nishina; Koji Iwanuma; Yoshitaka Yamamoto (BCD, 2018)

A Skipping FP-Tree for Incrementally Intersecting Closed Itemsets in On-Line Stream Mining. - Takumi Nishina; Koji Iwanuma; Yoshitaka Yamamoto (BigComp, 2019)

Accelerating an On-Line Approximation Mining for Large Closed Itemsets. - Koji Iwanuma; Takumi Nishina; Yoshitaka Yamamoto (IEEE BigData, 2019)

Approximate-Closed-Itemset Mining for Streaming Data Under Resource Constraint. - Yoshitaka Yamamoto; Yasuo Tabei; Koji Iwanuma (CoRR, 2019)

Mining Consistent, Non-Redundant and Minimal Negative Rules Based on Minimal Generators. - Koji Iwanuma; Kento Yajima; Yoshitaka Yamamoto (IEEE BigData, 2020)

PARASOL: a hybrid approximation approach for scalable frequent itemset mining in streaming data. - Yoshitaka Yamamoto; Yasuo Tabei; Koji Iwanuma (J. Intell. Inf. Syst., 2020)

A Fast On-Line ϵ-Approximation Algorithm for Mining Strongly Closed Itemsets. - Koji Iwanuma; Ryo Hinata (IEEE Big Data, 2022)

A Bottom-Up Enumeration Algorithm of Minimal Generators without Support Counting for Compressing Negative Association Rules. - Kento Yajima; Koji Iwanuma; Yoshitaka Yamamoto (IIAI-AAI, 2022)

An ϵ-Approximation On-line Algorithm for Quantiles Based on Counters. - Kosuke Maeda; Koji Iwanuma (IIAI-AAI, 2023)

A Space-Saving Algorithm for Enumerating Minimal Generators in Negative Rule Mining. - Shogo Mochizuki; Koji Iwanuma (IIAI-AAI, 2024)