Introduction of researcher

Revision    1
As of  2006.3.21      
 
[Name]  Satoh Ken
[Date of birth] 
1959/2/6 (47 years old)
[Doctoral degrees] 
Doctor of Science (Univ. of Tokyo)
[Affiliation / Position] 
Professor, Symbolic Reasoning Research, Foundations of Informatics Research Division
[Room]  1304
[Telephone]  +81-3-4212-2000
[Facsimile]  +81-3-3556-1916
[E-mail]  ksatoh at nii.ac.jp
[Personal home page]  http://research.nii.ac.jp/~ksatoh
[JST ReaD]  http://read.jst.go.jp/ddbs/plsql/KNKY_24?code=1000200081
[Research fields] 
Theoretical Foundation of Artificial Intelligence


<> Outline of current research
<> Education
<> Career
<> Awards
<> Teaching positions
<> Courses
<> Academic societies
<> Public activities
<> Most important publications (Top 10)
<> Most important activities (Top 10)
<> Refereed publications, published books
<> Patents / softwares / other works
<> Other publications
<> Speeches and oral presentations
<> Teaching experience
<> Competitive research funds


[Outline of current research] 

I have been working on research on AI for twenty years emphasizing on theoretical foundations.

I have been interested in mechanizing human reasoning such as nonmonotonic reasoning,

abductive reasoning, machine learning.

Nonmonotonic Reasoning: I have been studying nonmonotonic reasoning based on interpretation ordering. Especially, I showed relationship of the reasoning with probabilistic reasoning and belief revision. I also studied implementation of the reasoning using various techniques such as hierarchical constraint logic programming, extended logic programming and integer programming. Moreover I applied the reasoning to formalization of soft constraints and natural language disambiguation.

Abductive Reasoning: I proposed a proof procedure for abductive logic programming, and application of the procedure such as speculative computation in multi-agent system and software evolution.

Machine Learning: I have been studying a formalization of similarity-function. Especially, I showed an upper limit of minimal case base size for any Boolean functions if we use a set-difference similarity measure. In data-mining, I proposed a new algorithm to enumerate maximal frequent sets by using irredundant enumeration of minimal infrequent sets.
[Education] 

Faculty of Science, University of Tokyo (1977-1981)
[Career] 

2001 Professor, Foundations of Informatics Research Division, National Institute of Informatics

1995 Associate Professor, Faculty of Engineering, Hokkaido University

1992 Researcher, Fujitsu Laboratories Ltd.

1987 Researcher,Institute for New Generation Computer Technology

1981 Researcher, Fujitsu Laboratories Ltd.
[Awards] 

1990 Academic Promotion Prize for 40th Annual Meeting of IPSJ

2000 Research Promotion Prize in 1999 of JSAI

2003 Best Paper Award in PRIMA'03
[Teaching positions] 

1995-2000 Electorical Circuit (Hokkaido University, 2nd Grade)

1995-2000 Intelligent Software Engineering(Hokkaido University, 3rd Grade)

1995-2000 Computer Architecture(Hokkaido University, Master Course)

1995-2000 Specialized Exercise for CCS (Hokkaido University, Master Course)

1995-2000 Specialized Research I for CCS (Hokkaido University, Doctor Course)

1995-2000 Specialized Research II for CCS (Hokkaido University, Doctor Course)

1998-2002 Special Lecture In Information Science (University of Tokyo, as a part-time lecturer)
[Courses] 

Art of Intelligent Systems(biennial)

Reasoning Science(biennial)
[Academic societies] 

A member of IPSJ(1982-)

1992 FGCS’92 program committee member in foundation division

1992 Guest Co-editor, Journal of Theoretical Computer Science Vol. 122 No.1-2 on the Special Issue of FGCS’92

A member of JSAI(1993-)

1993-1995 A committee member of English publication in IPSJ

1993-1997 A local arrangement committee member of IJCAI’97

1994 A program committee member of CADE-12

1996 A program committee member of CADE-13

A member of JSSST(1998-)

1998 A program committee member of ECAI’98

1998 A program committee member of ALT’98

2000-2004 An editorial board member of JSAI journal

2001-2005 A councilor of JSAI

2002- 2006 An executive board member of JSSST

2002-2006 An editorial board member of JSSST journal

2002 A program committee member of ICML2002

2002 Program Co-chair of DS2002

2002 Vice program chair of IEEE ICDM2002

2002-2003 A program committee member of IJCAI’03

