Publications of Katsumi Inoue Published in 1987-2003

Publications of Katsumi Inoue Published in 1987-2003 (Japanese page)

Papers Published Since 2004 (English page)

Papers Published Since 2004 (Japanese page)


Book, Journal, and Conference Papers
  1. Katsumi Inoue and Chiaki Sakama.
    Disjunctive Explanations in Abductive Logic Programming.
    In: Stephen Muggleton (ed.), Special Issue on Machine Intelligence 19, Electronic Transactions on Artificial Intelligence, Volume 7, to appear, 2004.
  2. Kiyoharu Tagawa, Kenta Konishi, and Katsumi Inoue.
    Approach to Artificial Skill from Affordance Theory - Memory and Embodiment -. (in Japanese)
    Journal of the Robotics Society of Japan, 22(7):892-900, 2004.
  3. Chiaki Sakama and Katsumi Inoue.
    An Abductive Framework for Computing Knowledge Base Updates.
    Theory and Practice of Logic Programming, 3(6):671-713, 2003.
  4. Toshiko Wakaki, Katsumi Inoue, Chiaki Sakama, and Katsumi Nitta.
    Computing Preferred Answer Sets in Answer Set Programming.
    Moshe Y. Vardi and Andrei Voronkov (eds.), Logic for Programming, Artificial Intelligence, and Reasoning: Proceedings of the 10th International Conference (LPAR 2003), Lecture Notes in Artificial Intelligence, 2850, pages 259-273, Springer, 2003.
  5. Hidetomo Nabeshima, Koji Iwanuma, and Katsumi Inoue.
    SOLAR: A Consequence Finding System for Advanced Reasoning.
    Marta Cialdea Mayer and Fiora Pirri (eds.), Automated Reasoning with Analytic Tableaux and Related Methods: Proceedings of the 11th International Conference (TABLEAUX 2003), Lecture Notes in Artificial Intelligence, 2796, pages 257-263, Springer, 2003.
  6. Hideyuki Bando, Katsumi Inoue, and Hidetomo Nabeshima.
    Learning Action Rules in Action Language A. (in Japanese)
    Transactions of the Japanese Society for Artificial Intelligence, 18(5):297-304, 2003.
  7. Ken Satoh, Katsumi Inoue, Koji Iwanuma, and Chiaki Sakama.
    Speculative Computation by Abduction in Agent Communication. (in Japanese)
    Computer Software, 20(1):27-35, 2003.
  8. Hidetomo Nabeshima, Koji Iwanuma, and Katsumi Inoue.
    Effective SAT Planning by Speculative Computation.
    In: Bob McKay and John K. Slaney (eds.), Proceedings of the Fifteenth Australian Joint Conference on Artificial Intelligence, Lecture Notes in Artificial Intelligence, 2557, pages 726-728, Springer, 2002.
  9. Koji Iwanuma and Katsumi Inoue.
    Minimal Answer Computation and SOL.
    In: Sergio Greco and Nicola Leone (eds.), Logics in Artificial Intelligence: Proceedings of the Eighth European Conference (JELIA 2002), Lecture Notes in Artificial Intelligence, 2424, pages 245-257, Springer, 2002.
  10. Koji Iwanuma and Katsumi Inoue.
    Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments.
    Electronic Notes on Theoretical Computer Science, 70(5), Elsevier, 2002.
    Also in: Juergen Dix, Joao Alexandre Leite and Ken Satoh (eds.), Proceedings of the Third International Workshop on Computational Logic in Multi-Agent Systems (CLIMA-02) , pages 149-162, 2002.
  11. Katsumi Inoue and Chiaki Sakama.
    Disjunctive Explanations.
    In: Peter Stuckey (ed.), Logic Programming: Proceedings of the Eighteenth International Conference (ICLP 2002), Lecture Notes in Computer Science, 2401, pages 317-332, Springer, 2002.
  12. Katsumi Inoue.
    Automated Abduction.
    In: Antonis Kakas and Fariba Sadri (eds.), Computational Logic: Logic Programming and Beyond - Essays in Honour of Robert A. Kowalski, Part II, Lecture Notes in Artificial Intelligence, 2408, pages 311-341, Springer, 2002.
  13. Katsumi Nitta, Masato Shibasaki, Yoshiaki Yasumura, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura, Katsumi Inoue, Yasuyuki Shirai, and Hiroshi Komatsu.
    A Legal Negotiation Support System Based on a Diagram. (in Japanese)
    Journal of the Japanese Society for Artificial Intelligence, 17(1):32-43, 2002.
  14. Kiyoharu Tagawa, Noboru Wakabayashi, Hiromasa Haneda, and Katsumi Inoue.
    An Imanishism-Based Genetic Algorithm for Sampling Various Pareto-Optimal Solutions: An Application to the Multi-Objective Resource Division Problem.
    Electrical Engineering in Japan, 139(2):23-35, 2002.
  15. Katsumi Inoue, Shin-ichi Kawaguchi, and Hiromasa Haneda.
    Controlling Speculative Computation in Multi-Agent Environments.
    In: Proceedings of the Second International Workshop on Computational Logic in Multi-Agent Systems (CLIMA-01) , pages 9-18, 2001.
  16. Katsumi Inoue.
    Induction, Abduction, and Consequence-Finding.
    In: Celine Rouveirol and Michele Sebag (eds.), Inductive Logic Programming: Proceedings of the Eleventh International Conference (ILP 2001), Lecture Notes in Artificial Intelligence, 2157, pages 65-79, Springer, 2001.
  17. Katsumi Inoue.
    Inverse Entailment for Full Clausal Theories.
    In: LICS-2001 Workshop on Logic and Learning, 2001.
  18. Kiyoharu Tagawa, Kouji Mizutani, Katsumi Inoue, and Hiromasa Haneda.
    An Imanishism-based Genetic Algorithm for Seeking Various Optimal Solutions of the Module Placement Problem. (in Japanese)
    Transactions of the Institute of Systems, Control and Information Engineers, 14(10):467-474, 2001.
  19. Kiyoharu Tagawa, Noboru Wakabayashi, Hiromasa Haneda, and Katsumi Inoue.
    An Imanishism-based Genetic Algorithm for Sampling Various Pareto-optimal Solutions: An Application to the Multi-Objective Resource Division Problem. (in Japanese)
    The Transaction of the Institute of Electrical Engineers of Japan, 121-C(6):992-1000, 2001.
  20. Kiyoharu Tagawa, Katsumi Inoue, and Hiromasa Haneda.
    Emergence of Cognitive Robot Behavior using Affordance and Genetic Algorithm.
    In: Proceedings of the Sixth International Symposium on Artificial Life and Robotics (AROB'01), pages 15-17, 2001.
  21. Chiaki Sakama and Katsumi Inoue.
    Prioritized Logic Programming and its Application to Commonsense Reasoning.
    Artificial Intelligence, 123(1-2):185-222, 2000.
  22. Hidetomo Nabeshima, Katsumi Inoue, and Hiromasa Haneda.
    Implementing an Action Language using a SAT Solver.
    In: Proceedings of the Twelfth IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), pages 96-103, IEEE Computer Society, 2000.
  23. Katsumi Inoue.
    A Simple Characterization of Extended Abduction.
    In: Computational Logic: Proceedings of the First International Conference (CL2000), Lecture Notes in Artificial Intelligence, 1861, pages 718-732, Springer, 2000.
  24. Chiaki Sakama, Katsumi Inoue, Koji Iwanuma, and Ken Satoh.
    A Defeasible Reasoning System in Multi-Agent Environments.
    In: Proceedings of the First International Workshop on Computational Logic in Multi-Agent Systems (CLIMA-00), pages 1-6, 2000.
  25. Koji Iwanuma, Katsumi Inoue, and Ken Satoh.
    Completeness of Pruning Methods for Consequence Finding Procedure SOL.
    In: Peter Baumgartner and Hantao Zhang (eds.), Proceedings of the Third International Workshop on First-Order Theorem Proving (FTP'2000), pages 89-100, Research Report 5-2000, Institute for Computer Science, University of Koblenz, Germany, 2000.
  26. Ken Satoh, Katsumi Inoue, Koji Iwanuma, and Chiaki Sakama.
    Speculative Computation by Abduction under Incomplete Communication Environments.
    In: Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS '2000), pages 263-270, IEEE Computer Society, 2000.
  27. Chiaki Sakama and Katsumi Inoue.
    Abductive Logic Programming and Disjunctive Logic Programming: Their Relationships and Transferability.
    Journal of Logic Programming, 44(1-3):75-100, 2000.
  28. Katsumi Inoue and Hiromasa Haneda.
    Learning Abductive and Nonmonotonic Logic Programs.
    In: Peter Flach and Antonis Kakas (eds.), Abduction and Induction: Essays on their Relation and Integration, pages 213-231, Kluwer Academic, 2000.
  29. Katsumi Inoue and Chiaki Sakama.
    Computing Extended Abduction through Transaction Programs.
    Annals of Mathematics and Artificial Intelligence, 25(3,4):339-367, 1999.
  30. Chiaki Sakama and Katsumi Inoue.
    Updating Extended Logic Programs through Abduction.
    In: M. Gelfond, N. Leone, and G. Pfeifer (eds.), Logic Programming and Non-monotonic Reasoning: Proceedings of the Fifth International Conference (LPNMR'99), Lecture Notes in Artificial Intelligence, 1730, pages 147-161, Springer, 1999.
  31. Katsumi Inoue and Chiaki Sakama.
    Abducing Priorities to Derive Intended Conclusions.
    In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), pages 44-49, Morgan Kaufmann, 1999.
  32. Hidetomo Nabeshima, Katsumi Inoue, and Hiromasa Haneda.
    A Nondeterministic Action Language based on Finite Automata. (in Japanese)
    Transactions of Information Processing Society of Japan, 40(10):3661-3671, 1999.
  33. Kiyoharu Tagawa, Kenji Kanesige, Katsumi Inoue, and Hiromasa Haneda.
    A Design of Genetic Algorithm-based Meta-Heuristic Method: An Application to the Graph Coloring Problem. (in Japanese)
    Transactions of SICE, 35(11):1355-1362, 1999.
  34. Kiyoharu Tagawa, Shunsuke Kawaguchi, Katsumi Inoue, and Hiromasa Haneda.
    Emergence of Intelligent Robot by using Genetic Algorithm and Affordance. (in Japanese)
    Journal of the Robotics Society of Japan, 17(7):1023-1030, 1999.
  35. Kiyoharu Tagawa, Kenji Kanesige, Katsumi Inoue, and Hiromasa Haneda.
    Distance Based Hybrid Genetic Algorithm: An Application for the Graph Coloring Problem.
    Proceedings of the IEEE Congress on Evolutionary Computation 1999 (CEC99), pages 2325-2332, IEEE Press, 1999.
  36. Katsumi Inoue, Yoshimitsu Kudoh, and Hiromasa Haneda.
    Learning Default Rules in Extended Logic Programs. (in Japanese)
    Journal of the Japanese Society for Artificial Intelligence, 14(3):437-445, 1999.
  37. Kiyoharu Tagawa, Yasunobu Kanzaki, Daisuke Okada, Katsumi Inoue, and Hiromasa Haneda.
    Distance Based Construction of Genetic Algorithm - Phenotypic Distance and Harmonic Crossover -. (in Japanese)
    The Transaction of the Institute of Electrical Engineers of Japan, 118-C(12):1778-1785, 1998.
  38. Kiyoharu Tagawa, Shunsuke Kawaguchi, Katsumi Inoue, and Hiromasa Haneda.
    Detection of Affordance for Environmental Discrimination by an Intelligent Robot using a Lamarckian Genetic Algorithm.
    In: Proceedings of the Second Japan-Australia Joint Workshop on Intelligent and Evolutionary Systems, pages 55-61, 1998.
  39. Kiyoharu Tagawa, Daisuke Okada, Yasunobu Kanzaki, Katsumi Inoue, and Hiromasa Haneda.
    Distance Based Hybrid Genetic Algorithm for Symmetric and Asymmetric Traveling Salesman Problems.
    Beijing Mathematics, 4(2):42-49, 1998.
  40. Chiaki Sakama and Katsumi Inoue.
    On Generality in Abduction and Induction.
    In: Peter Flach and Antonis Kakas (eds.), Proceedings of the ECAI'98 workshop on Abduction and Induction in AI, pages 49-52, 1998.
  41. Akemi Sakai and Katsumi Inoue.
    Testing the Satisfiability of a Clause Set by SATCHMO with Symmetry. (in Japanese)
    Transactions of Information Processing Society of Japan, 39(7):2084-2092, 1998.
  42. Yoshihiko Ohta, Katsumi Inoue, and Ryuzo Hasegawa.
    On the Relationship between Non-Horn Magic Sets and Relevancy Testing.
    In: C. Kirchner and H. Kirchner (eds.), Automated Deduction: Proceedings of the Fifteenth International Conference (CADE-15), Lecture Notes in Artificial Intelligence, 1421, pages 333-348, Springer, 1998.
  43. Katsumi Inoue and Chiaki Sakama.
    Specifying Transactions for Extended Abduction.
    In: A.G. Cohn and L. Schubert (eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), pages 394-405, Morgan Kaufmann, 1998.
  44. Katsumi Inoue and Chiaki Sakama.
    Negation as Failure in the Head.
    Journal of Logic Programming, 35(1):39-78, 1998.
  45. Kiyoharu Tagawa, Yasunobu Kanzaki, Daisuke Okada, Katsumi Inoue, and Hiromasa Haneda.
    A New Metric Function and Harmonic Crossover for Symmetric and Asymmetric Traveling Salesman Problems.
    In: Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC '98), pages 822-827, IEEE Press, 1998.
  46. Kiyoharu Tagawa, Shunsuke Kawaguchi, Hajime Iwamoto, Katsumi Inoue, and Hiromasa Haneda.
    Automatic Programming of Autonomous Robots using a Genetic Algorithm.
    In: Proceedings of the Third International Symposium on Artificial Life and Robotics (AROB '98), pages 289-292, 1998.
  47. Eiko Yamamoto and Katsumi Inoue.
    Implementation of SOL Resolution based on Model Elimination. (in Japanese)
    Transactions of Information Processing Society of Japan, 38(11):2112-2121, 1997.
  48. Yoshihiko Ohta, Katsumi Inoue, and Ryuzo Hasegawa.
    The Equivalence between Non-Horn Magic Sets and Relevancy Testing. (in Japanese)
    Transactions of Information Processing Society of Japan, 38(10):1894-1904, 1997.
  49. Katsumi Inoue and Yoshimitsu Kudoh.
    Learning Extended Logic Programs.
    In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), pages 176-181, Morgan Kaufmann, 1997.
  50. Ryuzo Hasegawa, Katsumi Inoue, Yoshihiko Ohta, and Miyuki Koshimura.
    Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving.
    In: W. McCune (ed.), Automated Deduction: Proceedings of the Fourteenth International Conference (CADE-14), Lecture Notes in Artificial Intelligence, 1249, pages 176-190, Springer, 1997.
  51. Ryuzo Hasegawa, Katsumi Inoue, Yoshihiko Ohta, and Miyuki Koshimura.
    Non-Horn Magic Sets to Enhance the Search Efficiency of Bottom-up Theorem Proving. (in Japanese)
    Transactions of Information Processing Society of Japan, 38(3):453-461, 1997.
  52. Hidetomo Nabeshima and Katsumi Inoue.
    Automata Theory for Action Language A. (in Japanese)
    Transactions of Information Processing Society of Japan, 38(3):462-471, 1997.
  53. Masashi Arayama and Katsumi Inoue.
    Optimizations of Query Processing for Disjunctive Deductive Databases. (in Japanese)
    Transactions of Information Processing Society of Japan, 37(12):2295-2304, 1996.
  54. Chiaki Sakama and Katsumi Inoue.
    Representing Priorities in Logic Programs.
    In: M. Maher (ed.), Logic Programming: Proceedings of the 1996 Joint International Conference and Symposium (JICSLP '96), pages 82-96, MIT Press, September 1996.
  55. Katsumi Inoue and Chiaki Sakama.
    A Fixpoint Characterization of Abductive Logic Programs.
    Journal of Logic Programming, 27(2):107-136, 1996.
  56. Katsumi Inoue and Chiaki Sakama.
    Abductive Framework for Nonmonotonic Theory Change.
    In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), pages 204-210, Morgan Kaufmann, 1995.
  57. Chiaki Sakama and Katsumi Inoue.
    Embedding Circumscriptive Theories in General Disjunctive Programs.
    In: V. Marek, A. Nerode, and M. Truszczynski (eds.), Logic Programming and Non-monotonic Reasoning: Proceedings of the Third International Conference (LP&NMR '95), Lecture Notes in Artificial Intelligence, 928, pages 344-357, Springer, 1995.
  58. Chiaki Sakama and Katsumi Inoue.
    The Effect of Partial Deduction in Abductive Reasoning.
    In: L. Sterling (ed.), Logic Programming: Proceedings of the Twelfth International Conference (ICLP '95), pages 383-397, MIT Press, 1995.
  59. Chiaki Sakama and Katsumi Inoue.
    Paraconsistent Stable Semantics for Disjunctive Logic Programs.
    Journal of Logic and Computation, 5(3):265-285, 1995.
  60. Jun-ichi Akahani, Katsumi Inoue, and Ryuzo Hasegawa.
    Bottom-up Modal Theorem Proving Based on Modal Clause Transformation. (in Japanese)
    Transactions of Information Processing Society of Japan, 36(4):822-831, 1995.
  61. Jun-ichi Akahani, Katsumi Inoue, and Ryuzo Hasegawa.
    Modal Clause Transformation: A Bottom-up Approach to Modal Theorem Proving.
    In: Proceedings of the FGCS'94 Workshop on Automated Theorem Proving, pages 43-44, ICOT, 1994.
  62. Chiaki Sakama and Katsumi Inoue.
    An Alternative Approach to the Semantics of Disjunctive Logic Programs and Deductive Databases.
    Journal of Automated Reasoning, 13(1):145-172, 1994.
  63. Chiaki Sakama and Katsumi Inoue.
    On the Equivalence between Disjunctive and Abductive Logic Programs.
    In: P.V. Hentenryck (ed.), Logic Programming: Proceedings of the Eleventh International Conference (ICLP '94), pages 489-503, MIT Press, 1994.
  64. Katsumi Inoue and Chiaki Sakama.
    On Positive Occurrences of Negation as Failure.
    In: J. Doyle, E. Sandewall, and P. Torasso (eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Fourth International Conference (KR '94), pages 293-304, Morgan Kaufmann, 1994.
  65. Katsumi Inoue.
    Hypothetical Reasoning in Logic Programs.
    Journal of Logic Programming, 18(3):191-227, 1994.
  66. Yoshihiko Ohta, Katsumi Inoue, Ryuzo Hasegawa, and Makoto Nakashima.
    A Pruning Technique for Abduction on Model Generation Theorem Provers. (in Japanese)
    Journal of the Japanese Society for Artificial Intelligence, 9(2):268-274, 1994.
  67. Katsumi Inoue, Yoshihiko Ohta, Ryuzo Hasegawa, and Makoto Nakashima.
    Parallel Abduction Based on Model Generation. (in Japanese)
    Journal of the Japanese Society for Artificial Intelligence, 8(6):786-796, 1993.
  68. Katsumi Inoue, Yoshihiko Ohta, Ryuzo Hasegawa, and Makoto Nakashima.
    Bottom-up Abduction by Model Generation.
    In: Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), pages 102-108, Morgan Kaufmann, 1993.
  69. Yoshihiko Ohta and Katsumi Inoue.
    Incorporating Top-down Information into Bottom-up Hypothetical Reasoning.
    New Generation Computing, 11(3,4):401-421, 1993.
  70. Chiaki Sakama and Katsumi Inoue.
    Relating Disjunctive Logic Programs to Default Theories.
    In: L.M. Pereira and A. Nerode (eds.), Logic Programming and Non-monotonic Reasoning: Proceedings of the Second International Workshop (LP&NMR '93), pages 266-282, MIT Press, 1993.
  71. Katsumi Inoue and Chiaki Sakama.
    Representing Abduction by Positive not.
    In: P. Codognet, P.M. Dung, A.C. Kakas, and P. Mancarella (eds.), Proceedings of the ICLP'93 Post-conference Workshop on Abductive Reasoning, pages 1-9, 1993.
  72. Katsumi Inoue and Chiaki Sakama.
    Transforming Abductive Logic Programs to Disjunctive Programs.
    In: D.S. Warren (ed.), Logic Programming: Proceedings of the Tenth International Conference (ICLP '93), pages 335-353, MIT Press, 1993.
  73. Chiaki Sakama and Katsumi Inoue.
    Negation in Disjunctive Logic Programs.
    In: D.S. Warren (ed.), Logic Programming: Proceedings of the Tenth International Conference (ICLP '93), pages 703-719, MIT Press, 1993.
  74. Katsumi Inoue.
    Linear Resolution for Consequence Finding.
    Artificial Intelligence, 56(2,3):301-353, 1992.
  75. Katsumi Inoue, Miyuki Koshimura, and Ryuzo Hasegawa.
    Embedding Negation as Failure into a Model Generation Theorem Prover.
    In: D. Kapur (ed.), Automated Deduction: Proceedings of the Eleventh International Conference (CADE-11), Lecture Notes in Artificial Intelligence, 607, pages 400-415, Springer, 1992.
  76. Yoshihiko Ohta and Katsumi Inoue.
    A Forward-Chaining Hypothetical Reasoner based on Upside-down Meta-Interpretation.
    In: Proceedings of the International Conference on Fifth Generation Computer Systems 1992 (FGCS '92), pages 522-529, Ohmsha, 1992.
  77. Katsumi Inoue.
    An Abductive Procedure for the CMS/ATMS.
    In: J.P. Martins and M. Reinfrank (eds.), Truth Maintenance Systems, Lecture Notes in Artificial Intelligence, 515, pages 34-53, Springer, 1991.
  78. Katsumi Inoue.
    Consequence-Finding based on Ordered Linear Resolution.
    In: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91), pages 158-164, Morgan Kaufmann, 1991.
  79. Nicolas Helft, Katsumi Inoue, and David Poole.
    Query Answering in Circumscription.
    In: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91), pages 426-431, Morgan Kaufmann, 1991.
  80. Katsumi Inoue.
    Extended Logic Programs with Default Assumptions.
    In: K. Furukawa (ed.), Logic Programming: Proceedings of the Eighth International Conference (ICLP '91), pages 490-504, MIT Press, 1991.
  81. Yoshihiko Ohta and Katsumi Inoue.
    An Incremental Hypothesis-Based Forward-Reasoning System. (in Japanese)
    Journal of the Japanese Society for Artificial Intelligence, 6(4):532-544, 1991.
  82. Yoshihiko Ohta and Katsumi Inoue.
    An Efficient Inference Method for Forward-Chaining Hypothetical Reasoning with the ATMS. (in Japanese)
    Journal of the Japanese Society for Artificial Intelligence, 6(2):247-259, 1991.
  83. Yoshihiko Ohta and Katsumi Inoue.
    A Forward-Chaining Multiple Context Reasoner and its Application to Logic Design.
    In: Proceedings of the Second IEEE International Conference on Tools for Artificial Intelligence (TAI-90), pages 386-392, IEEE Computer Society, 1990.
  84. Katsumi Inoue and Yoshihiko Ohta.
    Making Dependency-Directed Search Hierarchical.
    In: Proceedings of the Pacific Rim International Conference on Artificial Intelligence '90 (PRICAI '90), pages 450-455, Ohmsha, 1990.
  85. Katsumi Inoue and Nicolas Helft.
    On Theorem Provers for Circumscription.
    In: P.F. Patel-Schneider (ed.), Proceedings of the Eighth Biennial Conference of the Canadian Society for Computational Studies of Intelligence (CSCSI-90), pages 212-219, Morgan Kaufmann, 1990.
  86. Katsumi Inoue.
    Problem Solving with Hypothetical Reasoning.
    In: Proceedings of the International Conference on Fifth Generation Computer Systems 1988 (FGCS '88), pages 1275-1281, Ohmsha, 1988.
  87. Katsumi Inoue.
    Pruning Search Trees in Assumption-based Reasoning.
    In: Proceedings of the Eighth International Workshop on Expert Systems and their Applications (Avignon '88), Volume 1, pages 133-151, EC2, 1988.

Other Papers and Presentation (Selected)
  1. Katsumi Inoue.
    Consequence Finding and Related Problems in AI. (invited paper)
    Technical Report of IEICE, AI2003-4, pages 17-22, The Institute of Electronics, Information and Communication Engineers, 2003.
  2. Katsumi Inoue.
    Speculative Computation by Consequence Finding.
    Dagstuhl-Seminar 02481 ``Programming Multi Agent Systems based on Logic'', Schloss Dagstuhl, Wadern, Germany, 2002.
  3. Hidetomo Nabeshima and Katsumi Inoue.
    Planning Graph and SAT Planning. (Special Issue: "Recent Advancements and Applications of AI Planning Techniques"; in Japanese)
    Journal of the Japanese Society for Artificial Intelligence, 16(5):605-610, 2001.
  4. Katsumi Inoue.
    Incorporating Lemmas into Consequence-Finding Procedure SOL.
    Dagstuhl-Seminar 01101 ``Deduction'', Schloss Dagstuhl, Wadern, Germany, 2001.
  5. Katsumi Inoue and Hiromasa Haneda.
    Learning Abductive Logic Programs with Abducible Invention. (JSAI SIG Research Award; in Japanese)
    In: Reports of the 37th SIG-FAI Meeting, pages 61-64, Japanese Society for Artificial Intelligence, 1999.
  6. Ryuzo Hasegawa, Miyuki Koshimura, Katsumi Inoue, and Yoshihiko Ohta.
    Non-Horn Magic Sets for Bottom-up Theorem Proving. (in Japanese)
    Research Reports on Information Science and Electrical Engineering of Kyushu University, 1(1):85-90, 1996.
  7. Katsumi Inoue.
    Studies on Abductive and Nonmonotonic Reasoning.
    Ph.D. Dissertation, Kyoto University, Kyoto, 1992.
  8. Katsumi Inoue.
    Principles of Abduction. (Survey Paper; in Japanese)
    Journal of the Japanese Society for Artificial Intelligence, 7(1):48-59, 1992.
  9. Katsumi Inoue
    Hypothetical Reasoning and Nonmonotonic Reasoning. (in Japanese)
    Textbook prepared for the Tutorial on Hypothetical Reasoning, Japan Society for Software Science and Technology, 1991.
  10. Yasuo Nagai, Hirokazu Taki, Satoshi Terasaki, Takanori Yokoyama, and Katsumi Inoue.
    A Tool Architecture for Design Expert System. (Special Issue: "Fifth Generation Computer Systems"; in Japanese)
    Journal of the Japanese Society for Artificial Intelligence, 4(3):297-303, 1989.
  11. Katsumi Inoue.
    Resolution Search Strategies for Assumption-based Reasoning. (IPSJ Convention Award 1987; in Japanese)
    In: Proceedings of the 35th Annual Convention IPS Japan, pages 1567-1568, Information Processing Society of Japan, 1987.

Last updated 14 Nov 2013 - Katsumi Inoue