A Space-Saving Algorithm for Enumerating Minimal Generators in Negative Rule Mining - Shogo Mochizuki; Koji Iwanuma (16th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2024, Takamatsu, Japan, July 6-12, 2024, 2024)

An 1013-Approximation On-line Algorithm for Quantiles Based on Counters - Kosuke Maeda; Koji Iwanuma (14th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2023, Koriyama, Japan, July 8-13, 2023, 2023)

A Fast On-Line 1013-Approximation Algorithm for Mining Strongly Closed Itemsets - Koji Iwanuma; Ryo Hinata (IEEE International Conference on Big Data, Big Data 2022, Osaka, Japan, December 17-20, 2022, 2022)

A Bottom-Up Enumeration Algorithm of Minimal Generators without Support Counting for Compressing Negative Association Rules - Kento Yajima; Koji Iwanuma; Yoshitaka Yamamoto (12th International Congress on Advanced Applied Informatics, IIAI-AAI 2022, Kanazawa, Japan, July 2-8, 2022, 2022)

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

Mining Consistent, Non-Redundant and Minimal Negative Rules Based on Minimal Generators - Koji Iwanuma; Kento Yajima; Yoshitaka Yamamoto (2020 IEEE International Conference on Big Data (IEEE BigData 2020), Atlanta, GA, USA, December 10-13, 2020, 2020)

A Skipping FP-Tree for Incrementally Intersecting Closed Itemsets in On-Line Stream Mining - Takumi Nishina; Koji Iwanuma; Yoshitaka Yamamoto (IEEE International Conference on Big Data and Smart Computing, BigComp 2019, Kyoto, Japan, February 27 - March 2, 2019, 2019)

Accelerating an On-Line Approximation Mining for Large Closed Itemsets - Koji Iwanuma; Takumi Nishina; Yoshitaka Yamamoto (2019 IEEE International Conference on Big Data (IEEE BigData), Los Angeles, CA, USA, December 9-12, 2019, 2019)

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

On-Line Approximation Mining for Frequent Closed Itemsets Greater than or Equal to Size K - Takumi Nishina; Koji Iwanuma; Yoshitaka Yamamoto (2018 IEEE International Conference on Big Data, Cloud Computing, Data Science & Engineering (BCD), Yonago, Japan, July 12-13, 2018, 2018)

An On-Line Approximation Algorithm for Mining Frequent Closed Itemsets Based on Incremental Intersection - Koji Iwanuma; Yoshitaka Yamamoto; Shoshi Fukuda (Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016, Bordeaux, France, March 15-16, 2016, Bordeaux, France, March 15-16, 2016, 2016)

Online pattern mining for high-dimensional data streams - Yoshitaka Yamamoto; Koji Iwanuma (2015 IEEE International Conference on Big Data (IEEE BigData 2015), Santa Clara, CA, USA, October 29 - November 1, 2015, 2015)

Completing SBGN-AF Networks by Logic-Based Hypothesis Finding - Yoshitaka Yamamoto; Adrien Rougny; Hidetomo Nabeshima; Katsumi Inoue; Hisao Moriya; Christine Froidevaux; Koji Iwanuma (Formal Methods in Macro-Biology - First International Conference, FMMB 2014, Nouméa, New Caledonia, September 22-24, 2014. Proceedings, 2014)

Resource-oriented approximation for frequent itemset mining from bursty data streams - Yoshitaka Yamamoto; Koji Iwanuma; Shoshi Fukuda (International Conference on Management of Data, SIGMOD 2014, Snowbird, UT, USA, June 22-27, 2014, 2014)

On-the-Fly Lazy Clause Simplification Based on Binary Resolvents - Hidetomo Nabeshima; Koji Iwanuma; Katsumi Inoue (25th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2013, Herndon, VA, USA, November 4-6, 2013, 2013)

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

Non-monotone Dualization via Monotone Dualization - Yoshitaka Yamamoto; Koji Iwanuma; Katsumi Inoue (Late Breaking Papers of the 22nd International Conference on Inductive Logic Programming, Dubrovnik, Croatia, September 17-19, 2012, 2012)

Heuristic Inverse Subsumption in Full-Clausal Theories - Yoshitaka Yamamoto; Katsumi Inoue; Koji Iwanuma (Inductive Logic Programming - 22nd International Conference, ILP 2012, Dubrovnik, Croatia, September 17-19, 2012, Revised Selected Papers, 2012)

Comparison of Upward and Downward Generalizations in CF-Induction - Yoshitaka Yamamoto; Katsumi Inoue; Koji Iwanuma (Inductive Logic Programming - 21st International Conference, ILP 2011, Windsor Great Park, UK, July 31 - August 3, 2011, Revised Selected Papers, 2011)

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

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

Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation - Koji Iwanuma; Hidetomo Nabeshima; Katsumi Inoue (Proceedings of the 7th International Workshop on First-Order Theorem Proving, FTP 2009, Oslo, Norway, July 6-7, 2009, 2009)

