The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ken Satoh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ken Satoh
    Nonmonotonic Reasoning by Minimal Belief Revision. [Citation Graph (5, 0)][DBLP]
    FGCS, 1988, pp:455-462 [Conf]
  2. Ken Satoh, Noboru Iwayama
    Computing Abduction by Using the TMS. [Citation Graph (3, 0)][DBLP]
    ICLP, 1991, pp:505-518 [Conf]
  3. Ken Satoh, Noboru Iwayama
    A Query Evaluation Method for Abductive Logic Programming. [Citation Graph (1, 0)][DBLP]
    JICSLP, 1992, pp:671-685 [Conf]
  4. Ken Satoh
    A Probabilistic Interpretation for Lazy Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    AAAI, 1990, pp:659-664 [Conf]
  5. Ken Satoh, Hidenori Okamoto
    Computing Circumscriptive Databases by Integer Programming: Revisited. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:429-435 [Conf]
  6. Ken Satoh
    Learning Taxonomic Relation by Case-Based Reasoning. [Citation Graph (0, 0)][DBLP]
    ALT, 2000, pp:179-193 [Conf]
  7. Ken Satoh
    Analysis of Case-Based Representability of Boolean Functions by Monotone Theory. [Citation Graph (0, 0)][DBLP]
    ALT, 1998, pp:179-190 [Conf]
  8. Ken Satoh, Ryuichi Nakagawa
    Discovering Critical Cases in Case-Based Reasoning. [Citation Graph (0, 0)][DBLP]
    AMAI, 2000, pp:- [Conf]
  9. Ken Satoh, Keiji Yamamoto
    Speculative computation with multi-agent belief revision. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2002, pp:897-904 [Conf]
  10. Ken Satoh
    Formalizing Retrieval Goal Change by Prioritized Circumscription - Preliminary Report. [Citation Graph (0, 0)][DBLP]
    CIA, 2003, pp:324-335 [Conf]
  11. 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]
  12. Martine Ceberio, Hiroshi Hosobe, Ken Satoh
    Speculative Constraint Processing with Iterative Revision for Disjunctive Answers. [Citation Graph (0, 0)][DBLP]
    CLIMA VI, 2005, pp:340-357 [Conf]
  13. Ken Satoh
    An Application of Global Abduction to an Information Agent Which Modifies a Plan Upon Failure - Preliminary Report. [Citation Graph (0, 0)][DBLP]
    CLIMA V, 2004, pp:213-229 [Conf]
  14. Ken Satoh
    Disambiguation by Prioritized Circumscription. [Citation Graph (0, 0)][DBLP]
    COLING, 1996, pp:901-906 [Conf]
  15. Kouichi Kumon, Hideo Masuzawa, Akihiro Itashiki, Ken Satoh, Yukio Sohma
    KABU-WAKE: A New Parallel Inference Method and Its Evaluation. [Citation Graph (0, 0)][DBLP]
    COMPCON, 1986, pp:168-172 [Conf]
  16. Ken Satoh
    Formalizing Retrieval Goal Change by Prioritized Abduction. [Citation Graph (0, 0)][DBLP]
    Intuitive Human Interfaces for Organizing and Accessing Intellectual Assets, 2004, pp:215-232 [Conf]
  17. Mina Akaishi, Ken Satoh, Yuzuru Tanaka
    An Associative Information Retrieval Based on the Dependency of Term Co-occurrence. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2004, pp:195-206 [Conf]
  18. Ken Satoh, Takeaki Uno
    Enumerating Maximal Frequent Sets Using Irredundant Dualization. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2003, pp:256-268 [Conf]
  19. Ken Satoh
    Constructing a Critical Casebase to Represent a Lattice-Based Relation. [Citation Graph (0, 0)][DBLP]
    Progress in Discovery Science, 2002, pp:214-223 [Conf]
  20. Noboru Iwayama, Ken Satoh, Jun Arima
    A Formalization of Generalization-Based Analogy in General Logic Programs. [Citation Graph (0, 0)][DBLP]
    ECAI, 1992, pp:129-133 [Conf]
  21. Ken Satoh
    Formalizing Soft Constraints by Interpretation Ordering. [Citation Graph (0, 0)][DBLP]
    ECAI, 1990, pp:585-590 [Conf]
  22. Ken Satoh
    A Top Down Proof Procedure for Default Logic by Using Abduction. [Citation Graph (0, 0)][DBLP]
    ECAI, 1994, pp:65-69 [Conf]
  23. Ken Satoh
    Translating Case-Based Reasoning into Abductive Logic Programming. [Citation Graph (0, 0)][DBLP]
    ECAI, 1996, pp:142-146 [Conf]
  24. Ken Satoh
    Using Two Level Abduction to Decide Similarity of Cases. [Citation Graph (0, 0)][DBLP]
    ECAI, 1998, pp:398-402 [Conf]
  25. Ken Satoh, Noboru Iwayama
    A Correct Goal-directed Proof Procedure for a General Logic Program with Integrity Constraints. [Citation Graph (0, 0)][DBLP]
    ELP, 1992, pp:24-44 [Conf]
  26. Seishi Okamoto, Ken Satoh
    An Average Predictive Accuracy of the Nearest Neighbor Classifier. [Citation Graph (0, 0)][DBLP]
    EWCBR, 1994, pp:101-112 [Conf]
  27. 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. [Citation Graph (0, 0)][DBLP]
    FGCS, 1992, pp:330-346 [Conf]
  28. Takeaki Uno, Ken Satoh
    Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization. [Citation Graph (0, 0)][DBLP]
    FIMI, 2003, pp:- [Conf]
  29. Hideo Masuzawa, Kouichi Kumon, Akihiro Itashiki, Ken Satoh, Yukio Sohma
    "Kabu-Wake" Parallel Inference Mechanism and It's Evaluation. [Citation Graph (0, 0)][DBLP]
    FJCC, 1986, pp:955-962 [Conf]
  30. Ken Kaneiwa, Ken Satoh
    Consistency Checking Algorithms for Restricted UML Class Diagrams. [Citation Graph (0, 0)][DBLP]
    FoIKS, 2006, pp:219-239 [Conf]
  31. Seishi Okamoto, Ken Satoh
    An Average-Case Analysis of k-Nearest Neighbor Classifier. [Citation Graph (0, 0)][DBLP]
    ICCBR, 1995, pp:253-264 [Conf]
  32. Ian T. Foster, Steve Gregory, Graem A. Ringwood, Ken Satoh
    A Sequential Implementation of Parlog. [Citation Graph (0, 0)][DBLP]
    ICLP, 1986, pp:149-156 [Conf]
  33. Toshiko Wakaki, Ken Satoh
    Computing Prioritized Circumscription by Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1995, pp:283-297 [Conf]
  34. 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]
  35. Hirofumi Katsuno, Ken Satoh
    A Unified View of Consequence Relation, Belief Revision and Conditional Logic. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1991, pp:406-412 [Conf]
  36. Toshiko Wakaki, Ken Satoh
    Compiling Prioritized Circumscription into Extended Logic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1997, pp:182-189 [Conf]
  37. Shin-ichi Minato, Ken Satoh, Taisuke Sato
    Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2550-2555 [Conf]
  38. Mina Akaishi, Koichi Hori, Ken Satoh
    Topic Tracer: a Visualization Tool for Quick Reference of Stories Embedded in Document Set. [Citation Graph (0, 0)][DBLP]
    IV, 2006, pp:101-106 [Conf]
  39. Ken Satoh, Takeaki Uno
    Enumerating Minimally Revised Specifications Using Dualization. [Citation Graph (0, 0)][DBLP]
    JSAI Workshops, 2005, pp:182-189 [Conf]
  40. Akihiro Yamamoto, Kouichi Hirata, Ken Satoh
    The Fourth Workshop on Learning with Logics and Logics for Learning (LLLL2006). [Citation Graph (0, 0)][DBLP]
    JSAI, 2006, pp:249-250 [Conf]
  41. Ken Satoh, Ken Kaneiwa, Takeaki Uno
    Contradiction Finding and Minimal Recovery for UML Class Diagrams. [Citation Graph (0, 0)][DBLP]
    ASE, 2006, pp:277-280 [Conf]
  42. Ken Satoh, Takeaki Uno
    Enumerating Minimal Explanations by Minimal Hitting Set Computation. [Citation Graph (0, 0)][DBLP]
    KSEM, 2006, pp:354-365 [Conf]
  43. Ken Satoh
    PAC-learning of Preference Relations over Interpretations in Lazy Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    Machine Intelligence 15, 1995, pp:285-297 [Conf]
  44. Ken Satoh
    Speculative computation and abduction for an autonomous agent. [Citation Graph (0, 0)][DBLP]
    NMR, 2002, pp:191-199 [Conf]
  45. Ken Satoh
    "All's well that ends well" - a proposal of global abduction. [Citation Graph (0, 0)][DBLP]
    NMR, 2004, pp:360-367 [Conf]
  46. Ken Satoh, Philippe Codognet, Hiroshi Hosobe
    Speculative Constraint Processing in Multi-agent Systems. [Citation Graph (0, 0)][DBLP]
    PRIMA, 2003, pp:133-144 [Conf]
  47. 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 Cox, Sandip Sen, Patrick Brézillon, Jean-Charles Pomerol, Roy M. Turner, Elise H. Turner
    Reports on the AAAI 1999 Workshop Program. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 2000, v:21, n:1, pp:95-100 [Journal]
  48. Jürgen Dix, João Alexandre Leite, Ken Satoh
    Introduction. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2004, v:42, n:1-3, pp:1-3 [Journal]
  49. Jürgen Dix, Fariba Sadri, Ken Satoh
    Introduction. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:37, n:1-2, pp:1-3 [Journal]
  50. Ken Satoh, Hidenori Okamoto
    Computing Circumscriptive Databases by Integer Programming: Revisited (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  51. Ken Satoh
    Consistency Management of Normal Logic Program by Top-down Abductive Proof Procedure [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  52. Jürgen Dix, João Alexandre Leite, Ken Satoh
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:70, n:5, pp:- [Journal]
  53. Ken Satoh
    Statutory Interpretation by Case-Based Reasoning through Abductive Logic Programming. [Citation Graph (0, 0)][DBLP]
    JACIII, 1997, v:1, n:2, pp:94-103 [Journal]
  54. Toshiko Wakaki, Ken Satoh, Katsumi Nitta
    Reasoning about Dynamic Preferences in Circumscriptive Theory by Logic Programming. [Citation Graph (0, 0)][DBLP]
    JACIII, 1997, v:1, n:2, pp:121-129 [Journal]
  55. Noboru Iwayama, Ken Satoh
    Computing abduction by using TMS with top-down expectation. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 2000, v:44, n:1-3, pp:179-206 [Journal]
  56. Ken Satoh
    Learning taxonomic relation by case-based reasoning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:1, pp:58-69 [Journal]
  57. Mina Akaishi, Yoshikiyo Kato, Ken Satoh, Koichi Hori
    Narrative based Topic Visualization for Chronological Data. [Citation Graph (0, 0)][DBLP]
    IV, 2007, pp:139-144 [Conf]

  58. Speculative Abductive Reasoning for Hierarchical Agent Systems. [Citation Graph (, )][DBLP]


  59. PAC-Learning of Weights in Multiobjective Function by Pairwise Comparison. [Citation Graph (, )][DBLP]


  60. First International Workshop on Juris-Informatics. [Citation Graph (, )][DBLP]


  61. Overview of JURISIN 2008. [Citation Graph (, )][DBLP]


  62. Computing Minimal Models by Positively Minimal Disjuncts. [Citation Graph (, )][DBLP]


  63. Towards "Kiga-kiku" Services on Speculative Computation. [Citation Graph (, )][DBLP]


  64. Disjunction of Causes and Disjunctive Cause: a Solution to the Paradox of Conditio Sine Qua Non using Minimal Abduction. [Citation Graph (, )][DBLP]


  65. Translating the Japanese Presupposed Ultimate Fact Theory into Logic Programming. [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002