2008 | ||
---|---|---|
69 | Ken Satoh, Akihiro Inokuchi, Katashi Nagao, Takahiro Kawamura: New Frontiers in Artificial Intelligence, JSAI 2007 Conference and Workshops, Miyazaki, Japan, June 18-22, 2007, Revised Selected Papers Springer 2008 | |
68 | Fariba Sadri, Ken Satoh: Computational Logic in Multi-Agent Systems, 8th International Workshop, CLIMA VIII, Porto, Portugal, September 10-11, 2007. Revised Selected and Invited Papers Springer 2008 | |
67 | EE | Katsumi Nitta, Ken Satoh, Satoshi Tojo: Overview of JURISIN 2008. JSAI 2008: 211-212 |
66 | EE | Naoki Fukuta, Ken Satoh, Takahira Yamaguchi: Towards "Kiga-kiku" Services on Speculative Computation. PAKM 2008: 256-267 |
2007 | ||
65 | 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 | |
64 | Takashi Washio, Ken Satoh, Hideaki Takeda, Akihiro Inokuchi: New Frontiers in Artificial Intelligence, JSAI 2006 Conference and Workshops, Tokyo, Japan, June 5-9 2006, Revised Selected Papers Springer 2007 | |
63 | EE | Shin-ichi Minato, Ken Satoh, Taisuke Sato: Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs. IJCAI 2007: 2550-2555 |
62 | EE | Mina Akaishi, Yoshikiyo Kato, Ken Satoh, Koichi Hori: Narrative based Topic Visualization for Chronological Data. IV 2007: 139-144 |
61 | EE | Katsumi Nitta, Ken Satoh, Satoshi Tojo: First International Workshop on Juris-Informatics. JSAI 2007: 347-348 |
60 | EE | Hiroshi Hosobe, Ken Satoh, Philippe Codognet: Agent-Based Speculative Constraint Processing. IEICE Transactions 90-D(9): 1354-1362 (2007) |
2006 | ||
59 | EE | Ken Satoh, Ken Kaneiwa, Takeaki Uno: Contradiction Finding and Minimal Recovery for UML Class Diagrams. ASE 2006: 277-280 |
58 | EE | Ken Kaneiwa, Ken Satoh: Consistency Checking Algorithms for Restricted UML Class Diagrams. FoIKS 2006: 219-239 |
57 | EE | Mina Akaishi, Koichi Hori, Ken Satoh: Topic Tracer: a Visualization Tool for Quick Reference of Stories Embedded in Document Set. IV 2006: 101-106 |
56 | EE | Akihiro Yamamoto, Kouichi Hirata, Ken Satoh: The Fourth Workshop on Learning with Logics and Logics for Learning (LLLL2006). JSAI 2006: 249-250 |
55 | Ken Satoh, Satoshi Tojo: Disjunction of Causes and Disjunctive Cause: a Solution to the Paradox of Conditio Sine Qua Non using Minimal Abduction. JURIX 2006: 163-168 | |
54 | EE | Ken Satoh, Takeaki Uno: Enumerating Minimal Explanations by Minimal Hitting Set Computation. KSEM 2006: 354-365 |
2005 | ||
53 | EE | Martine Ceberio, Hiroshi Hosobe, Ken Satoh: Speculative Constraint Processing with Iterative Revision for Disjunctive Answers. CLIMA VI 2005: 340-357 |
52 | EE | Ken Satoh, Takeaki Uno: Enumerating Minimally Revised Specifications Using Dualization. JSAI Workshops 2005: 182-189 |
51 | EE | Ken Satoh: Speculative Computation and Abduction for an Autonomous Agent. IEICE Transactions 88-D(9): 2031-2038 (2005) |
50 | EE | Ken Satoh: Learning taxonomic relation by case-based reasoning. Theor. Comput. Sci. 348(1): 58-69 (2005) |
2004 | ||
49 | EE | Ken Satoh: An Application of Global Abduction to an Information Agent Which Modifies a Plan Upon Failure - Preliminary Report. CLIMA V 2004: 213-229 |
48 | EE | Mina Akaishi, Ken Satoh, Yuzuru Tanaka: An Associative Information Retrieval Based on the Dependency of Term Co-occurrence. Discovery Science 2004: 195-206 |
47 | EE | Ken Satoh: Formalizing Retrieval Goal Change by Prioritized Abduction. Intuitive Human Interfaces for Organizing and Accessing Intellectual Assets 2004: 215-232 |
46 | EE | Ken Satoh: "All's well that ends well" - a proposal of global abduction. NMR 2004: 360-367 |
45 | EE | Jürgen Dix, João Alexandre Leite, Ken Satoh: Introduction. Ann. Math. Artif. Intell. 42(1-3): 1-3 (2004) |
2003 | ||
44 | EE | Ken Satoh: Formalizing Retrieval Goal Change by Prioritized Circumscription - Preliminary Report. CIA 2003: 324-335 |
43 | EE | Ken Satoh, Takeaki Uno: Enumerating Maximal Frequent Sets Using Irredundant Dualization. Discovery Science 2003: 256-268 |
42 | EE | Takeaki Uno, Ken Satoh: Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization. FIMI 2003 |
41 | EE | Ken Satoh, Philippe Codognet, Hiroshi Hosobe: Speculative Constraint Processing in Multi-agent Systems. PRIMA 2003: 133-144 |
40 | EE | Jürgen Dix, Fariba Sadri, Ken Satoh: Introduction. Ann. Math. Artif. Intell. 37(1-2): 1-3 (2003) |
2002 | ||
39 | Jürgen Dix, João Alexandre Leite, Ken Satoh: Computational Logic in Multi-Agent Systems: 3rd International Workshop, CLIMA'02, Copenhagen, Denmark, August 1, 2002, Pre-Proceedings Roskilde University 2002 | |
38 | Steffen Lange, Ken Satoh, Carl H. Smith: Discovery Science, 5th International Conference, DS 2002, Lübeck, Germany, November 24-26, 2002, Proceedings Springer 2002 | |
37 | EE | Ken Satoh, Keiji Yamamoto: Speculative computation with multi-agent belief revision. AAMAS 2002: 897-904 |
36 | Ken Satoh: Speculative computation and abduction for an autonomous agent. NMR 2002: 191-199 | |
35 | EE | Ken Satoh: Constructing a Critical Casebase to Represent a Lattice-Based Relation. Progress in Discovery Science 2002: 214-223 |
34 | EE | Jürgen Dix, João Alexandre Leite, Ken Satoh: Preface. Electr. Notes Theor. Comput. Sci. 70(5): (2002) |
2000 | ||
33 | Ken Satoh, Hidenori Okamoto: Computing Circumscriptive Databases by Integer Programming: Revisited. AAAI/IAAI 2000: 429-435 | |
32 | EE | Ken Satoh: Learning Taxonomic Relation by Case-Based Reasoning. ALT 2000: 179-193 |
31 | EE | Ken Satoh, Ryuichi Nakagawa: Discovering Critical Cases in Case-Based Reasoning. AMAI 2000 |
30 | 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 | |
29 | Ken Satoh, Katsumi Inoue, Koji Iwanuma, Chiaki Sakama: Speculative Computation by Abduction under Incomplete Communication Environments. ICMAS 2000: 263-270 | |
28 | Brian Drabble, Laurent Chaudron, Catherine Tessier, Sue Abu-Hakima, Steven Willmott, Jim Austin, Boi Faltings, Eugene C. Freuder, Gerhard Friedrich, Alex Alves Freitas, Ulises Cortés, Miquel Sànchez-Marrè, David W. Aha, Irma Becerra-Fernandez, Héctor Muñoz-Avila, Aditya Ghose, Tim Menzies, Ken Satoh, Mary Elaine Califf, Michael T. Cox, Sandip Sen, Patrick Brézillon, Jean-Charles Pomerol, Roy M. Turner, Elise H. Turner: Reports on the AAAI 1999 Workshop Program. AI Magazine 21(1): 95-100 (2000) | |
27 | EE | Ken Satoh, Hidenori Okamoto: Computing Circumscriptive Databases by Integer Programming: Revisited (Extended Abstract) CoRR cs.AI/0003007: (2000) |
26 | EE | Ken Satoh: Consistency Management of Normal Logic Program by Top-down Abductive Proof Procedure CoRR cs.AI/0003008: (2000) |
25 | Noboru Iwayama, Ken Satoh: Computing abduction by using TMS with top-down expectation. J. Log. Program. 44(1-3): 179-206 (2000) | |
1998 | ||
24 | EE | Ken Satoh: Analysis of Case-Based Representability of Boolean Functions by Monotone Theory. ALT 1998: 179-190 |
23 | Ken Satoh: Using Two Level Abduction to Decide Similarity of Cases. ECAI 1998: 398-402 | |
1997 | ||
22 | Toshiko Wakaki, Ken Satoh: Compiling Prioritized Circumscription into Extended Logic Programs. IJCAI (1) 1997: 182-189 | |
21 | EE | Toshiko Wakaki, Ken Satoh, Katsumi Nitta: Reasoning about Dynamic Preferences in Circumscriptive Theory by Logic Programming. JACIII 1(2): 121-129 (1997) |
20 | EE | Ken Satoh: Statutory Interpretation by Case-Based Reasoning through Abductive Logic Programming. JACIII 1(2): 94-103 (1997) |
1996 | ||
19 | EE | Ken Satoh: Disambiguation by Prioritized Circumscription. COLING 1996: 901-906 |
18 | Ken Satoh: Translating Case-Based Reasoning into Abductive Logic Programming. ECAI 1996: 142-146 | |
1995 | ||
17 | Seishi Okamoto, Ken Satoh: An Average-Case Analysis of k-Nearest Neighbor Classifier. ICCBR 1995: 253-264 | |
16 | Toshiko Wakaki, Ken Satoh: Computing Prioritized Circumscription by Logic Programming. ICLP 1995: 283-297 | |
15 | Ken Satoh: PAC-learning of Preference Relations over Interpretations in Lazy Nonmonotonic Reasoning. Machine Intelligence 15 1995: 285-297 | |
1994 | ||
14 | Ken Satoh: A Top Down Proof Procedure for Default Logic by Using Abduction. ECAI 1994: 65-69 | |
13 | Seishi Okamoto, Ken Satoh: An Average Predictive Accuracy of the Nearest Neighbor Classifier. EWCBR 1994: 101-112 | |
1992 | ||
12 | Noboru Iwayama, Ken Satoh, Jun Arima: A Formalization of Generalization-Based Analogy in General Logic Programs. ECAI 1992: 129-133 | |
11 | Ken Satoh, Noboru Iwayama: A Correct Goal-directed Proof Procedure for a General Logic Program with Integrity Constraints. ELP 1992: 24-44 | |
10 | Satoshi Terasaki, David J. Hawley, Hiroyuki Sawada, Ken Satoh, Satoshi Menju, Taro Kawagishi, Noboru Iwayama, Akira Aiba: Parallel Constraint Logic Programming Language GDCC and its Parallel Constraint Solvers. FGCS 1992: 330-346 | |
9 | Ken Satoh, Noboru Iwayama: A Query Evaluation Method for Abductive Logic Programming. JICSLP 1992: 671-685 | |
1991 | ||
8 | Ken Satoh, Noboru Iwayama: Computing Abduction by Using the TMS. ICLP 1991: 505-518 | |
7 | Hirofumi Katsuno, Ken Satoh: A Unified View of Consequence Relation, Belief Revision and Conditional Logic. IJCAI 1991: 406-412 | |
1990 | ||
6 | Ken Satoh: A Probabilistic Interpretation for Lazy Nonmonotonic Reasoning. AAAI 1990: 659-664 | |
5 | Ken Satoh: Formalizing Soft Constraints by Interpretation Ordering. ECAI 1990: 585-590 | |
1988 | ||
4 | Ken Satoh: Nonmonotonic Reasoning by Minimal Belief Revision. FGCS 1988: 455-462 | |
1986 | ||
3 | Kouichi Kumon, Hideo Masuzawa, Akihiro Itashiki, Ken Satoh, Yukio Sohma: KABU-WAKE: A New Parallel Inference Method and Its Evaluation. COMPCON 1986: 168-172 | |
2 | Hideo Masuzawa, Kouichi Kumon, Akihiro Itashiki, Ken Satoh, Yukio Sohma: "Kabu-Wake" Parallel Inference Mechanism and It's Evaluation. FJCC 1986: 955-962 | |
1 | Ian T. Foster, Steve Gregory, Graem A. Ringwood, Ken Satoh: A Sequential Implementation of Parlog. ICLP 1986: 149-156 |