2002-2003 A senior program committee member of AAMAS’03

2003 A program committee member of DS2003

2003-2004　A senior program committee member of AAMAS’04

2004-2005 A program committee member of AAMAS'05

2004-2006 A chief of JSAI SIG on fundametal problems in AI

2004 A program committee member of JELIA'04

2004 A program committee member of ECAI’04

2004-2005 An advisory committee member of IJCAI'05

2005-2006 A program committee member of AAMAS'06

A member of IEICE(2005-)

2005 A program committee member of AAAI'05

2006 A program committee member of PRICAI'06

2006 A program committee member of JELIA'06
[Public activities] 

none
[Most important publications (Top 10)] 

  1. Satoh, K., ``Nonmonotonic Reasoning by Minimal Belief Revision'', Proceedings of the International Conference on Fifth Generation Computer Systems 1988, pp. 455 -- 462, Tokyo, Japan (1988).

  2. Satoh, K.,``A Probabilistic Interpretation for Lazy Nonmonotonic Reasoning'', Journal of Information Processing, Vol. 15, pp. 29 -- 39 (1992). A preliminary version appeared as ``A Probabilistic Interpretation for Lazy Nonmonotonic Reasoning'', Proceedings of the Eighth American Conference on Aritificial Intelligence, pp. 659 -- 664, Boston, Massachusetts, USA (1990).

  3. Katsuno, H., and Satoh, K., ``A Unified View of Consequence Relation, Belief Revision, and Conditional Logic'', G. Crocco, L. Farinas del Cerro and A. Herzig (eds.), Conditionals: from Philosophy to Computer Science, pp. 33 -- 65, Oxford Science Publications (1995). A preliminary version appeared in Proceedings of the Twelfth International Conference on Artificial Intelligence, pp. 406 -- 412, Sydney, Australia (1991).

  4. Satoh, K., "Learning Taxonomic Relation by Case-based Reasoning", Theoretical Computer Science, Vol. 348, pp. 58 - 69 (2005). A preliminary version appeared as Satoh, K., ``Learning Taxonomic Relation by Case-based Reasoning'', Proceedings of the Eleventh International Conference on Algorithmic Learning Theory, LNAI1968 pp. 179 -- 193 (2000).

  5. Satoh, K., ``Analysis of Case-Based Representability of Boolean Functions by Monotone Theory'', Proceedings of the Ninth International Conference on Algorithmic Learning Theory, LNAI1501 pp. 179 -- 190 (1998).

  6. Satoh, K., Uno, T., Enumerating Maximal Frequent Sets using Irredundant Dualization, Proc. of 6th International Conference on Discovery Science (DS2003), LNAI 2843, pp. 256 -- 268 (2003)
[Most important activities (Top 10)] 

