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