The SCEAS System
Navigation Menu

Search the dblp DataBase


Katsumi Inoue: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Chiaki Sakama, Katsumi Inoue
    Relating Disjunctive Logic Programs to Default Theories. [Citation Graph (2, 0)][DBLP]
    LPNMR, 1993, pp:266-282 [Conf]
  2. Katsumi Inoue, Miyuki Koshimura, Ryuzo Hasegawa
    Embedding Negation as Failure into a Model Generation Theorem Prover. [Citation Graph (1, 0)][DBLP]
    CADE, 1992, pp:400-415 [Conf]
  3. Katsumi Inoue, Chiaki Sakama
    Transforming Abductive Logic Programs to Disjunctive Programs. [Citation Graph (1, 0)][DBLP]
    ICLP, 1993, pp:335-353 [Conf]
  4. Chiaki Sakama, Katsumi Inoue
    An Alternative Approach to the Semantics of Disjunctive Logic Programs and Deductive Databases. [Citation Graph (1, 0)][DBLP]
    J. Autom. Reasoning, 1994, v:13, n:1, pp:145-172 [Journal]
  5. Chiaki Sakama, Katsumi Inoue
    Paraconsistent Stable Semantics for Extended Disjunctive Programs. [Citation Graph (1, 0)][DBLP]
    J. Log. Comput., 1995, v:5, n:3, pp:265-285 [Journal]
  6. Andrei Doncescu, Muhammad Farmer, Katsumi Inoue, Gilles Richard
    A web architecture for data mining in biology. [Citation Graph (0, 0)][DBLP]
    AINA (2), 2006, pp:607-612 [Conf]
  7. Andrei Doncescu, Yoshitaka Yamamoto, Katsumi Inoue
    Biological Systems Analysis Using Inductive Logic Programming. [Citation Graph (0, 0)][DBLP]
    AINA Workshops (1), 2007, pp:690-695 [Conf]
  8. Chiaki Sakama, Katsumi Inoue
    Combining Answer Sets of Nonmonotonic Logic Programs. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2005, pp:- [Conf]
  9. Andrei Doncescu, Katsumi Inoue
    Automated Abduction for Computer Forensics. [Citation Graph (0, 0)][DBLP]
    ATC, 2006, pp:493-499 [Conf]
  10. Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
    Effective SAT Planning by Speculative Computation. [Citation Graph (0, 0)][DBLP]
    Australian Joint Conference on Artificial Intelligence, 2002, pp:726-728 [Conf]
  11. Katsumi Inoue
    Automated Abduction. [Citation Graph (0, 0)][DBLP]
    Computational Logic: Logic Programming and Beyond, 2002, pp:311-341 [Conf]
  12. Ryuzo Hasegawa, Katsumi Inoue, Yoshihiko Ohta, Miyuki Koshimura
    Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 1997, pp:176-190 [Conf]
  13. Yoshihiko Ohta, Katsumi Inoue, Ryuzo Hasegawa
    On the Relationship Between Non-Horn Magic Sets and Relevancy Testing. [Citation Graph (0, 0)][DBLP]
    CADE, 1998, pp:333-348 [Conf]
  14. Chiaki Sakama, Katsumi Inoue, Koji Iwanuma, Ken Satoh
    A Defeasible Reasoning System in Multi-Agent Environment. [Citation Graph (0, 0)][DBLP]
    CL-2000 Workshop on Computational Logic in Multi-Agent Systems, 2000, pp:1-6 [Conf]
  15. Katsumi Inoue
    A Simple Characterization of Extended Abduction. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:718-732 [Conf]
  16. Chiaki Sakama, Katsumi Inoue
    Combining Answer Sets of Nonmonotonic Logic Programs. [Citation Graph (0, 0)][DBLP]
    CLIMA VI, 2005, pp:320-339 [Conf]
  17. Koji Iwanuma, Katsumi Inoue
    Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments. [Citation Graph (0, 0)][DBLP]
    CLIMA III, 2002, pp:149-162 [Conf]
  18. Chiaki Sakama, Katsumi Inoue
    Coordination Between Logical Agents. [Citation Graph (0, 0)][DBLP]
    CLIMA V, 2004, pp:161-177 [Conf]
  19. Katsumi Inoue
    An Abductive Procedure for the CMS/ATMS. [Citation Graph (0, 0)][DBLP]
    Truth Maintenance Systems (ECAI Workshop), 1990, pp:34-53 [Conf]
  20. Katsumi Inoue
    Problem Solving with Hypothetical Reasoning. [Citation Graph (0, 0)][DBLP]
    FGCS, 1988, pp:1275-1281 [Conf]
  21. Yoshihiko Ohta, Katsumi Inoue
    A Forward-Chaining Hypothetical Reasoner Based on Upside-Down Meta-Interpretation. [Citation Graph (0, 0)][DBLP]
    FGCS, 1992, pp:522-529 [Conf]
  22. Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima
    Consequence Finding in Default Theories. [Citation Graph (0, 0)][DBLP]
    FQAS, 2004, pp:459-472 [Conf]
  23. Andrei Doncescu, Katsumi Inoue, Muhammad Farmer, Gilles Richard
    A Web-Based Architecture for Inductive Logic Programming in Biology. [Citation Graph (0, 0)][DBLP]
    ICEIS (2), 2005, pp:357-361 [Conf]
  24. Katsumi Inoue
    Extended Logic Programs with Default Assumptions. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:490-504 [Conf]
  25. Katsumi Inoue, Chiaki Sakama
    Disjunctive Explanations. [Citation Graph (0, 0)][DBLP]
    ICLP, 2002, pp:317-332 [Conf]
  26. Katsumi Inoue, Chiaki Sakama
    Generality Relations in Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 2006, pp:211-225 [Conf]
  27. Chiaki Sakama, Katsumi Inoue
    Negation in Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1993, pp:703-719 [Conf]
  28. Chiaki Sakama, Katsumi Inoue
    On the Equivalence between Disjunctive and Abductive Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1994, pp:489-503 [Conf]
  29. Chiaki Sakama, Katsumi Inoue
    The Effect of Partial Deduction in Abductive Reasoning. [Citation Graph (0, 0)][DBLP]
    ICLP, 1995, pp:383-397 [Conf]
  30. Chiaki Sakama, Katsumi Inoue
    Representing Priorities in Logic Programs. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:82-96 [Conf]
  31. Toshiko Wakaki, Katsumi Inoue
    Compiling Prioritized Circumscription into Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 2004, pp:356-370 [Conf]
  32. Ken Satoh, Katsumi Inoue, Koji Iwanuma, Chiaki Sakama
    Speculative Computation by Abduction under Incomplete Communication Environments. [Citation Graph (0, 0)][DBLP]
    ICMAS, 2000, pp:263-270 [Conf]
  33. Koji Iwanuma, Katsumi Inoue, Hidetomo Nabeshima
    Upside-Down Transformation in SOL/Connection Tableaux and Its Application. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2005, pp:166-179 [Conf]
  34. Hidetomo Nabeshima, Katsumi Inoue, Hiromasa Haneda
    Implementing an action language using a SAT solver. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2000, pp:96-103 [Conf]
  35. Nicolas Helft, Katsumi Inoue, David Poole
    Query Answering in Circumscription. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1991, pp:426-431 [Conf]
  36. Katsumi Inoue
    Consequence-Finding Based on Ordered Linear Resolution. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1991, pp:158-164 [Conf]
  37. Katsumi Inoue, Yoshimitsu Kudoh
    Learning Extended Logic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1997, pp:176-181 [Conf]
  38. Katsumi Inoue, Yoshihiko Ohta, Ryuzo Hasegawa, Makoto Nakashima
    Bottom-up Abduction by Model Generation. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1993, pp:102-108 [Conf]
  39. Katsumi Inoue, Chiaki Sakama
    Equivalence in Abductive Logic. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:472-477 [Conf]
  40. Katsumi Inoue, Chiaki Sakama
    Abductive Framework for Nonmonotonic Theory Change. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:204-210 [Conf]
  41. Katsumi Inoue, Chiaki Sakama
    Abducing Priorities to Derive Intended Conclusions. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:44-49 [Conf]
  42. Katsumi Inoue
    Induction, Abduction, and Consequence-Finding. [Citation Graph (0, 0)][DBLP]
    ILP, 2001, pp:65-79 [Conf]
  43. Katsumi Inoue, Hideyuki Bando, Hidetomo Nabeshima
    Inducing Causal Laws by Regular Inference. [Citation Graph (0, 0)][DBLP]
    ILP, 2005, pp:154-171 [Conf]
  44. Katsumi Inoue, Haruka Saito
    Circumscription Policies for Induction. [Citation Graph (0, 0)][DBLP]
    ILP, 2004, pp:164-179 [Conf]
  45. Chiaki Sakama, Katsumi Inoue
    Inductive Equivalence of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ILP, 2005, pp:312-329 [Conf]
  46. Mutsunori Banbara, Naoyuki Tamura, Katsumi Inoue
    Prolog Cafe : A Prolog to Java Translator System. [Citation Graph (0, 0)][DBLP]
    INAP, 2005, pp:1-11 [Conf]
  47. Katsumi Inoue, Chiaki Sakama
    Equivalence of Logic Programs Under Updates. [Citation Graph (0, 0)][DBLP]
    JELIA, 2004, pp:174-186 [Conf]
  48. Koji Iwanuma, Katsumi Inoue
    Minimal Answer Computation and SOL. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:245-258 [Conf]
  49. Toshiko Wakaki, Katsumi Inoue, Chiaki Sakama, Katsumi Nitta
    The PLP System. [Citation Graph (0, 0)][DBLP]
    JELIA, 2004, pp:706-709 [Conf]
  50. Katsumi Inoue, Chiaki Sakama
    On Positive Occurrences of Negation as Failure. [Citation Graph (0, 0)][DBLP]
    KR, 1994, pp:293-304 [Conf]
  51. Katsumi Inoue, Chiaki Sakama
    Specifying Transactions for Extended Abduction. [Citation Graph (0, 0)][DBLP]
    KR, 1998, pp:394-405 [Conf]
  52. Chiaki Sakama, Katsumi Inoue
    Constructing Consensus Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2006, pp:26-42 [Conf]
  53. Toshiko Wakaki, Katsumi Inoue, Chiaki Sakama, Katsumi Nitta
    Computing Preferred Answer Sets in Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:259-273 [Conf]
  54. Chiaki Sakama, Katsumi Inoue
    Embedding Circumscriptive Theories in General Disjunctive Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1995, pp:344-357 [Conf]
  55. Chiaki Sakama, Katsumi Inoue
    Updating Extended Logic Programs through Abduction. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1999, pp:147-161 [Conf]
  56. Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
    SOLAR: A Consequence Finding System for Advanced Reasoning. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2003, pp:257-263 [Conf]
  57. Katsumi Inoue
    Linear Resolution for Consequence Finding. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1992, v:56, n:2-3, pp:301-353 [Journal]
  58. Chiaki Sakama, Katsumi Inoue
    Prioritized logic programming and its application to commonsense reasoning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:123, n:1-2, pp:185-222 [Journal]
  59. Katsumi Inoue, Koji Iwanuma
    Speculative Computation Through Consequence-Finding in Multi-Agent Environments. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2004, v:42, n:1-3, pp:255-291 [Journal]
  60. Katsumi Inoue, Chiaki Sakama
    Computing Extended Abduction Through Transaction Programs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1999, v:25, n:3-4, pp:339-367 [Journal]
  61. Yoshimi Egawa, Katsumi Inoue
    Radius of (2k-1)-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:51, n:, pp:- [Journal]
  62. Chiaki Sakama, Katsumi Inoue
    An Abductive Framework For Computing Knowledge Base Updates [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  63. Katsumi Inoue, Takehide Soh, Seiji Ueda, Yoshito Sasaura, Mutsunori Banbara, Naoyuki Tamura
    A competitive and cooperative approach to propositional satisfiability. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2291-2306 [Journal]
  64. Koji Iwanuma, Katsumi Inoue
    Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:70, n:5, pp:- [Journal]
  65. Katsumi Inoue, Chiaki Sakama
    Abductive Equivalence in First-order Logic. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2006, v:14, n:2, pp:333-346 [Journal]
  66. Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima
    Consequence finding and computing answers with defaults. [Citation Graph (0, 0)][DBLP]
    J. Intell. Inf. Syst., 2006, v:26, n:1, pp:41-58 [Journal]
  67. Katsumi Inoue
    Hypothetical Reasoning in Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1994, v:18, n:3, pp:191-227 [Journal]
  68. Katsumi Inoue, Chiaki Sakama
    A Fixpoint Characterization of Abductive Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1996, v:27, n:2, pp:107-136 [Journal]
  69. Katsumi Inoue, Chiaki Sakama
    Negation as Failure in the Head. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1998, v:35, n:1, pp:39-78 [Journal]
  70. Chiaki Sakama, Katsumi Inoue
    Abductive logic programming and disjunctive logic programming: their relationship and transferability. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 2000, v:44, n:1-3, pp:75-100 [Journal]
  71. Katsumi Inoue
    Induction as Consequence Finding. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2004, v:55, n:2, pp:109-135 [Journal]
  72. Yoshihiko Ohta, Katsumi Inoue
    Incorporating Top-Down Information into Bottom-Up Hypothetical Reasoning. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1993, v:11, n:3, pp:401-421 [Journal]
  73. Chiaki Sakama, Katsumi Inoue
    An abductive framework for computing knowledge base updates. [Citation Graph (0, 0)][DBLP]
    TPLP, 2003, v:3, n:6, pp:671-713 [Journal]
  74. Katsumi Inoue, Chiaki Sakama
    Generality and Equivalence Relations in Default Logic. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:434-439 [Conf]
  75. Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, Koji Iwanuma
    Lemma Reusing for SAT based Planning and Scheduling. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2006, pp:103-113 [Conf]
  76. Oliver Ray, Katsumi Inoue
    A Consequence Finding Approach for Full Clausal Abduction. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2007, pp:173-184 [Conf]
  77. Andrei Doncescu, Katsumi Inoue, Yoshitaka Yamamoto
    Knowledge Based Discovery in Systems Biology Using CF-Induction. [Citation Graph (0, 0)][DBLP]
    IEA/AIE, 2007, pp:395-404 [Conf]

  78. Estimation of Possible Reaction States in Metabolic Pathways Using Inductive Logic Programming. [Citation Graph (, )][DBLP]

  79. Abductive Reasoning in Cancer Therapy. [Citation Graph (, )][DBLP]

  80. Main Pathway Discovery in Metabolic Pathways. [Citation Graph (, )][DBLP]

  81. Negotiation by abduction and relaxation. [Citation Graph (, )][DBLP]

  82. Comparing Abductive Theories. [Citation Graph (, )][DBLP]

  83. Identifying Necessary Reactions in Metabolic Pathways by Minimal Model Generation. [Citation Graph (, )][DBLP]

  84. Abduction of distributed theories through local interactions. [Citation Graph (, )][DBLP]

  85. Evaluating Abductive Hypotheses using an EM Algorithm on BDDs. [Citation Graph (, )][DBLP]

  86. Discovering Rules by Meta-level Abduction. [Citation Graph (, )][DBLP]

  87. Mode-Directed Inverse Entailment for Full Clausal Theories. [Citation Graph (, )][DBLP]

  88. Brave Induction. [Citation Graph (, )][DBLP]

  89. Grammatical Concept Representation for Randomised Optimisation Algorithms in Relational Learning. [Citation Graph (, )][DBLP]

  90. Towards a Logical Reconstruction of CF-Induction. [Citation Graph (, )][DBLP]

  91. Complete Pruning Methods and a Practical Search Strategy for SOL. [Citation Graph (, )][DBLP]

  92. SOLAR: An automated deduction system for consequence finding. [Citation Graph (, )][DBLP]

Search in 0.030secs, Finished in 0.033secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002