none
[Refereed publications, published books] 

  1. Sohma, Y., Satoh, K., Kumon, K., Masuzawa, H. and Itashiki, A., ``A New Parallel Inference Mechanism Based on Sequential Processing'', J. V. Woods (ed.), Fifth Generation Computer Architectures, pp. 3 -- 14, Elsevier Science Publishers (1986).

  2. Kumon, K., Masuzawa, H., Itashiki, A., Satoh, K. and Sohma, Y., ``KABU-WAKE: A New Parallel Inference Method and Its Evaluation'', Proceedings of COMPCON86 Spring, pp. 168 -- 172 (1986).

  3. Masuzawa, H., Kumon, K., Itashiki, A., Satoh, K. and Sohma, Y.,``KABU-WAKE'' Parallel Inference Mechanism and Its Evaluation'', Proceedings of FJCC86, pp. 955 -- 962 (1986).

  4. Foster, I., Gregory, S., Ringwood, G. and Satoh, K.,``A Sequential Implementation of PARLOG'', Proceeding of the Third Internatioal Conference on Logic Programming, LNCS 225, pp. 149 -- 156, London, UK (1986).

  5. Satoh, K., ``Nonmonotonic Reasoning by Minimal Belief Revision'', Proceedings of the International Conference on Fifth Generation Computer Systems 1988, pp. 455 -- 462, Tokyo, Japan (1988).

  6. Arima, J., Satoh, K., ``Nonmonotonic Reasoning'', K. Furukawa and F. Mizoguchi (eds.), Knowledge-based Programming, pp. 189 -- 214, Kyouritsu Shuppan (1988) (in Japanese).

  7. Satoh, K., ``Relative Plausibility based on Model Ordering: Preliminary Report'', Z. W. Ras (ed.), Methodologies for Intelligent Systems, Vol 4, pp. 17 -- 24, North-Holland (1989).

  8. Satoh K., ``Formalizing Soft Constraints by Interpretation Ordering'', Transactions of Information Processing Society of Japan, Vol. 31, No.6, pp. 772 -- 782 (1990) (in Japanese). A preliminary English version appeared as ``Formalizing Soft Constraints by Interpretation Ordering'', Proceedings of the Ninth European Conference on Artificial Intelligence, pp. 585 -- 590, Stockholm, Sweden (1990).

  9. Satoh, K., ``Minimal Change -- A Criterion for Choosing between Competing Models'', P. Brazdil and K. Konolige (eds.), Machine Learning, Meta-Reasoning and Logics, pp. 257 -- 276, Kluwer Academic Publishers (1990).

  10. Satoh, K., ``Formalizing Nonmonotonic Reasoning by Preference Order'', Proceedings of the International Conference organized by the IPSJ to Commemorate the 30th Anniversary, Part II, pp. 155 -- 162, Tokyo, Japan (1990).

  11. Satoh, K. and Iwayama, N., ``Computing Abduction by Using the TMS'', Proceedings of the Eighth International Conference on Logic Programming, pp. 505 -- 518, Paris, France (1991).

  12. Satoh, K.,``A Probabilistic Interpretation for Lazy Nonmonotonic Reasoning'', Journal of Information Processing, Vol. 15, pp. 29 -- 39 (1992). A preliminary version appeared as ``A Probabilistic Interpretation for Lazy Nonmonotonic Reasoning'', Proceedings of the Eighth American Conference on Aritificial Intelligence, pp. 659 -- 664, Boston, Massachusetts, USA (1990).

  13. Iwayama, N., Satoh, K. and Arima, J., ``A Formalization of Generalization-based Analogy in General Logic Programs'', Proceedings of the Tenth European Conference on Artificial Intelligence, pp. 129 -- 133, Wien, Austria (1992).

  14. Satoh, K. and Aiba, A., ``Computing Soft Constraints by Hierarchical Constraint Logic Programming'', Transactions of Information Processing Society of Japan Vol. 34, No.7, pp. 1555 -- 1569 (1993).

  15. Satoh, K. and Iwayama, N.,``A Correct Goal-Directed Proof Procedure for a General Logic Program with Integrity Constraints'', E. Lamma and P. Mello (eds.), Extensions of Logic Programming, LNAI 660, pp. 24 -- 44, Springer-Verlag (1993).

  16. Satoh, K. ``Logic and Reasoning'', Compact Encyclopedia for Information Processing, Section 7.3, pp. 258 -- 259 (1993) (in Japanese).

  17. Okamoto, S. and Satoh, K., ``An Average-Case Prediction of the Nearest Neighbor Classifier'', P. J. Haton, M. Keane, and M. Manago (eds.), Advances in Case-Based Reasoning, LNAI 984, pp. 101 -- 112, Springer-Verlag (1995).

  18. Katsuno, H., and Satoh, K., ``A Unified View of Consequence Relation, Belief Revision, and Conditional Logic'', G. Crocco, L. Farinas del Cerro and A. Herzig (eds.), Conditionals: from Philosophy to Computer Science, pp. 33 -- 65, Oxford Science Publications (1995). A preliminary version appeared in Proceedings of the Twelfth International Conference on Artificial Intelligence, pp. 406 -- 412, Sydney, Australia (1991).

  19. Okamoto, S., Satoh K., ``An Average-case Analysis of k –Nearest Neighbor Classifier'', M. Veloso and A. Aamodt (eds.), Proceedings of The First International Conference on Case-Based Reasoning, LNAI 1010, pp. 253 -- 264, Springer-Verlag (1995). A preliminary version appeared as ``A Mathematical Predictive Accuracy for the Nearest Neighbor Classifier'', Proceedings of the Second European Workshop on Case-Based Reasoning, pp. 347 -- 355 (1994).

  20. Satoh, K., Iwayama, N., ``A Query Evaluation Method for Abductive Logic Programming Based on Generalized Stable Models'', Journal of Japanese Society of Artificial Intelligence, Vol. 11, No.1, pp. 137 -- 147 (1996). A preliminary version appeared as Satoh, K. and Iwayama, N., ``A Query Evaluation Method for Abductive Logic Programming'', Proceedings of the Joint International Conference and Symposium on Logic Programming, pp. 671 -- 685, Washington D.C., USA (1992).

  21. Satoh, K., Okamoto, S., ``Learning Weights in a Similarity Function from Distance Information'', Journal of Japanese Society of Artificial Intelligence, Vol. 11, No.2, pp. 238 -- 245 (1996) (in Japanese). A preliminary English version appeared as Satoh, K. and Okamoto, S., ``Toward PAC-Learning of Weights from Qualitative Distance Information'', Proceedings of 1994 AAAI Case-Based Reasoning Workshop, pp. 128 -- 132, Seatle, USA (1994).

  22. Satoh, K., ``A Goal-directed Procedure for an Extension Membership Problem in Propositional Arbitrary Default Theories'', Journal of Japanese Society of Artificial Intelligence, Vol. 11, No.2, pp. 290 -- 299 (1996). A preliminary version appeared as Satoh, K., ``A Top Down Proof Procedure for Default Logic by Using Abduction'', Proceedings of the Eleventh European Conference on Artificial Intelligence, pp. 65 -- 69, Amsterdam, the Netherlands (1994).

  23. Wakaki, T., Satoh, K., ``Computing Prioritized Circumscription via Compilation into Logic Programs'', Journal of Japanese Society of Artificial Intelligence, Vol. 11, No.5, pp. 786 -- 794 (1996) (in Japanese). A preliminary English version appeared as Wakaki, T. and Satoh, K., ``Computing Prioritized Circumscription by Logic Programming'', Proceedings of the Twelfth International Conference on Logic Programming, pp. 283 -- 297, Tokyo, Japan (1995).

  24. Satoh, K., ``Disambiguation by Prioritized Circumscription'', Proceedings of the Sixteenth International Conference on Computational Linguistics, pp. 901 -- 906, Copenhagen, Denmark (1996).

  25. Satoh, K., Okamoto, S., ``Learning Dynamic Similarity Metric Based on Relative Distance Information and Estimates of Its Retrieval Error'', Journal of Japanese Society of Artificial Intelligence, Vol. 12, No.4, pp. 600 -- 607 (1997) (in Japanese).

  26. Satoh, K., ``Implementing Dynamic Similarity in Case-Based Reasoning by Abductive Logic Programming'', Journal of Japanese Society of Artificial Intelligence, Vol. 12, No.6, pp. 901 -- 910 (1997) (in Japanese). A preliminary English version appeared as Satoh, K., ``Translating Case-Based Reasoning into Abductive Logic Programming'', Proceedings of the Twelfth European Conference on Artificial Intelligence, pp. 142 -- 146, Budapest, Hungary (1996).

  27. Satoh, K., ``Statutory Interpretation by Case-based Reasoning through Abductive Logic Programming'', Journal of Advanced Computational Intelligence, Vol. 1, No.2, pp. 94 -- 103 (1997).

  28. Wakaki, T., Satoh, K., Nitta, K., ``Reasoning about Dynamic Preferences in Circumscriptive Theory by Logic Programming'', Journal of Advanced Computational Intelligence, Vol. 1, No.2, pp. 121 -- 129 (1997).

  29. Wakaki, T., Satoh, K., Nitta, K., Sakurai, S., ``Finding Priorities of Circumscription Policy as a Skeptical Explanation in Abduction'', IEICE Transactions on Information and Systems, Vol. E81-D, No. 10, pp. 1111 -- 1120 (1998).

  30. Satoh, K., ``Automated Reasoning'', a chapter in CD-ROM Heibon-sha World Encyclopedia, Hitachi Digital Heibon-sha (1998) (in Japanese).

  31. Satoh, K., ``Computing Minimal Revised Logic Program by Abduction'', Proceedings of the International Workshop on the Principles of Software Evolution, IWPSE98, pp. 177 -- 182, Kyoto, Japan (1998).

  32. Satoh, K., ``Using Two Level Abduction to Decide Similarity of Cases'', Proceedings of the Thirteenth European Conference on Artificial Intelligence, pp. 398 -- 402, Brighton, UK (1998).

  33. Satoh, K., ``Analysis of Case-Based Representability of Boolean Functions by Monotone Theory'', Proceedings of the Ninth International Conference on Algorithmic Learning Theory, LNAI1501 pp. 179 -- 190 (1998).

  34. Satoh, K., ``Adding and Deleting Pollution Marker by Abductive Logic Programming(extended abstract)'', Proceedings of the First Asia-Pacific Workshop on Intelligent Software Engineering, pp. 48 -- 53, Singapore, Singapore (1998).

  35. Wakaki, T., Satoh, K., ``Computing Prioritized Circumscription by Compiling into Extended Logic Programs based on the Semantic Relationship'', Journal of Japanese Society of Artificial Intelligence, Vol. 14, No.3, pp. 466 -- 472 (1999) (in Japanese). A preliminary English version appeared as Wakaki, T., Satoh, K., ``Compiling Prioritized Circumscription into Extended Logic Programs'', Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pp. 182 -- 187, Nagoya, Japan (1997).

  36. Satoh, K., ``Consistency Management by Prioritized Minimal Revision'', Proceedings of the International Workshop on the Principles of Software Evolution, IWPSE99, pp. 125 -- 129, Fukuoka, Japan (1999)

  37. Iwayama, N., Satoh, K., ``Computing Abduction by Using TMS with Top-Down Expectation'', Journal of Logic Programming, Vol. 44 No.1-3, pp. 179 -- 206 (2000).

  38. Okamoto, H., Satoh, K., ``An Algorithm to Compute Minimal Models in Prioritized Circumscription by 0-1 Integer Programming'' Journal of Japanese Society of Artificial Intelligence, Vol. 15, No.3, pp. 511 -- 517 (2000) (in Japanese).

  39. Satoh, K., ``PAC-learning of Preference Relation over Interpretations in Lazy Nonmonotonic Reasoning'',H. Motoda and S. Muggleton (eds)., Machine Intelligence 15, Oxford University Press, pp. 285 -- 297 (2000).

  40. Satoh, K., ``Consistency Management of Normal Logic Program by Top-down Abductive Proof Procedure'', Proceedings of the Eighth International Workshop on Non-Monotonic Reasoning, Breckenridge, Colorado, USA (2000).

  41. Satoh, K., ``Minimal Revised Specification by Abductive Logic Programming - Computation and Application'', Computer Software, Vol. 18 No. 0, pp.109-121, A preliminary English version appeared as Satoh, K. ``Consistency Management in Software Engineering by Abduction'', Proceedings of the ICSE-2000 Workshop on Intelligent Software Engineering, pp. 90 -- 99, Limerick, Ireland (2000).

  42. Iwanuma, K., Inoue, K., Satoh, K., ``Completeness of Pruning Methods for Consequence Finding Procedure SOL'', Proceedings of the Third International Workshop on First-order Theorem Proving, pp. 89-100, St. Andrews, Scotland, UK (2000).

  43. Sakama, C., Inoue, K., Iwanuma, K., Satoh, K., ``A Defeasible Reasoning System in Multi-Agent Environments'', Proceedings of the CL2000 Workshop on Computational Logic in Multi Agent Systems, pp. 1 -- 6, London UK (2000).

  44. Sawada, T., Satoh, K., ``Composer Classification based on Patterns of Short Note Sequences'', Proceedings of the AAAI-2000 Workshop on AI and Music, pp. 24 -- 27,, Austin, Texas, USA (2000).

  45. Satoh, K., Okamoto, H., ``Computing Circumscriptive Databases by Integer Programming: Revisited'', Proceedings of the AAAI-2000, pp. 429 -- 435, Austin, Texas, USA (2000).

  46. Satoh, K., ``Formalizing Prioritized Consistency Management in Requirement Engineering'', T. Katayama, T. Tamai, and N. Yonezaki (eds), Proceedings of the International Symposium on Principles of Software Evolution, IEEE Computer Society, pp. 184 -- 188 (2000).

  47. Satoh, K., ``Minimal Revised Specification by Abductive Logic Programming -- Computation and Application'', Journal of Japan Society for Software Science and Technology, T. Katayama (eds), Special Issue on Software Evolution, pp. 109 -- 121 (2000) (in Japanese). A preliminary English version appeared as Satoh, K., ``Consistency Management in Software Engineering by Abduction'', Proceedings of the ICSE-2000 Workshop on Intelligent Software Engineering, pp. 90 -- 99, Limerick, Ireland (2000).

  48. Nakagoshi, T., Satoh, K., ``User-dependent Similar Image Retrieval Based on Image Grouping and Group Similarity'', IPSJ Transactions on Databases, Vol. 42, No.SIG 1 (TOD 8) pp. 21 -- 31 (2001) (in Japanese).

  49. Satoh, K., ``Polynomial PAC Learnability of Learning Weights of Multi-objective Functions by Pairwise Comparison'', IPSJ Transactions on Mathematical Modeling and Its Applications, Vol. 42, No.SIG 5 (TOM 4) pp. 1 -- 8 (2001). A preliminary abstract appeared as ``PAC-Learning of Weights in Multi-objective Function by Pairwise Comparison'', Proceedings of the Workshop on Applied Learning Theory, DOI-TR-154, pp. 27 -- 37, Kaiserslautern, Germany (1998).

  50. Satoh, K., ``Computing Minimal Belief Revision by Extended Logic Programming without Minimality Check'', Proceedings of IJCAI-01 Workshop on Abductive Reasoning, pp. 48 -- 55 (2001).

  51. Satoh, K., Yamamoto, K., ``Speculative Computation with Multi-Agent Belief Revision'', Proceedings of the First International Conference on Autonomous Agents and Multi-Agent Systems, pp. 897 -- 904, Bologna, Italy (2002).

  52. Satoh, K., ``Constructing a Critical Casebase to Represent a Lattice-Based Relation'', Setsuo Arikawa, Ayumi Shinohara (Eds.)., Progress in Discovery Science 2002, LNCS 2281 pp. 214 -- 223 (2002).

  53. Satoh, K., ``Nonmonotonic Reasoning and Consistency Management in Software Engineering'', Shi-Kuo Chang (ed.), Handbook of Software Engineering and Knowledge Engineering, Vol. 2, World Scientific, pp. 629 -- 644 (2002).

  54. Satoh, K., Dictionary of Cognitive Science (co-authored), Japanese Cognitive Science Society (ed.)，p.208，p.400，p.428，p.590，p.641，p.691，p.739, p.756，p.809，p.864(2002) (in Japanese).

  55. Satoh, K., Computing Minimal Revised Specification without Minimality Check, Proc. of FOSE02 (in Japanese), pp. 143 -- 150 (2002).

  56. Satoh, K., Inoue, K., Iwanuma, K., Sakama, C., Speculative Computation by Abduction in Agent Communication, Computer Software, Vol. 20 No.1, pp. 27 -- 35 (2003) (in Japanese). A preliminary English version appeared as Satoh, K., Inoue, K., Iwanuma, K., Sakama, C., ``Speculative Computation by Abduction under Incomplete Communication Environments'', Proceedings of the Fourth International Conference on MultiAgent Systems, pp. 263 -- 270, Boston, USA (2000).

  57. Satoh, K., Formalizing Retrieval Goal Change by Prioritized Circumscription - Preliminary Report - Cooperative Information Agents VII, LNAI 2782, pp. 324 -- 335 (2003).

  58. Satoh, K., Computing Minimal Revised Specifications by Default Logic Proc. of Workshop on Intelligent Technologies in Software Engineering (WITSE2003) pp. 7 -- 12 (2003).

  59. Satoh, K., Uno, T., Enumerating Maximal Frequent Sets using Irredundant Dualization, Proc. of 6th International Conference on Discovery Science (DS2003), LNAI 2843, pp. 256 -- 268 (2003)

  60. Satoh, K., Codognet, P., Hosobe, H., ``Speculative Constraint Processing in Multi-agent Systems'', Proc. of Sixth Pacific Rim International Workshop on Multi-Agents (PRIMA2003), LNAI 2891, pp. 133 -- 144 (2003)

  61. Uno, T., Satoh, K., ``Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization'', Online CEUR Workshop Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations (FIMI 2003), Melbourne, Florida, USA (2003)

  62. Satoh, K. ``"All's Well that Ends Well" - A Proposal of Global Abduction -'', Proceedings of the Tenth International Workshop on Non-Monotonic Reasoning, pp. 360 -- 367, Whislter, Canada (2004).

  63. Akaishi, M., Satoh, K., Tanaka. Y.,``An Associative Information Retrieval based on the Dependency of Term Co-occurrence'', Proc. of 7th International Conference on Discovery Science (DS2004), LNAI 3245, pp. 195 -- 206, Padova, Italy (2004).

  64. Satoh, K., ``Formalizing Retrieval Goal Change by Prioritized Abduction'', G. Grieser and Y. Tanaka (eds.), Intuitive Human Interfaces for Organizing and Accessing Intellectual Assets: International Workshop, Dagstuhl Castle, Germany, March 1-5, 2004, Revised Selected Papers, LNAI3359, pp. 215 -- 232 (2005).

  65. Satoh, K., ``An Application of Global Abduction to an Information Agent which Modifies a Plan upon Failure - Preliminary Report -'', J. Leite and P. Torroni (eds.), Computational Logic in Multi-Agent Systems, Revised Selected and Invited Papers, LNAI3487, pp. 213 -- 229 (2005). A preliminary version appeared as Satoh, K. ``An Application of Global Abduction to an Information Agent which Modifies a Plan upon Failure - Preliminary Report -'', Pre-Proceedings of CLIMA-V, pp. 150 -- 165, Lisbon, Portugal (2004).

  66. Satoh, K., Uno, T., ``Enumerating Minimally Revised Specifications using Dualization", Workshop on Learning with Logics and Logics for Learning, pp. 19 - 23 (2005).

  67. Ceberio, M., Hosobe, H., Satoh, K., ``Speculative Constraint Processing with Iterative Revision for Disjunctive Answers'', Pre-Proceedings of CLIMA-VI, London, UK, pp. 119 -- 134 (2005)

  68. Satoh, K., ``Speculative Computation and Abduction for an Autonomous Agent'', IEICE Transactions on Information and Systems, Vol. E88-D, No. 9, pp. 2031 -- 2038 (2005). A preliminary version appeared as Satoh, K., ``Speculative Computation and Abduction for an Autonomous Agent'', Proceedings of the Ninth International Workshop on Non-Monotonic Reasoning, pp. 191 -- 199, Toulouse, France (2002).

  69. Satoh, K., "Learning Taxonomic Relation by Case-based Reasoning", Theoretical Computer Science, Vol. 348, pp. 58 - 69 (2005). A preliminary version appeared as Satoh, K., ``Learning Taxonomic Relation by Case-based Reasoning'', Proceedings of the Eleventh International Conference on Algorithmic Learning Theory, LNAI1968 pp. 179 -- 193 (2000).

  70. Satoh, K., Encyclopedia of Artificial Intelligence (co-authored), Japanese Society of Artificial Intelligence (ed.)，pp. 170-173, pp. 185, pp. 200-202(2005) (in Japanese).

  71. Kaneiwa, K., Satoh, K., "Consistency Checking Algorithms for Restricted UML Class Diagrams", Proceedings of the Fourth International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2006), LNCS 3861, pp. 219 -- 239, Budapest, Hungary(2006).

