|
- 有馬 淳,佐藤 健,非単調推論,知識プログラミング,古川康一,溝口文雄編,pp. 189 -- 214, 共立出版 (1988).
- 佐藤 健, 解釈の順序による柔らかい制約の定式化, 情報処理学会論文誌 Vol. 31, No.6, pp. 772 -- 782 (1990). 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).
- Satoh, K. and Aiba, A.,``Computing Soft Constraints by Hierarchical Constraint Logic Programming'',情報処理学会論文誌 Vol. 34, No.7, pp. 1555 -- 1569 (1993).
- 佐藤 健, 7.3章 論理と推論, コンパクト・エンサイクロペディア情報処理 pp. 258 -- 259 (1993).
- Satoh, K., Iwayama, N., ``A Query Evaluation Method for Abductive Logic Programming Based on Generalized Stable Models'', 人工知能学会誌 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).
- 佐藤 健,岡本 青史, 距離情報による類似度関数の重み学習について, 人工知能学会誌 Vol. 11, No.2, pp. 238 -- 245 (1996). 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).
- Satoh, K., ``A Goal-directed Procedure for an Extension Membership Problem in Propositional Arbitrary Default Theories'', 人工知能学会誌 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).
- 若木 利子, 佐藤 健, 論理プログラムへの翻訳による優先順位つき極小限定の計算, 人工知能学会誌 Vol. 11, No.5, pp. 786 -- 794 (1996). 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).
- 佐藤 健,岡本 青史, 事例の相対距離による類似度学習とその検索誤り率について, 人工知能学会誌 Vol. 12, No.4, pp. 600 -- 607 (1997).
- 佐藤 健, 事例ベース推論における動的類似性の仮説論理プログラミングによる実現, 人工知能学会誌 Vol. 12, No.6, pp. 901 -- 910 (1997). 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).
- 佐藤 健,「機械推論」, CD-ROM 世界大百科辞典, 日立デジタル平凡社(1998).
- 若木 利子, 佐藤 健, 拡張論理プログラミングへの意味論的関係に基づく変換による優先順位付き極小限定の計算, 人工知能学会誌 Vol. 14, No.3, 466 -- 472 (1999). 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).
- 岡本 英紀, 佐藤 健, 0-1整数計画法を用いた優先順位付き極小限定における極小モデルの計算, 人工知能学会誌 Vol. 15, No.3, pp. 511 -- 517 (2000).
- 佐藤 健, 仮説論理プログラミングによる極小変更仕様の計算およびその応用, コンピュータソフトウェア別冊,「ソフトウェア発展」, 日本ソフトウェア科学会編, pp. 109 -- 121 (2000). 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).
- 中越 智哉, 佐藤 健, 画像のグルーピングとグループ間類似度に基づく主観的類似検索, 情報処理学会研究会論文誌「データベース」Vol.42 No.Sig 1(TOD 8), pp. 21 -- 31 (2001).
- Ken Satoh, Polynomial PAC learnability of Learning Weights of Multi-Objective Functions by Pairwise Comparison, 情報処理学会研究会論文誌「数理モデル化と応用」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).
- 佐藤 健, 認知科学辞典(共同執筆),日本認知科学会編,p.208,p.400,p.428,p.590,p.641,p.691,p.739, p.756,p.809,p.864(2002).
- 佐藤 健, 極小性チェックを必要としない極小変更ソフトウェア仕様の導出, Proc. of FOSE02, pp. 143 -- 150 (2002).
- 佐藤 健, 井上 克己, 岩沼 宏治, 坂間 千秋, エージェント間通信におけるアブダクションによる投機的計算, コンピュータソフトウェア, Vol. 20 No.1, pp. 27 -- 35 (2003). 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).
- Satoh, K., 人工知能学辞典 (共著), 人工知能学会 (編),pp. 170-173, pp. 185, pp. 200-202 (2005).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- Satoh, K., ``Disambiguation by Prioritized Circumscription'', Proceedings of the Sixteenth International Conference on Computational Linguistics, pp. 901 -- 906, Copenhagen, Denmark (1996).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- 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)
- 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).
- 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).
- 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).
- 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).
- 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).
- 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).
- Satoh, K., Okamoto, H., ``Computing Circumscriptive Databases by Integer Programming: Revisited'', Proceedings of the AAAI-2000, pp. 429 -- 435, Austin, Texas, USA (2000).
- 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).
- 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).
- 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).
- 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).
- 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).
- Satoh, K., Formalizing Retrieval Goal Change by Prioritized Circumscription - Preliminary Report - Cooperative Information Agents VII, LNAI 2782, pp. 324 -- 335 (2003).
- Satoh, K., Computing Minimal Revised Specifications by Default Logic Proc. of Workshop on Intelligent Technologies in Software Engineering (WITSE2003) pp. 7 -- 12 (2003).
- 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)
- 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)
- 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)
- 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).
- 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).
- 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).
- 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).
- Satoh, K., Uno, T., ``Enumerating Minimally Revised Specifications using Dualization", Workshop on Learning with Logics and Logics for Learning, pp. 19 - 23 (2005).
- 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).
- 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).
- Ceberio, M., Hosobe, H., Satoh, K.,``Speculative Constraint Processing with Iterative Revision for Disjunctive Answers'', F. Toni and P.Torroni (eds.), Computational Logic in Multi-Agent Systems: 6th International Workshop, CLIMA VI, London, UK, June 27-29, 2005, Revised Selected and Invited Papers, LNAI 3900, pp. 340 - 357 (2006). A preliminary version appeared as Ceberio, M., Hosobe, H., Satoh, K.,``Speculative Constraint Processing with Iterative Revision for Disjunctive Answers'', Proc. of CLIMA-VI, pp. 119 -- 134, London, UK (2005).
- Satoh, K., Uno, T.,``Enumerating Minimally Revised Specifications Using Dualization'' T. Washio, A. Sakurai, K. Nakajima, H. Takeda, S. Tojo, M. Yokoo (eds.), New Frontiers in Artificial Intelligence: Joint JSAI 2005 Workshop Post-Proceedings, LNAI 4012, pp. 182 - 189 (2006). A preliminary version appeared as Satoh, K., Uno, T.,``Enumerating Minimal Revised Specification using Dualization'', Proc. of Workshop on Learning with Logics and Logics for Learning, pp. 19 -- 23, Kita-kyushu, Japan (2005).
- Akaishi, M., Hori, K., Satoh, K., "Topic Tracer: a Visualization Tool for Quick Reference of Stories Embedded in Document Set", Proceedings of the 10th International Conference on Information Visualisation (IV06), pp. 101 -- 106, London, UK (2006).
- Satoh, K., Uno, T., "Enumerating Minimal Explanations by Minimal Hitting Set Computation", Proceedings of the First International Conference on Knowledge Science, Engineering and Management (KSEM'06), LNAI 4092, pp. 354 -- 365, Guilin, China (2006).
- Satoh, K., Kaneiwa, K., Uno, T., "Contradiction Finding and Minimal Recovery for UML Class Diagrams", 21st IEEE/ACM International Conference on Automated Software Engineering (ASE2006), pp 277 -- 280, Tokyo, Japan (2006).
- Satoh, K., Tojo, S., "Disjunction of Causes and Disjunctive Cause: a Solution to the Paradox of 'Conditio Sine Qua Non' using Minimal Abduction", Legal Knowledge and Information Systems, JURIX 2006: The Nineteenth Annual Conference, pp. 163 -- 168, Paris, France (2006).
- Minato, S., Satoh, K., Sato, T., "Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-suppressed BDDs", Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 2550-2555, Hyderabad, India (2007).
- 鷲尾隆、樋口知之、井元清哉、玉田嘉紀、佐藤健、元田浩、グラフマイニングとその統計的モデリングへの応用、統計数理第54巻第2号, pp. 315-332 (2006)
|