Complete Pruning Methods and a Practical Search Strategy for SOL - Hidetomo Nabeshima; Koji Iwanuma; Katsumi Inoue (Proceedings of the LPAR 2008 Workshops, Knowledge Exchange: Automated Provers and Proof Assistants, and the 7th International Workshop on the Implementation of Logics, Doha, Qatar, November 22, 2008, 2008)

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

Lemma Reusing for SAT based Planning and Scheduling - Hidetomo Nabeshima; Takehide Soh; Katsumi Inoue; Koji Iwanuma (Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, ICAPS 2006, Cumbria, UK, June 6-10, 2006, 2006)

Rapid Synthesis of Domain-Specific Web Search Engines Based on Semi-Automatic Training-Example Generation - Hidetomo Nabeshima; Reiko Miyagawa; Yuki Suzuki; Koji Iwanuma (2006 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2006), 18-22 December 2006, Hong Kong, China, 2006)

Effective SAT Planning by Lemma-Reusing - Hidetomo Nabeshima; Hirohito Nozawa; Koji Iwanuma (IASTED International Conference on Artificial Intelligence and Applications, part of the 23rd Multi-Conference on Applied Informatics, Innsbruck, Austria, February 14-16, 2005, 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 (Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005, Houston, Texas, USA, 2005)

Upside-Down Transformation in SOL/Connection Tableaux and Its Application - Koji Iwanuma; Katsumi Inoue; Hidetomo Nabeshima (Theoretical Aspects of Computing - ICTAC 2005, Second International Colloquium, Hanoi, Vietnam, October 17-21, 2005, Proceedings, 2005)

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

Consequence Finding in Default Theories - Katsumi Inoue; Koji Iwanuma; Hidetomo Nabeshima (Flexible Query Answering Systems, 6th International Conference, FQAS 2004, Lyon, France, June 24-26, 2004, Proceedings, 2004)

SOLAR: A Consequence Finding System for Advanced Reasoning - Hidetomo Nabeshima; Koji Iwanuma; Katsumi Inoue (Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2003, Rome, Italy, September 9-12, 2003. Proceedings, 2003)

Effective SAT Planning by Speculative Computation - Hidetomo Nabeshima; Koji Iwanuma; Katsumi Inoue (AI 2002: Advances in Artificial Intelligence, 15th Australian Joint Conference on Artificial Intelligence, Canberra, Australia, December 2-6, 2002, Proceedings, 2002)

A Case-Based Recognition of Semantic Structures in HTML Documents - Masayuki Umehara; Koji Iwanuma; Hidetomo Nabeshima (Intelligent Data Engineering and Automated Learning - IDEAL 2002, Third International Conference, Manchester, UK, August 12-14, Proceedings, 2002)

Minimal Answer Computation and SOL - Koji Iwanuma; Katsumi Inoue (Logics in Artificial Intelligence, European Conference, JELIA 2002, Cosenza, Italy, September, 23-26, Proceedings, 2002)

Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments - Koji Iwanuma; Katsumi Inoue (Computational Logic in Multi-Agent Systems, CLIMA 2002, FLoC Satellite Event, Copenhagen, Denmark, August 1, 2002, 2002)

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 (CLIMA-00), London, UK, July 24-25, 2000, 2000)

Speculative Computation by Abduction under Incomplete Communication Environments - Ken Satoh; Katsumi Inoue; Koji Iwanuma; Chiaki Sakama (4th International Conference on Multi-Agent Systems, ICMAS 2000, Boston, MA, USA, July 10-12, 2000, 2000)

A Case-Based Transformation from HTML to XML - Masayuki Umehara; Koji Iwanuma (Intelligent Data Engineering and Automated Learning - IDEAL 2000, Data Mining, Financial Engineering, and Intelligent Agents, Second International Conference, Shatin, N.T. Hong Kong, China, December 13-15, 2000, Proceedings, 2000)

Lemma Generalization and Non-unit Lemma Matching for Model Elimination - Koji Iwanuma; Kenichi Kishino (Advances in Computing Science - ASIAN'99, 5th Asian Computing Science Conference, Phuket, Thailand, December 10-12, 1999, Proceedings, 1999)

Lemma Matching for a PTTP-based Top-down Theorem Prover - Koji Iwanuma (Automated Deduction - CADE-14, 14th International Conference on Automated Deduction, Townsville, North Queensland, Australia, July 13-17, 1997, Proceedings, 1997)

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

Conservative Query Normalization on Parallel Circumscription - Koji Iwanuma (Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26 - July 1, 1994, Proceedings, 1994)

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

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)

Knowledge Representation and Inference Based on First-Order Modal Logic - Koji Iwanuma; Masateru Harao (Proceedings of the International Conference on Fifth Generation Computer Systems, FGCS 1988, Tokyo, Japan, November 28-December 2, 1988, 1988)

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 (Logic Programming '87, Proceedings of the 6th Conference, Tokyo, Japan, June 22-24, 1987, 1987)