[Patents / softwares / other works] 

  1. Satoh, K., Masuzawa, H., Itashiki, A., Kumon, K.: ``Pararell Processing Method'' (1985-120637) (in Japanese).

  2. Satoh, K., Okamoto, S.: ``Propositional Probability Determining Method and Apparatus, and Probabilistic Inference Apparatus''(European Patent No. 95118546.1).
[Other publications] 

  1. Satoh, K., ``Approaches for Yale Shooting Problem'', Journal of Japanese Society of Artificial Intelligence, Vol. 3, No.2, pp. 132 -- 138 (1988) (in Japanese).

  2. Matsumoto, Y., Satoh, K., ``Nonmonotonic Logic and Commonsense Reasoning'', Journal of Information Processing Society of Japan, Vol. 30, No.6, pp. 674 -- 683 (1989) (in Japanese). 

  3. Satoh, K., ``Nonmonotonic Reasoning'', IEICE, Seminar Notes on the Current Trend of AI, pp. 1 -- 17 (1990) (in Japanese). 

  4. Terasaki, S., Hawley, D. J., Sawada, H., Satoh, K., Menju, S., Kawagishi, T., Iwayama, N., Aiba, A., ``Parallel Constraint Logic Programming Language GDCC and its Parallel Constraint Solvers'', Proceedings of the Fifth Generation Computer Systems '92, pp. 330 -- 346, Tokyo, Japan (1992).

  5. Satoh, K., ``Logical Foundations of Artificial Intelligence'', Japanese Translation of Chapter 9 and Chapter 11, Ohm-sha (1993).

  6. Satoh, K., ``Artificial Intelligence --A Modern Approach--'', Japanese Translation of Chapter 14, Kyoritsu Shuppan (1997).

  7. Satoh, K., Matsubara, H., Shinohara, T., Kayama, T., ``Machine Learning on Similarity of Shgi Positions'', Proc. of 4th Japanese Game Programming Workshop, pp. 114 -- 123, Hakone, Japan (1997) (in Japanease).

  8. Satoh, K., Nakagawa, R., ``Approximating a Critical Case Base'', SIG-FAI/KBS-9902-18, pp. 103 – 109, winning paper for 2000 Research Promotion Prize in 1999 of JSAI (2000) (in Japanese).

  9. Iwayama, N., Satoh, K., ``Proof Proceures of Answer Set Semantics for Logic Programming'', Journal of Japanese Society of Artificial Intelligence, Vol. 16, No.5, pp. 655 -- 660 (2001) (in Japanese).

  10. Kaneiwa, K., Satoh, K., DL: Description Logics, Journal of Japanese Society of Artificial Intelligence,Vol 18, No 1, pp. 73 -- 82 (2003) (in Japanese).

  11. Satoh, K., The Present Symbolic Processing -- Knowledge Representation and Reasoning in Logic--, Instrument and Control, Vol 42, No 6, pp 463 -- 467 (2003) (in Japanese).

  12. Satoh, K., Logical Approach to AI using Learning, Journal of Japanese Society of Artificial Intelligence,Vol 18, No 5, pp. 546 -- 549 (2003) (in Japanese).

  13. Satoh, K., ``Speculative Contraint Processing (Extended Abstract)'', Proceedings of CP 2005 workshop on Distributed and Speculative Constraint Processing, (invited talk), Sitges, Spain, October 1 2005, pp. 3 -- 6 (2005).

[Speeches and oral presentations] 

  1. Satoh, K., ``On Probabilistic Semantics on Circumscription'', winning lecture for Academic Promotion Prize for 40th Annual Meeting of IPSJ (1990) (in Japanese).
[Teaching experience] 

  1. 1995-2001 supervision of 5 master students (Hokkaido University)
[Competitive research funds] 

  (1) Grant in aid for scientific research

  • 1998 ``Implementing Software Evolution in Abductive Logic Programming'' in Grant-in-Aid for Scientific Research on Priority Areas 290, ``Principles for Constructing Evolutionary Software'' (10139201) 1,700,000 Yen.
  • 1999 A Project Member in Grant-in-Aid for Scientific Research on Priority Areas 290, ``Principles for Constructing Evolutionary Software'' 1,600,000 Yen.
  • 1999-2000 ``Towards Qualitative Decision Theory based on Ordering over Possible Worlds'' in Grant-in-Aid for Exploratory Research (11878067) 1,800,000 Yen.
  • 1999-2000 ``Construction of Logical Multi-Agent Systems under Incomplete Communication Environment'' in Grant-in-Aid for Scientific Research (B) (11480070) 11,100,000 Yen.
  • 1999 ``Finding Critical Cases in Case-based Reasoning'' in Grant-in-Aid for Scientific Research on Priority Areas 294, ``Discovery Science'' (11130202) 1,900,000 Yen.
  • 2000 A Project Member in Grant-in-Aid for Scientific Research on Priority Areas 294, ``Discovery Science'' 1,800,000 Yen.
  • 2001-2003 ``Construction of Multi-Agent Systems with Speculative Computation Mechanism'' in Grant-in-Aid for Scientific Research (A) (13358004) 35,360,000 Yen.
  • 2001 ``Research on Software Evolution in Declarative Programming'' in Grant-in-Aid for Scientific Research on Priority Areas C, ``Informatics'' (13224088) 5,000,000 Yen.
  • 2002 ``Research on Software Evolution in Declarative Programming'' in Grant-in-Aid for Scientific Research on Priority Areas C, ``Informatics'' (14019084) 5,400,000 Yen
  • 2003 ``Research on Software Evolution in Declarative Programming'' in Grant-in-Aid for Scientific Research on Priority Areas C, ``Informatics'' (15017283) 4,800,000 Yen
  • 2004-2005 ``Research on Software Evolution in Declarative Programming'' in Grant-in-Aid for Scientific Research on Priority Areas C, ``Informatics'' (16016284) 9,900,000 Yen
  • 2004-2007 ``Development of Agent Technology for Reliable and Advanced Web Service Interoperability'' in Grant-in-Aid for Scientific Research (A) (16200010) 33,000,000 Yen
  (2) Public funding

  • 2002-2003 JSPS Japan Australia Common Research Funds 4,900,000 yen
  • 2004-2005 JSPS Japan-France Integrated Action Program "Sakura" 2,000,000 yen
  (3) Others

  • 1998-2003 Total: 5,500,000 Yen