Faculty Profiles - SAKAMA Chiaki

写真a

SAKAMA Chiaki

Name of department

Faculty of Systems Engineering, Intelligent Informatics

Job title

Professor

Concurrent post

Informatics Division（Professor）

Mail Address

Homepage

External link

Education

1995

-

Now

Kyoto University Graduate School of Engineering Dr Engineering
-

1985

Kyoto University Faculty of Engineering Dept. Information Science

Degree

Doctor of Engineering

Academic & Professional Experience

2005.04

-

Now

Wakayama University Faculty of Systems Engineering Professor
2002.04

-

2005.03

Wakayama University Center for Information Science Professor
1996.04

-

2002.03

Wakayama University Faculty of Systems Engineering Associate Professor
1995.04

-

1996.03

Wakayama University Faculty of Systems Engineering Lecturer
1989.05

-

1995.03

Advanced Software Technology and Mechtronics Research Institute Researcher
1986.04

-

1989.03

Institute for New Generation Computer Technology Researcher
1985.04

-

1989.04

Toshiba Corporation Researcher

▼display all

Research Areas

Informatics / Intelligent informatics

Classes (including Experimental Classes, Seminars, Graduation Thesis Guidance, Graduation Research, and Topical Research)

2023 Logical Thinking Liberal Arts and Sciences Subjects
2023 Intelligent Informatics Seminar Specialized Subjects
2023 Graduation Research Specialized Subjects
2023 Discrete Mathematics 2 Specialized Subjects
2023 Discrete Mathematics 1 Specialized Subjects
2023 Information Security and Ethics2 Specialized Subjects
2023 Information Security and Ethics1 Specialized Subjects
2022 Logical Thinking Liberal Arts and Sciences Subjects
2022 Discrete Mathematics 2 Specialized Subjects
2022 Discrete Mathematics 1 Specialized Subjects
2022 Intelligent Informatics Seminar Specialized Subjects
2022 Graduation Research Specialized Subjects
2022 Introductory Seminar in Systems Engineering Specialized Subjects
2021 Intelligent Informatics Seminar Specialized Subjects
2021 Discrete Mathematics 2 Specialized Subjects
2021 Discrete Mathematics 1 Specialized Subjects
2021 Graduation Research Specialized Subjects
2021 Graduation Research Specialized Subjects
2021 Logical Thinking Liberal Arts and Sciences Subjects
2020 Logical Thinking Liberal Arts and Sciences Subjects
2020 Graduation Research Specialized Subjects
2020 Introductory Seminar in Systems Engineering Specialized Subjects
2020 Discrete Mathematics 2 Specialized Subjects
2020 Discrete Mathematics 1 Specialized Subjects
2020 Intelligent Informatics Seminar Specialized Subjects
2019 Graduation Research Specialized Subjects
2019 Intelligent Informatics Seminar Specialized Subjects
2019 Introduction to Majors 1 Specialized Subjects
2019 Introduction to Majors 1 Specialized Subjects
2019 Discrete Mathematics Specialized Subjects
2019 Logical Thinking Liberal Arts and Sciences Subjects
2018 Introduction to Majors 1 Specialized Subjects
2018 Graduation Research Specialized Subjects
2018 Intelligent Informatics Seminar Specialized Subjects
2018 Introduction to Majors 1 Specialized Subjects
2018 Discrete Mathematics Specialized Subjects
2018 Logical Thinking Liberal Arts and Sciences Subjects
2017 Logical Thinking Liberal Arts and Sciences Subjects
2017 Graduation Research Specialized Subjects
2017 Introduction to Majors 1 Specialized Subjects
2017 Introduction to Majors 1 Specialized Subjects
2017 Introductory Seminar in Systems Engineering Specialized Subjects
2017 Discrete Mathematics Specialized Subjects
2016 Introduction to Majors 1 Specialized Subjects
2016 Introduction to Majors 1 Specialized Subjects
2016 Graduation Research Specialized Subjects
2016 Computer and Communication Sciences Seminar Specialized Subjects
2016 Introductory Seminar in Systems Engineering Specialized Subjects
2016 Scientific and Technical English Specialized Subjects
2016 Discrete Mathematics Specialized Subjects
2015 Scientific and Technical English Specialized Subjects
2015 Introduction to Majors 1 Specialized Subjects
2015 Introduction to Majors 1 Specialized Subjects
2015 Discrete Mathematics Specialized Subjects
2015 Graduation Research Specialized Subjects
2015 Computer and Communication Sciences Seminar Specialized Subjects
2014 Graduation Research Specialized Subjects
2014 Scientific and Technical English Specialized Subjects
2014 Discrete Mathematics Specialized Subjects
2014 Computer and Communication Sciences Seminar Specialized Subjects
2014 Introduction to Computer and Communication Sciences Specialized Subjects
2014 Introduction to information science Liberal Arts and Sciences Subjects
2014 Introductory Seminar Liberal Arts and Sciences Subjects
2014 Computer and Communication Sciences Seminar Specialized Subjects
2014 Discrete Mathematics Specialized Subjects
2014 Introduction to information science Liberal Arts and Sciences Subjects
2014 Scientific and Technical English Specialized Subjects
2014 Introduction to Computer and Communication Sciences Specialized Subjects
2013 Graduation Research Specialized Subjects
2013 Scientific and Technical English Specialized Subjects
2013 Discrete Mathematics Specialized Subjects
2013 Computer and Communication Sciences Seminar Specialized Subjects
2013 Introduction to Computer and Communication Sciences Specialized Subjects
2013 Introduction to information science Liberal Arts and Sciences Subjects
2013 Computer and Communication Sciences Seminar Specialized Subjects
2013 Introduction to information science Liberal Arts and Sciences Subjects
2013 Scientific and Technical English Specialized Subjects
2013 Discrete Mathematics Specialized Subjects
2013 Introduction to Computer and Communication Sciences Specialized Subjects
2012 Graduation Research Specialized Subjects
2012 Introduction to Computer and Communication Sciences Specialized Subjects
2012 Introductory Seminar Liberal Arts and Sciences Subjects
2012 Scientific and Technical English Specialized Subjects
2012 Discrete Mathematics Specialized Subjects
2012 Computer and Communication Sciences Seminar Specialized Subjects
2012 Introduction to information science Liberal Arts and Sciences Subjects
2012 Introduction to information science Liberal Arts and Sciences Subjects
2012 Discrete Mathematics Specialized Subjects
2012 Computer and Communication Sciences Seminar Specialized Subjects
2012 Introduction to Computer and Communication Sciences Specialized Subjects
2012 Scientific and Technical English Specialized Subjects
2011 Graduation Research Specialized Subjects
2011 Computer and Communication Sciences Seminar Specialized Subjects
2011 Modern Information Technology Specialized Subjects
2011 Scientific and Technical English Specialized Subjects
2011 Discrete Mathematics Specialized Subjects
2011 Introduction to Computer and Communication Sciences Specialized Subjects
2011 Introduction to information science Liberal Arts and Sciences Subjects
2010 Introduction to information science Liberal Arts and Sciences Subjects
2010 Graduation Research Specialized Subjects
2010 Introduction to Computer and Communication Sciences Specialized Subjects
2010 Introductory Seminar Liberal Arts and Sciences Subjects
2010 Discrete Mathematics Specialized Subjects
2010 Scientific and Technical English Specialized Subjects
2010 Computer and Communication Sciences Seminar Specialized Subjects
2009 Computer and Communication Sciences Seminar Specialized Subjects
2009 Scientific and Technical English Specialized Subjects
2009 Discrete Mathematics Specialized Subjects
2009 Introduction to Computer and Communication Sciences Specialized Subjects
2009 Graduation Research Specialized Subjects
2009 Introduction to information science Liberal Arts and Sciences Subjects
2008 Computer and Communication Sciences Seminar Specialized Subjects
2008 Scientific and Technical English Specialized Subjects
2008 Discrete Mathematics Specialized Subjects
2008 Introduction to Computer and Communication Sciences Specialized Subjects
2008 Graduation Research Specialized Subjects
2008 NA Liberal Arts and Sciences Subjects
2008 Introductory Seminar Specialized Subjects
2007 Scientific and Technical English Specialized Subjects
2007 Discrete Mathematics Specialized Subjects
2007 Introduction to Computer and Communication Sciences Specialized Subjects
2007 Graduation Research Specialized Subjects
2007 NA Liberal Arts and Sciences Subjects
2007 Computer and Communication Sciences Seminar Specialized Subjects

▼display all

Classes

2023 Systems Engineering SeminarⅠA Master's Course
2023 Systems Engineering SeminarⅠB Master's Course
2023 Systems Engineering SeminarⅡA Master's Course
2023 Systems Engineering SeminarⅡB Master's Course
2023 Advances in Artificial Intelligence Master's Course
2023 Systems Engineering Project SeminarⅠA Master's Course
2023 Systems Engineering Project SeminarⅠB Master's Course
2023 Systems Engineering Project SeminarⅡA Master's Course
2023 Systems Engineering Project SeminarⅡB Master's Course
2023 Systems Engineering Advanced Seminar Ⅰ Doctoral Course
2023 Systems Engineering Advanced Seminar Ⅰ Doctoral Course
2023 Systems Engineering Advanced Seminar Ⅱ Doctoral Course
2023 Systems Engineering Advanced Seminar Ⅱ Doctoral Course
2023 Systems Engineering Advanced Research Doctoral Course
2023 Systems Engineering Advanced Research Doctoral Course
2023 Systems Engineering Global Seminar Ⅰ Doctoral Course
2023 Systems Engineering Global Seminar Ⅰ Doctoral Course
2023 Systems Engineering Global Seminar Ⅱ Doctoral Course
2023 Systems Engineering Global Seminar Ⅱ Doctoral Course
2022 Systems Engineering Global Seminar Ⅱ Doctoral Course
2022 Systems Engineering Global Seminar Ⅰ Doctoral Course
2022 Systems Engineering Advanced Research Doctoral Course
2022 Systems Engineering Advanced Seminar Ⅱ Doctoral Course
2022 Systems Engineering Advanced Seminar Ⅰ Doctoral Course
2022 Systems Engineering Project SeminarⅡB Master's Course
2022 Systems Engineering Project SeminarⅡA Master's Course
2022 Systems Engineering Project SeminarⅠB Master's Course
2022 Systems Engineering Project SeminarⅠA Master's Course
2022 Advances in Artificial Intelligence Master's Course
2022 Systems Engineering SeminarⅡB Master's Course
2022 Systems Engineering SeminarⅡA Master's Course
2022 Systems Engineering SeminarⅠB Master's Course
2022 Systems Engineering SeminarⅠA Master's Course
2021 Systems Engineering Global Seminar Ⅱ Doctoral Course
2021 Systems Engineering Global Seminar Ⅰ Doctoral Course
2021 Systems Engineering Advanced Research Doctoral Course
2021 Systems Engineering Advanced Seminar Ⅱ Doctoral Course
2021 Systems Engineering Advanced Seminar Ⅰ Doctoral Course
2021 Systems Engineering Project SeminarⅡB Master's Course
2021 Systems Engineering Project SeminarⅡA Master's Course
2021 Systems Engineering Project SeminarⅠB Master's Course
2021 Systems Engineering Project SeminarⅠA Master's Course
2021 Advances in Artificial Intelligence Master's Course
2021 Systems Engineering SeminarⅡB Master's Course
2021 Systems Engineering SeminarⅡA Master's Course
2021 Systems Engineering SeminarⅠB Master's Course
2021 Systems Engineering SeminarⅠA Master's Course
2020 Systems Engineering Global Seminar Ⅱ Doctoral Course
2020 Systems Engineering Global Seminar Ⅰ Doctoral Course
2020 Systems Engineering Advanced Research Doctoral Course
2020 Systems Engineering Advanced Seminar Ⅱ Doctoral Course
2020 Systems Engineering Advanced Seminar Ⅰ Doctoral Course
2020 Systems Engineering Project SeminarⅡB Master's Course
2020 Systems Engineering Project SeminarⅡA Master's Course
2020 Systems Engineering Project SeminarⅠB Master's Course
2020 Systems Engineering Project SeminarⅠA Master's Course
2020 Advances in Artificial Intelligence Master's Course
2020 Systems Engineering SeminarⅡB Master's Course
2020 Systems Engineering SeminarⅡA Master's Course
2020 Systems Engineering SeminarⅠB Master's Course
2020 Systems Engineering SeminarⅠA Master's Course
2019 Advances in Artificial Intelligence Master's Course
2019 Systems Engineering Advanced Research Doctoral Course
2019 Systems Engineering Advanced Research Doctoral Course
2019 Systems Engineering SeminarⅡB Master's Course
2019 Systems Engineering SeminarⅡA Master's Course
2019 Systems Engineering SeminarⅠB Master's Course
2019 Systems Engineering SeminarⅠA Master's Course
2019 Systems Engineering Project SeminarⅡB Master's Course
2019 Systems Engineering Project SeminarⅡA Master's Course
2019 Systems Engineering Project SeminarⅠB Master's Course
2019 Systems Engineering Project SeminarⅠA Master's Course
2018 Systems Engineering Global Seminar Ⅱ Doctoral Course
2018 Systems Engineering Global Seminar Ⅱ Doctoral Course
2018 Systems Engineering Advanced Research Doctoral Course
2018 Systems Engineering Advanced Research Doctoral Course
2018 Systems Engineering Advanced Seminar Ⅱ Doctoral Course
2018 Systems Engineering Advanced Seminar Ⅱ Doctoral Course
2018 Systems Engineering Project SeminarⅡB Master's Course
2018 Systems Engineering Project SeminarⅡA Master's Course
2018 Systems Engineering Project SeminarⅠB Master's Course
2018 Systems Engineering Project SeminarⅠA Master's Course
2018 Systems Engineering SeminarⅡB Master's Course
2018 Systems Engineering SeminarⅡA Master's Course
2018 Systems Engineering SeminarⅠB Master's Course
2018 Systems Engineering SeminarⅠA Master's Course
2018 Advances in Artificial Intelligence Master's Course
2017 Systems Engineering Advanced Research Doctoral Course
2017 Systems Engineering Advanced Seminar Ⅱ Doctoral Course
2017 Systems Engineering Advanced Research Doctoral Course
2017 Systems Engineering Advanced Seminar Ⅱ Doctoral Course
2017 Systems Engineering Project SeminarⅡB Master's Course
2017 Systems Engineering Project SeminarⅡA Master's Course
2017 Systems Engineering Project SeminarⅠB Master's Course
2017 Systems Engineering Project SeminarⅠA Master's Course
2017 Advances in Artificial Intelligence Master's Course
2017 Systems Engineering SeminarⅡB Master's Course
2017 Systems Engineering SeminarⅡA Master's Course
2017 Systems Engineering SeminarⅠB Master's Course
2017 Systems Engineering SeminarⅠA Master's Course
2016 Systems Engineering Advanced Research Doctoral Course
2016 Systems Engineering Advanced Research Doctoral Course
2016 Systems Engineering Advanced Seminar Ⅰ Doctoral Course
2016 Systems Engineering Advanced Seminar Ⅰ Doctoral Course
2016 Systems Engineering Project SeminarⅡB Master's Course
2016 Systems Engineering Project SeminarⅡA Master's Course
2016 Systems Engineering Project SeminarⅠB Master's Course
2016 Systems Engineering Project SeminarⅠA Master's Course
2016 Advances in Artificial Intelligence Master's Course
2016 Systems Engineering SeminarⅡB Master's Course
2016 Systems Engineering SeminarⅡA Master's Course
2016 Systems Engineering SeminarⅠB Master's Course
2016 Systems Engineering SeminarⅠA Master's Course
2015 Advances in Artificial Intelligence
2015 Systems Engineering Advanced Seminar Ⅱ
2015 Systems Engineering Advanced Research
2015 Systems Engineering SeminarⅡA
2015 Systems Engineering SeminarⅠA
2015 Systems Engineering Project SeminarⅡA
2015 Systems Engineering Project SeminarⅠA
2015 Systems Engineering SeminarⅡB
2015 Systems Engineering SeminarⅠB
2015 Systems Engineering Project SeminarⅡB
2015 Systems Engineering Project SeminarⅠB
2014 Systems Engineering Advanced Research
2014 Systems Engineering Advanced Research
2014 Systems Engineering Advanced Seminar Ⅱ
2014 Systems Engineering Advanced Seminar Ⅱ
2014 Systems Engineering Advanced Seminar Ⅰ
2014 Systems Engineering Advanced Seminar Ⅰ
2014 Systems Engineering Project SeminarⅡB
2014 Systems Engineering Project SeminarⅡA
2014 Systems Engineering Project SeminarⅠB
2014 Systems Engineering Project SeminarⅠA
2014 Advances in Artificial Intelligence
2014 Systems Engineering SeminarⅡB
2014 Systems Engineering SeminarⅡA
2014 Systems Engineering SeminarⅠB
2014 Systems Engineering SeminarⅠA
2014 NA
2014 NA
2014 NA
2014 Systems Engineering SeminarⅠA
2014 Systems Engineering Project SeminarⅡB
2014 Systems Engineering Project SeminarⅡA
2014 Systems Engineering Project SeminarⅠB
2014 Advances in Artificial Intelligence
2013 Systems Engineering Project SeminarⅠA
2013 Systems Engineering Advanced Research
2013 Systems Engineering Advanced Research
2013 Systems Engineering Advanced Seminar Ⅱ
2013 Systems Engineering Advanced Seminar Ⅱ
2013 Systems Engineering Advanced Seminar Ⅰ
2013 Systems Engineering Advanced Seminar Ⅰ
2013 Systems Engineering Project SeminarⅡB
2013 Systems Engineering Project SeminarⅡA
2013 Systems Engineering Project SeminarⅠB
2013 Systems Engineering Project SeminarⅠA
2013 Advances in Artificial Intelligence
2013 Systems Engineering SeminarⅡB
2013 Systems Engineering SeminarⅡA
2013 Systems Engineering SeminarⅠB
2013 Systems Engineering SeminarⅠA
2013 Systems Engineering SeminarⅡA
2013 Systems Engineering SeminarⅠA
2013 Systems Engineering Project SeminarⅡA
2013 Systems Engineering Project SeminarⅠA
2013 Advances in Artificial Intelligence
2012 Advances in Artificial Intelligence
2012 Systems Engineering Advanced Seminar Ⅱ
2012 Systems Engineering Advanced Seminar Ⅰ
2012 Systems Engineering Advanced Research
2012 Systems Engineering SeminarⅡA
2012 Systems Engineering SeminarⅠA
2012 Systems Engineering Project SeminarⅡA
2012 Systems Engineering Project SeminarⅠA
2012 Systems Engineering Advanced Seminar Ⅱ
2012 Systems Engineering Advanced Seminar Ⅰ
2012 Systems Engineering Advanced Research
2012 Systems Engineering SeminarⅡB
2012 Systems Engineering SeminarⅠB
2012 Systems Engineering Project SeminarⅡB
2012 Systems Engineering Project SeminarⅠB
2012 NA Master's Course
2012 NA Master's Course
2012 Systems Engineering Advanced Seminar Ⅱ
2012 Systems Engineering Advanced Seminar Ⅱ
2012 Systems Engineering Project SeminarⅡB
2012 Systems Engineering Project SeminarⅡA
2012 Systems Engineering Project SeminarⅠB
2012 Systems Engineering Project SeminarⅠA
2012 Advances in Artificial Intelligence
2011 Systems Engineering Project SeminarⅡB
2011 Systems Engineering Project SeminarⅡA
2011 Systems Engineering Project SeminarⅠB
2011 Systems Engineering Project SeminarⅠA
2011 Systems Engineering Advanced Research
2011 Systems Engineering Advanced Research
2011 NA
2011 NA
2011 Systems Engineering Advanced Seminar Ⅱ
2011 Systems Engineering Advanced Seminar Ⅱ
2011 Systems Engineering Advanced Seminar Ⅰ
2011 Systems Engineering Advanced Seminar Ⅰ
2011 Advances in Artificial Intelligence
2010 NA Master's Course
2010 NA Master's Course
2010 NA Master's Course
2010 NA Master's Course
2010 Advances in Artificial Intelligence Master's Course
2009 Advances in Artificial Intelligence Master's Course
2009 NA Master's Course
2009 NA Master's Course
2009 NA Master's Course
2009 NA Master's Course
2008 Advances in Artificial Intelligence Master's Course
2008 NA Master's Course
2008 NA Master's Course
2008 NA Master's Course
2008 NA Master's Course
2007 Advances in Artificial Intelligence Master's Course
2007 NA Master's Course
2007 NA Master's Course
2007 NA Master's Course
2007 NA Master's Course

▼display all

Satellite Courses

2014 Information Science and Technology

Research Interests

computational logic
Knowledge Representation and Reasoning
Program Transformation
multiagent system
Formal Argumentation
Logic Programming
Artificial Intelligence

▼display all

Published Papers

Linear Algebraic Partial Evaluation of Logic Programs

Tuan Nguyen Quoc, Katsumi Inoue, Chiaki Sakama

Proceedings of IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI) 355 - 362 2024.11 [Refereed]
Argument and Belief

Chiaki Sakama （Part： Lead author )

Proceedings of the 10th International Conference on Computational Models of Argument (COMMA) ( IOS Press ) 241 - 252 2024.09 [Refereed]
Human Conditional Reasoning in Answer Set Programming

Chiaki Sakama （Part： Lead author )

Theory and Practice of Logic Programming 24 ( 1 ) 157 - 192 2024.01 [Refereed]

DOI
A Formal Analysis of Hollis' Paradox

Thomas Ågotnes, Chiaki Sakama （Part： Last author )

Lecture Notes in Computer Science 14329 306 - 321 2023.10 [Refereed]
Linear Algebraic Abduction with Partial Evaluation

Tuan Nguyen, Katsumi Inoue, Chiaki Sakama

Practical Aspects of Declarative Languages ( Springer Nature Switzerland ) 197 - 215 2023

DOI
Interlinking Logic Programs and Argumentation Frameworks

Chiaki Sakama, Tran Cao Son （Part： Lead author )

19th International Workshop on Non-Monotonic Reasoning (NMR-2021) 322 - 335 2022.11 [Refereed]

DOI
Enhancing Linear Algebraic Computation of Logic Programs Using Sparse Representation.

Tuan Nguyen Quoc, Katsumi Inoue, Chiaki Sakama

New Generation Computing 40 ( 1 ) 225 - 254 2022

DOI
Logic programming in tensor spaces.

Chiaki Sakama, Katsumi Inoue, Taisuke Sato （Part： Lead author )

Annals of Mathematics and Artificial Intelligence 89 ( 12 ) 1133 - 1153 2021.12 [Refereed]

DOI
Predicting Air Ticket Demand using Deep Neural Networks

Kodai Imanaka, Chiaki Sakama （Part： Corresponding author )

IEEE International Conference on Big Data 2021.12 [Refereed]
Linear Algebraic Computation of Propositional Horn Abduction

Tuan Nguyen Quoc, Katsumi Inoue, Chiaki Sakama

IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI) ( IEEE ) 240 - 247 2021.11 [Refereed]

DOI
Feature Learning by Least Generalization

Hien D. Nguyen, Chiaki Sakama （Part： Corresponding author )

30th International Conference on Inductive Logic Programming/1st International Joint Conference on Learning & Reasoning (IJCLR) 2021.10 [Refereed]
Deception in Epistemic Causal Logic

Chiaki Sakama （Part： Lead author )

2nd International Workshop on Deceptive AI 2021.08 [Refereed]
An Efficient Reasoning Method on Logic Programming using Partial Evaluation in Vector Spaces

Hien D. Nguyen, Chiaki Sakama, Taisuke Sato, Katsumi Inoue （Part： Corresponding author )

Journal of Logic and Computation 31 ( 5 ) 1298 - 1316 2021.03 [Refereed]
A Principle-based Robustness Analysis of Admissibility-based Argumentation Semantics

Tjitze Rienstra, Chiaki Sakama, Leendert van der Torre, Beishui Liao

Argument & Computation 11 ( 3 ) 305 - 339 2020.11 [Refereed]
Epistemic Argumentation Framework: Theory and Computation

Chiaki Sakama, Tran Cao Son （Part： Lead author )

Journal of Artificial Intelligence Research 69 1103 - 1126 2020.11 [Refereed]
Enhancing Linear Algebraic Computation of Logic Programs Using Sparse Representation

Tuan Nguyen Quoc, Katsumi Inoue, Chiaki Sakama （Part： Last author )

Proceedings 36th International Conference on Logic Programming (Technical Communications), EPTCS 325 40 ( 1 ) 192 - 205 2020.09 [Refereed]

DOI
From 3-valued Semantics to Supported Model Computation for Logic Programs in Vector Spaces.

Taisuke Sato, Chiaki Sakama, Katsumi Inoue

In: Proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART 2020; Valletta, Malta, 22-24 February 2020) ( SCITEPRESS ) 758 - 765 2020.02 [Refereed]

DOI
Ordering Argumentation Frameworks.

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

in: Proceedings of the 15th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2019), Lecture Notes in Artificial Intelligence ( Springer ) 11726 87 - 98 2019.09 [Refereed]

DOI
A New Algorithm for Computing Least Generalization of a Set of Atoms

Hien D. Nguyen, Chiaki Sakama

in: Proceedings of the 29th International Conference on Inductive Logic Programming (ILP 2019 2019.08 [Refereed]
Epistemic Argumentation Framework.

Chiaki Sakama, Tran Cao Son （Part： Lead author )

in: Proceedings of the 16th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2019), Lecture Notes in Artificial Intelligence ( Springer ) 11670 718 - 732 2019.08 [Refereed]

DOI
Learning Inference Rules from Data.

Chiaki Sakama, Katsumi Inoue, Tony Ribeiro （Part： Lead author )

KI - Kunstliche Intelligenz 33 ( 3 ) 267 - 278 2019 [Refereed]

DOI
Disjunctive Abduction.

Katsumi Inoue, Chiaki Sakama

New Generation Computing 37 ( 2 ) 219 - 243 2019 [Refereed]

DOI
Partial Evaluation of Logic Programs in Vector Spaces.

Chiaki Sakama, Hien D. Nguyen, Taisuke Sato, Katsumi Inoue （Part： Lead author )

in: Proceedings of the 11th International Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2018),CoRR abs/1811.11435 2018 [Refereed]
Abducing Relations in Continuous Spaces.

Taisuke Sato, Katsumi Inoue, Chiaki Sakama

in: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI-18) ( ijcai.org ) 1956 - 1962 2018 [Refereed]

DOI
Abduction in argumentation frameworks.

Chiaki Sakama （Part： Lead author )

Journal of Applied Non-Classical Logics 28 ( 2-3 ) 218 - 239 2018 [Refereed]

DOI
Computing Logic Programming Semantics in Linear Algebra.

Hien D. Nguyen, Chiaki Sakama, Taisuke Sato, Katsumi Inoue

in: Proceedings of the 12th International Conference on Multi-disciplinary Trends in Artificial Intelligence (MIWAI 2018), Lecture Notes in Artificial Intelligence ( Springer ) 11248 32 - 48 2018 [Refereed]

DOI
Representing Argumentation Frameworks in Answer Set Programming.

Chiaki Sakama, Tjitze Rienstra （Part： Lead author )

Fundamenta Informaticae 155 ( 3 ) 261 - 292 2017 [Refereed]

DOI
A Causal Theory of Speech Acts.

Chiaki Sakama （Part： Lead author )

in: Proceedings of the 6th International Conference on Logic, Rationality and Interaction (LORI VI), Lecture Notes in Computer Science ( Springer ) 10455 658 - 663 2017 [Refereed]

DOI
Linear Algebraic Characterization of Logic Programs.

Chiaki Sakama, Katsumi Inoue, Taisuke Sato （Part： Lead author )

in: Proceedings of the 10th International Conference on Knowledge Science, Engineering and Management (KSEM 2017), Lecture Notes in Artificial Intelligence ( Springer ) 1041 520 - 533 2017 [Refereed]

DOI
Abduction, conversational implicature and misleading in human dialogues.

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

Logic Journal of the IGPL, 24 ( 4 ) 526 - 541 2016 [Refereed]

DOI
Abduction, Conversational Implicature, and Misleading

Chiaki Sakama, Katsumi Inoue

The International Conference on Model-Based Reasoning in Science and Technology (MBR’015_ITALY; Sestri Levante, Italy) 2015.06 [Refereed]
Learning Delayed Influences of Biological Systems

Tony Ribeiro, Morgan Magnin, Katsumi Inoue, Chiaki Sakama

Frontiers in Bioengineering and Biotechnology 2 ( 81 ) 2015 [Refereed]
Learning Inference by Induction.

Chiaki Sakama, Tony Ribeiro, Katsumi Inoue （Part： Lead author )

in: Proceedings of the 25th International Conference on Inductive Logic Programming (ILP 2015), Lecture Notes in Artificial Intelligence ( Springer ) 9575 183 - 199 2015 [Refereed]

DOI
Multiagent Collaborative Search with Self-Interested Agents

Ryuki Shimoji, Chiaki Sakama

2015 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY (WI-IAT), VOL 2 ( IEEE COMPUTER SOC ) 242 - 249 2015 [Refereed]

　View Summary

This paper presents an experimental study on collaborative search by distributed autonomous agents. We consider a problem such that multiple agents search for target objects in a field, and communicate with each other to exchange information of objects. Agents have six different strategies: cooperative, skeptical, free rider, liar, skeptical liar and solitary. These strategies characterize behaviors of agents for transmitting/receiving information in different ways. We observe the effect of self-interested agents who act non-cooperatively or even act deceptively to increase their own profits. We identify situations in which self-interested agents have advantages and investigate conditions which are effective to suppress the development of self-interested agents.

DOI
Abduction and Conversational Implicature (Extended Abstract).

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

7th International Conference on Model-based Reasoning in Scientific and Technology (MBR'15) ( AAAI Press ) 2015 [Refereed]
Persistence and monotony properties of argumentation semantics

Tjitze Rienstra, Chiaki Sakama, Leendert van der Torre

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ( Springer Verlag ) 9524 211 - 225 2015 [Refereed]

　View Summary

We study a number of properties concerning the behaviour of semantics for Dung style abstract argumentation when the argumentation framework changes. The properties are concerned with how the evaluation of an argumentation framework changes if an attack between two arguments is added or removed. The results provide insight into the behaviour of these semantics in a dynamic context.

DOI
Can Machines Learn Logics?

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

in: Proceedings of the 8th International Conference on Artificial General Intelligence (AGI-15), Lecture Notes in Artificial Intelligence ( Springer ) 9205 341 - 351 2015 [Refereed]

DOI
On the Issue of Argumentation and Informedness.

Martin Caminada, Chiaki Sakama

in: Proceedings of the 2nd International Workshop on Argument for Agreement and Assurance (AAA 2015), New Frontiers in Artificial Intelligence, Lecture Notes in Artificial Intelligence 10091 317 - 330 2015 [Refereed]

DOI
Representing Argumentation Frameworks in Answer Set Programming

Chiaki Sakama, Tjitze Rienstra （Part： Lead author )

in: Proc. 1st International Workshop on Argumentation and Logic Programming (ArgLP 2015) 2015 [Refereed]
A Formal Account of Deception.

Chiaki Sakama

in: Proceedings of the AAAI Fall 2015 Symposium on Deceptive and Counter-Deceptive Machines, Technical Report FS-15-03, AAAI Press ( AAAI Press ) 34 - 41 2015 [Refereed]
Learning Multi-valued Biological Models with Delayed Influence from Time-Series Observations.

Tony Ribeiro, Morgan Magnin, Katsumi Inoue, Chiaki Sakama

in: Proceedings of the 14th IEEE International Conference on Machine Learning and Applications (ICMLA'15) ( IEEE ) 25 - 31 2015 [Refereed]

DOI
A formal account of dishonesty.

Chiaki Sakama, Martin Caminada, Andreas Herzig （Part： Lead author )

Logic Journal of the IGPL 23 ( 2 ) 259 - 294 2015 [Refereed]

DOI
Learning from interpretation transition

Katsumi Inoue, Tony Ribeiro, Chiaki Sakama

Machine Learning 94 ( 1 ) 51 - 79 2014.01 [Refereed]

　View Summary

We propose a novel framework for learning normal logic programs from transitions of interpretations. Given a set of pairs of interpretations (I,J) such that J=T P (I), where T P is the immediate consequence operator, we infer the program P. The learning framework can be repeatedly applied for identifying Boolean networks from basins of attraction. Two algorithms have been implemented for this learning task, and are compared using examples from the biological literature. We also show how to incorporate background knowledge and inductive biases, then apply the framework to learning transition rules of cellular automata. © 2013 The Author(s).

DOI
Counterfactual Reasoning in Argumentation Frameworks

Chiaki Sakama （Part： Lead author )

Frontiers in Artificial Intelligence and Applications ( IOS Press ) 266 385 - 396 2014 [Refereed]

　View Summary

In a formal argumentation framework, one is interested in whether a particular argument is accepted or not under argumentation semantics. When an argument A is accepted, on the other hand, one may ask a question 'what if A were rejected?' We formulate such counterfactual reasoning in abstract argumentation frameworks. Based on Lewis's logic, we define two counterfactual conditionals in AF and investigate formal properties. We also argue counterfactual dependencies in AF and modal interpretation of AF in terms of counterfactual conditionals.

DOI
Formalizing negotiations using logic programming

Tran Cao Son, Enrico Pontelli, Ngoc-Hieu Nguyen, Chiaki Sakama

ACM Transactions on Computational Logic ( Association for Computing Machinery ) 15 ( 2 ) 12 2014 [Refereed]

　View Summary

The article introduces a logical framework for negotiation among dishonest agents. The framework relies on the use of abductive logic programming as a knowledge representation language for agents to deal with incomplete information and preferences. The article shows how intentionally false or inaccurate information of agents can be encoded in the agents' knowledge bases. Such disinformation can be effectively used in the process of negotiation to have desired outcomes by agents. The negotiation processes are formulated under the answer set semantics of abductive logic programming, and they enable the exploration of various strategies that agents can employ in their negotiation. A preliminary implementation has been developed using the ASP-Prolog platform. © 2014 ACM.

DOI
Abduction in argumentation frameworks and its use in debate games

Chiaki Sakama （Part： Lead author )

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ( Springer Verlag ) 8417 285 - 303 2014 [Refereed]

　View Summary

This paper studies an abduction problem in formal argumentation frameworks. Given an argument, an agent verifies whether the argument is justified or not in its argumentation framework. If the argument is not justified, the agent seeks conditions to explain the argument in its argumentation framework. We formulate such abductive reasoning in argumentation semantics and provide its computation in logic programming. Next we apply abduction in argumentation frameworks to reasoning by players in debate games. In debate games, two players have their own argumentation frameworks and each player builds claims to refute the opponent. A player may provide false or inaccurate arguments as a tactic to win the game. We show that abduction is used not only for seeking counter-claims but also for building dishonest claims in debate games.

DOI
Computing Least Generalization by Anti-combination

Mikio Yoshida, Chiaki Sakama

24th International Conference on Inductive Logic Programming (ILP 2014) 2014 [Refereed]
Evolution of Self-interested Agents: An Experimental Study

Naoki Yamada, Chiaki Sakama

MULTI-DISCIPLINARY TRENDS IN ARTIFICIAL INTELLIGENCE ( SPRINGER-VERLAG BERLIN ) 8271 329 - 340 2013 [Refereed]

　View Summary

In this paper, we perform an experimental study to examine the evolution of self-interested agents in cooperative agent societies. To this end, we realize a multiagent system in which agents initially behave altruistically by sharing information of food. After generations of a genetic algorithm, we observe the emergence of selfish agents who do not share food information. The experimental results show the process of evolving self-interested agents in resource-restrictive environments, which is observed in nature and in human society.
Learning dishonesty

Chiaki Sakama （Part： Lead author )

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7842 225 - 240 2013 [Refereed]

　View Summary

Children behave dishonestly as a way of managing problems in daily life. Then our primary interest of this paper is how children learn dishonesty and how one could model human acquisition of dishonesty using machine learning techniques. We first observe the structural similarities between dishonest reasoning and induction, and then characterize mental processes of dishonest reasoning using logic programming. We argue how one develops behavioral rules for dishonest acts and refines them to more advanced rules. © 2013 Springer-Verlag.

DOI
A BDD-Based Algorithm for Learning from Interpretation Transition

Tony Ribeiro, Katsumi Inoue, Chiaki Sakama

in: Proceedings of the 23rd International Conference on Inductive Logic Programming (ILP), Lecture Notes in Artificial Intelligence ( SPRINGER-VERLAG BERLIN ) 8812 47 - 63 2013 [Refereed]

　View Summary

In recent years, there has been an extensive interest in learning the dynamics of systems. For this purpose, a new learning method called learning from interpretation transition has been proposed recently [1]. However, both the run time and the memory space of this algorithm are exponential, so a better data structure and an efficient algorithm have been awaited. In this paper, we propose a new learning algorithm of this method utilizing an efficient data structure inspired from Ordered Binary Decision Diagrams. We show empirically that using this representation we can perform the same learning task faster with less memory space.

DOI
Debate Games in Logic Programming

Chiaki Sakama （Part： Lead author )

in: Declarative Programming and Knowledge Management, Lecture Notes in Artificial Intelligence 8439 185 - 201 2013 [Refereed]
Abduction, Unpredictability and Garden of Eden

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

Logic Journal of the IGPL 21 ( 6 ) 980 - 998 2013 [Refereed]
A Formal Model of Dishonest Communication

Chiaki Sakama （Part： Lead author )

Workshop on Formal Models of Communication 2012 [Refereed] [Invited]
Confidentiality-Preserving Publishing of EDPs for Credulous and Skeptical Users

Katsumi Inoue, Chiaki Sakama, Lena Wiese

in: Proceedings of the 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011), Lecture Notes in Artificial Intelligence 7773 134 - 151 2012 [Refereed]
Oscillating behavior of logic programs

Katsumi Inoue, Chiaki Sakama

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7265 345 - 362 2012 [Refereed] [Invited]

　View Summary

We examine oscillation behavior of normal logic programs. Both the Gelfond-Lifschitz operator and the T P operator are used to update Herbrand interpretations, and any interpretation finally reaches in an oscillator. It has been shown that the supported model semantics of normal logic programs can characterize point attractors of Boolean networks. We here newly define supported classes of normal logic programs to investigate periodic oscillation induced by the T P operator, and apply them to characterize cycle attractors of Boolean networks. We also relate stable classes and supported classes of normal logic programs. © 2012 Springer-Verlag Berlin Heidelberg.

DOI
Dishonest Arguments in Debate Games

Chiaki Sakama （Part： Lead author )

Computational Models of Argument ( IOS PRESS ) 245 177 - 184 2012 [Refereed]

　View Summary

In this paper we consider a debate game between two players in which a player may provide false or inaccurate arguments as a tactic to win the game. We formulate a debate game using a formal argumentation framework and investigate situation where a player may provide dishonest arguments in the game. We also argue how a player can detect dishonest arguments of the opponent player.

DOI
Inductive equivalence in clausal logic and nonmonotonic logic programming

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

Machine Learning 83 ( 1 ) 1 - 29 2011.04 [Refereed]

　View Summary

This paper provides a logical framework for comparing inductive capabilities among agents having different background theories. A background theory is called inductively equivalent to another background theory if the two theories induce the same hypotheses for any observation. Conditions of inductive equivalence change depending on the logic of representation languages and the logic of induction or inductive logic programming (ILP). In this paper, we consider clausal logic and nonmonotonic logic programs as representation languages for background theories. Then we investigate conditions of inductive equivalence in four different frameworks of induction, cautious induction, brave induction, learning from satisfiability, and descriptive induction . We observe that several induction algorithms in Horn ILP systems require weaker conditions of equivalence under restricted problem settings. We address that inductive equivalence can be used for verification and evaluation of induction algorithms, and argue problems for optimizing background theories in ILP. © 2010 The Author(s).

DOI
Formalizing commitments using action languages

Tran Cao Son, Enrico Pontelli, Chiaki Sakama

Proceedings of the 9th International Workshop on Declarative Agent Languages and Technologies (DALT 2011), Lecture Notes in Artificial Intelligence 7169 ( Association for the Advancement of Artificial Intelligence ) 7169 67 - 83 2011 [Refereed]

　View Summary

This paper presents an action language, called Lmt, for repre- senting and reasoning about commitments in multi-agent do- mains. The language is an extension of the language L, with new features motivated by the problem of representing and reasoning about commitments. These features include time, delayed effects, ir/reversible effects, concurrent actions, and multi-agents, for specifying and reasoning about narratives in multi-agent domains. The paper provides a transition-based semantics for Lmt, which makes it possible to define an en- tailment relation between queries and multi-agent narratives with time constraints. The paper also demonstrates how fea- tures and properties of commitments can be described in this action language. In particular, it shows how Lmtcan handle both simple commitment actions as well as complex commit- ment protocols. Furthermore, the semantics of Lmtprovides a uniform solution to different problems in reasoning about commitments such as the problem of (i) verifying whether an agent fails (or succeeds) to deliver on its commitments
(ii) identifying outstanding commitments
and (iii) suggest- ing ways to satisfy outstanding commitments.
An experiment in formalizing commitments using action languages

Tran Cao Son, Enrico Pontelli, Chiaki Sakama

AAAI Spring Symposium - Technical Report ( AI Access Foundation ) SS-11-06 168 - 171 2011

　View Summary

This paper investigates the use of high-level action languages for representing and reasoning about commitments in multiagent domains. The paper introduces the language ℒmt with features motivated by the problem of representing commitments
in particular, it shows how ℒmt can handle both simple commitment actions and complex commitment protocols. The semantics of ℒmt provides a uniform solution to different problems in reasoning about commitments, e.g., the problem of (i) verifying whether an agent fails (or succeeds) to deliver on its commitments
(ii) identifying pending commitments
and (iii) suggesting ways to satisfy pending commitments. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.
ASP-prolog for negotiation among dishonest agents

Ngoc-Hieu Nguyen, Tran Cao Son, Enrico Pontelli, Chiaki Sakama

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6645 331 - 344 2011 [Refereed]

　View Summary

This paper describes a platform to develop negotiating agents, whose knowledge and rules of behavior are represented as Abductive Logic Programs. The platform implements a flexible negotiation framework. Negotiating agents can operate with multiple goals and incomplete knowledge, and dynamically modify their goals depending on the progress of the negotiation exchanges. Differently from other frameworks, agents can operate dishonestly, by generating false statements or statements that are not substantiated by the agents' knowledge. The proposed platform has been implemented using the ASP-Prolog platform. © 2011 Springer-Verlag Berlin Heidelberg.

DOI
Logical Definitions of Lying

Chiaki Sakama （Part： Lead author )

in: Proceedings of the 14th International Workshop on Trust in Agent Societies (TRUST11), 2011 [Refereed]
Dishonest Reasoning by Abduction

Chiaki Sakama （Part： Lead author )

in: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11) 1063 - 1068 2011 [Refereed]
Exploring relations between answer set programs

Katsumi Inoue, Chiaki Sakama

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6565 91 - 110 2011 [Refereed]

　View Summary

Equivalence and generality relations over logic programs have been proposed in answer set programming to semantically compare information contents of logic programs. In this paper, we overview previous relations of answer set programs, and propose a general framework that subsumes previous relations. The proposed framework allows us to compare programs possibly having non-minimal answer sets as well as to explore new relations between programs. Such new relations include relativized variants of generality relations over logic programs. By selecting contexts for comparison, the proposed framework can represent weak, strong and uniform variants of generality, inclusion and equivalence relations. These new relations can be applied to comparison of abductive logic programs and coordination of multiple answer set programs. © 2011 Springer-Verlag Berlin Heidelberg.

DOI
A logical formulation for negotiation among dishonest agents

Chiaki Sakama, Tran Cao Son, Enrico Pontelli （Part： Lead author )

IJCAI International Joint Conference on Artificial Intelligence 1069 - 1074 2011 [Refereed]

　View Summary

The paper introduces a logical framework for negotiation among dishonest agents. The framework relies on the use of abductive logic programming as a knowledge representation language for agents to deal with incomplete information and preferences. The paper shows how intentionally false or inaccurate information of agents could be encoded in the agents' knowledge bases. Such disinformation can be effectively used in the process of negotiation to have desired outcomes by agents. The negotiation processes are formulated under the answer set semantics of abductive logic programming and enable the exploration of various strategies that agents can employ in their negotiation.

DOI
A Logical Account of Lying

Chiaki Sakama, Martin Caminada, Andreas Herzig （Part： Lead author )

LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2010 ( SPRINGER-VERLAG BERLIN ) 6341 286 - 299 2010 [Refereed]

　View Summary

This paper aims at providing a formal account of lying - a dishonest attitude of human beings. We first formulate lying under propositional modal logic and present basic properties for it. We then investigate why one engages in lying and how one reasons about lying. We distinguish between offensive and defensive lies, or deductive and abductive lies, based on intention behind the act. We also study two weak forms of dishonesty, bullshit and deception, and provide their logical features in contrast to lying. We finally argue dishonesty postulates that agents should try to satisfy for both moral and self-interested reasons.
Interacting Answer Sets

Chiaki Sakama, Tran Cao Son （Part： Lead author )

COMPUTATIONAL LOGIC IN MULTI-AGENT SYSTEMS ( SPRINGER-VERLAG BERLIN ) 6214 122 - + 2010 [Refereed]

　View Summary

We consider agent societies represented by logic programs. Four different types of social interactions among agents, cooperation, competition, norms, and subjection, are formulated as interactions between answer sets of different programs. Answer sets satisfying conditions of interactions represent solutions coordinated in a multiagent society. A unique feature of our framework is that answer set interactions are specified outside of individual programs. This enables us to freely change the social specifications among agents without the need of modifying individual programs and to separate beliefs of agents from social requirements over them. Social interactions among agents are encoded in a single logic program using constraints. Coordinated solutions are then computed using answer set programming.
Exploring Relations between Answer Set Programs

Katsumi Inoue, Chiaki Sakama

Proceedings of the Symposium on Constructive Mathematics in Computer Science [Also to appear in: Marcello Balduccini and Tran Cao Son (eds.), Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning: Essays in Honour of Michael Gelfond,・・・ 72 - 91 2010 [Refereed]

　View Summary

Proceedings of the Symposium on Constructive Mathematics in Computer Science [Also to appear in: Marcello Balduccini and Tran Cao Son (eds.), Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning: Essays in Honour of Michael Gelfond, Lecture Notes in Artificial Intelligence, Springer, 2011.]
The Many Faces of Deception

Chiaki Sakama, Martin Caminada （Part： Lead author )

in: Proceedings of the Thirty Years of Nonmonotonic Reasoning (NonMon@30) 2010 [Refereed]
Brave Induction: A Logical Framework for Learning from Incomplete Information

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

Machine Learning 76 ( 1 ) 3 - 35 2009 [Refereed]

DOI
Negotiation Using Logic Programming with Consistency Restoring Rules

Tran Cao Son, Chiaki Sakama

21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS ( IJCAI-INT JOINT CONF ARTIF INTELL ) 930 - 935 2009 [Refereed]

　View Summary

We formalize negotiations using logic programming with consistency restoring rules (or CR-Prolog) [Balduccini and Gelfond, 2003]. Our formulation deals with incomplete information, preferences, and changing goals. We assume that each agent is equipped with a knowledge base for negotiation which consists of a CR-program, a set of possible assumptions, and a set of ordered goals. We use the notion of an answer set as a means to formalize the basic notions of negotiation such as proposal, response, negotiation, negotiation tree (protocol), etc. and discuss their properties.
Logic Programming for Multiagent Planning with Negotiation

Tran Cao Son, Enrico Pontelli, Chiaki Sakama

LOGIC PROGRAMMING ( SPRINGER-VERLAG BERLIN ) 5649 99 - + 2009 [Refereed]

　View Summary

Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their goals. One way for the agents to interact is through negotiations. Integration of negotiation in multiagent planning has not been extensively investigated and a systematic way for this task has yet to be found. We develop a generic model for negotiation in dynamic environments and apply it to generate joint-plans with negotiation for multiple agents. We identify the minimal requirements for such a model and propose a general scheme for one-to-one negotiations. This model of negotiation is instantiated to deal with dynamic knowledge of planning agents. We demonstrate how logic programming can be employed as a uniform platform to support both planning and negotiation, providing an ideal testbed for experimenting with multiagent planning with negotiations.
Reasoning and Planning with Cooperative Actions for Multiagents Using Answer Set Programming

Tran Cao Son, Chiaki Sakama （Part： Last author )

Proceedings of the 6th International Workshop on Declarative Agent Languages and Technologies (DALT'09), Lecture Notes in Artificial Intelligence ( Springer ) 5948 208 - 227 2009 [Refereed]
Equivalence Issues in Abduction and Induction,

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

Journal of Applied Logic 7 ( 3 ) 318 - 328 2009 [Refereed]
Social Default Theories

Chiaki Sakama （Part： Lead author )

LOGIC PROGRAMMING AND NONMONOTONIC REASONING, PROCEEDINGS ( SPRINGER-VERLAG BERLIN ) 5753 470 - 476 2009 [Refereed]

　View Summary

This paper studies a default logic for social reasoning in multiagent systems. A social default, theory is a collection of default theories with which each agent reasons and behaves by taking attitudes of other agents into account. The semantics of a social default theory is given as social extensions which represent the agreement of beliefs of individual agents hi a society. We show the use of social default theories for representing social altitudes of agents and for reasoning ill cooperative planning and negotiation among multiple agents.
Coordination in answer set programming

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

ACM Transactions on Computational Logic 9 ( 2 ) Article A9 (30 pages) 2008.03 [Refereed]

　View Summary

This article studies a semantics of multiple logic programs, and synthesizes a program having such a collective semantics. More precisely, the following two problems are considered: given two logic programs P1 and P2, which have the collections of answer sets AS(P1) and AS(P2), respectively
(i) find a program Q which has the set of answer sets such that AS(Q) = AS(P1) AS(P2)
(ii) find a program R which has the set of answer sets such that AS(R) = AS(P1) ∩ AS(P2). A program Q satisfying the condition (i) is called generous coordination of P1 and P2
and R satisfying (ii) is called rigorous coordination of P1 and P2. Generous coordination retains all of the answer sets of each program, but permits the introduction of additional answer sets of the other program. By contrast, rigorous coordination forces each program to give up some answer sets, but the result remains within the original answer sets for each program. Coordination provides a program that reflects the meaning of two or more programs. We provide methods for constructing these two types of coordination and address its application to logic-based multi-agent systems. © 2008 ACM.

DOI
Comparing Abductive Theories

Katsumi Inoue, Chiaki Sakama

ECAI 2008, PROCEEDINGS ( IOS PRESS ) 178 35 - + 2008 [Refereed]

　View Summary

This paper introduces two methods for comparing explanation power of different abductive theories. One is comparing explainability for observations, and the other is comparing explanation contents for observations. Those two measures are represented by generality relations over abductive theories. The generality relations are naturally related to the notion of abductive equivalence introduced by Inoue and Sakama. We also analyze the computational complexity of these relations.

DOI
Inductive Negotiation in Answer Set Programming

Chiaki Sakama （Part： Lead author )

in: Proceedings of the 6th International Workshop on Declarative Agent Languages and Technologies (DALT'08) , Lecture Notes in Artificial Intelligence 5397 143 - 160 2008 [Refereed]
Negotiation by Induction

Chiaki Sakama （Part： Lead author )

Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'08), 1459 - 1462 2008 [Refereed]
Brave Induction

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

INDUCTIVE LOGIC PROGRAMMING, ILP 2008 ( SPRINGER-VERLAG BERLIN ) 5194 261 - + 2008 [Refereed]

　View Summary

This paper considers the following induction problem. Given the background knowledge B and an observation 0, find a hypothesis H such that a consistent theory B A H has a minimal model satisfying O. We call this type of induction brave induction. Brave induction is different from explanatory induction in ILP, which requires that 0 is satisfied in every model of B A H. Brave induction is useful for learning disjunctive rules from observations, or learning from the background knowledge containing indefinite or incomplete information. We develop an algorithm for computing brave induction, and extend it to induction in answer set programming.
Identifying Cellular Automata Rules

Ken-ichi Maeda, Chiaki Sakama

Journal of Cellular Automata 2 ( 1 ) 1 - 20 2007 [Refereed]
Constructing Consensus Logic Programs

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

Logic-based Program Synthesis and Transformation: Revised and Selected papers from the 16th International Symposium (LOPSTR'06), Lecture Notes in Computer Science 4407 26 - 42 2007 [Refereed]
Equivalence Issues in Abduction and Induction

Chiaki Sakama, Katsumi Inoue

Proceedings of the 2007 International Workshop on Abduction and Induction in Artificial Intelligence and Bioinformatics (AIAI '07) 82 - 95 2007 [Refereed]
Generality and Equivalence Relations in Default Logic

Katsumi Inoue, Chiaki Sakama

Proceedings of the 22nd Conference on Artificial Intelligence (AAAI-07) 434 - 439 2007 [Refereed]
On the Existence of Answer Sets in Normal Extended Logic Programs

Martin Caminada, Chiaki Sakama （Part： Last author )

n: Proceedings of the 7th IJCAI International Workshop on Nonmontonic Reasoning, Action and Change (NRAC'07) 25 - 32 2007 [Refereed]
Negotiation by Abduction and Relaxation

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

in: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'07) 1018 - 1025 2007 [Refereed]
Abductive equivalence in first-order logic

Katsumi Inoue, Chiaki Sakama

Logic Journal of the IGPL 14 ( 2 ) 333 - 346 2006.03 [Refereed]

　View Summary

In Artificial Intelligence, abduction is often formalized in first-order logic. In this article, we focus on the problem of identifying equivalence of two abductive theories represented in first-order logic. To this end, two definitions of equivalence are given for abduction. Explainable equivalence requires that two abductive theories have the same explainability for any observation. On the other hand, explanatory equivalence guarantees that any observation has exactly the same explanations in each abductive theory. Explanatory equivalence is a stronger notion than explainable equivalence. In first-order logic, explainable equivalence can be verified by the notion of extensional equivalence in default theories, while explanatory equivalence reduces to logical equivalence between background theories. We also show the complexity results for abductive equivalence. © 2006 Oxford University Press.

DOI
Combining answer sets of nonmonotonic logic programs

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

COMPUTATIONAL LOGIC IN MULTI-AGENT SYSTEMS ( SPRINGER-VERLAG BERLIN ) 3900 320 - 339 2006 [Refereed]

　View Summary

This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. Given two programs P-1 and P-2, which have the sets of answer sets AS(P-1) and AS(P-2), respectively; find a program Q which has answer sets as minimal sets S boolean OR T for S from AS(P-1) and T from AS(P-2). The program Q combines answer sets of P-1 and P-2, and provides a compositional semantics of two programs. Such program composition has application to coordinating knowledge bases in multi-agent environments. We provide methods for computing program composition and discuss their properties.

DOI
On Abductive Equivalence

Katsumi Inoue, Chiaki Sakama

Model-Based Reasoning in Science and Engineering. Cognitive Science, Epistemology, Logic, Studies in Logic 333 - 352 2006 [Refereed]
Generality Relations in Answer Set Programming

Katsumi Inoue, Chiaki Sakama

in: Proceedings of the 22nd International Conference on Logic Programming (ICLP'06), Lecture Notes in Computer Science 4079 211 - 225 2006 [Refereed]
Ordering default theories and nonmonotonic logic programs

Chiaki Sakama （Part： Lead author )

THEORETICAL COMPUTER SCIENCE ( ELSEVIER SCIENCE BV ) 338 ( 1-3 ) 127 - 152 2005.06 [Refereed]

　View Summary

First-order theories are ordered under logical entailment based on the amount of information derived from theories. In default logic, on the other hand, a theory contains default information as well as definite information. To order default theories, distinguishing different sorts of information is necessary to assess the information content of a default theory. For this purpose, we first introduce a multi-valued interpretation of default theories using a ten-valued bilattice. It distinguishes between definite and credulous/skeptical default information derived from a theory, and is used for ordering default theories based on their information contents. We then apply the technique to order nonmonotonic logic programs under the answer set semantics. The results of this paper provide a method for comparing default theories or nonmonotonic logic programs in a manner different from the conventional extension/model-based viewpoint. Moreover, they have important application to induction from nonmonotonic theories. (c) 2004 Elsevier B.V. All rights reserved.

DOI
Induction from answer sets in nonmonotonic logic programs

Chiaki Sakama （Part： Lead author )

ACM Transactions on Computational Logic 6 ( 2 ) 203 - 231 2005.04 [Refereed]

　View Summary

Inductive logic programming (ILP) realizes inductive machine learning in computational logic. However, the present ILP mostly handles classical clausal programs, especially Horn logic programs, and has limited applications to learning nonmonotonic logic programs. This article studies a method for realizing induction in nonmonotonic logic programs. We consider an extended logic program as a background theory, and introduce techniques for inducing new rules using answer sets of the program. The produced new rules explain positive/negative examples in the context of inductive logic programming. The proposed methods extend the present ILP techniques to a syntactically and semantically richer framework, and contribute to a theory of nonmonotonic ILP. © 2005.

DOI
Inductive Equivalence of Logic Programs

Chiaki Sakama, Katsumi Inoue

Stefan Kramer and Bernhard Pfahringer (eds.), Inductive Logic Programming: Proceedings of the 15th International Conference (ILP 2005), Lecture Notes in Artificial Intelligence 3625 312 - 329 2005 [Refereed]
Coordination between Logical Agents

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

in: Proceedings of the 5th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA-V), Lecture Notes in Artificial Intelligence ( SPRINGER-VERLAG BERLIN ) 3487 161 - 177 2005 [Refereed]

　View Summary

In this paper we suppose an agent that has a knowledge base written in logic programming and sets of beliefs under the answer set semantics. We then consider the following two problems: given two logic programs P-1 and P-2, which have the sets of answer sets AS(P-1) and AS(P-2), respectively; (i) find a program Q which has the set of answer sets such that AS(Q) = AS(P-1) boolean OR AS(P-2); (ii) find a program R which has the set of answer sets such that AS(R) = AS(P-1) boolean AND AS(P-2). A program Q satisfying the condition (i) is called generous coordination of P-1 and P-2; and R satisfying (ii) is called rigorous coordination of P-1 and P-2. Generous coordination retains all of the original belief sets of each agent, but admits the introduction of additional belief sets of the other agent. By contrast, rigorous coordination forces each agent to give up some belief sets, but the result remains within the original belief sets for each agent. We provide methods for constructing these two types of coordination and discuss their properties.
Combining Answer Sets of Nonmonotonic Logic Programs

Chiaki Sakama, Katsumi Inoue

Alessandro Provetti and Marina De Vos (eds.), Proceedings of the International Workshop on Answer Set Programming (ASP'05) 42 - 56 2005 [Refereed]
Equivalence in Abductive Logic

Katsumi Inoue, Chiaki Sakama

Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05) 472 - 477 2005 [Refereed]
The PLP System

Toshiko Wakaki, Katsumi Inoue, Chiaki Sakama, Katsumi Nitta

in: Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA'04), Lecture Notes in Artificial Intelligence 3229 706 - 709 2004 [Refereed]
Equivalence of Logic Programs under Updates

Katsumi Inoue, Chiaki Sakama

Logics in Artificial Intelligence: Proceedings of the 9th European Conference (JELIA 2004), Lecture Notes in Artificial Intelligence 3229 174 - 186 2004 [Refereed]
Disjunctive Explanations in Abductive Logic Programming

Katsumi Inoue, Chiaki Sakama

Stephen Muggleton (ed.), Special Issue on Machine Intelligence 19, Electronic Transactions on Artificial Intelligence Electronic Transactions on Artificial Intelligence 7 2004
Speculative Computation by Abduction in Agent Communication

SATOH Ken, INOUE Katsumi, IWANUMA Koji, SAKAMA Chiaki, Ken Satoh, Katsumi Inoue, Koji Iwanuma, Chiaki Sakama

Computer Software ( Japan Society for Software Science and Technology ) 20 ( 1 ) 27 - 35 2003.01

　View Summary

現在のマルチエージェントシステムでは，エージェントが他エージェントに質問を与えた場合に, 質問を受けたエージェントが答を返すまでは, 質問したエージェントの処理は中断されることが普通である. インターネットのような通信が必ずしも保証されていないような環境下においては, このような中断がデッドロックを引き起こすことがありうる．また, たとえ通信が完全であっても, 他エージェントの処理に時間がかかっていれば、通信が不完全な状態と同じような状態になることがありうる. 本論文は、このような通信が必ずしも保証されていないマルチエージェントシステムにおける分散問題解決の手法を与える. 本手法は, 質問に対するデフォルトの回答を用意しておき, 回答が戻らなくても, デフォルトを用いて計算を進め, その後, 送られてきた真の回答がデフォルトと異なるときのみ, 計算をやり直すというものである. 本論文では, マスタースレーブマルチエージェントシステムにおいて，副作用が存在しない処理での投機的計算手法を仮説論理プログラミングの枠組みで実現し, 手法の健全性を示す.

DOI
エージェント間通信におけるアブダクションによる投機的計算 (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

佐藤健, 井上克己, 岩沼宏治, 坂間千秋

コンピュータソフトウェア 20 ( 1 ) 27 - 35 2003.01 [Refereed]
Computing Preferred Answer Sets in Asnwer Set Programming

Toshiko Wakaki, Katsumi Inoue, Chiaki Sakama, Katsumi Nitta

in: Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'03), Lecture Notes in Artificial Intelligence 2850 259 - 273 2003 [Refereed]
Discovery of Cellular Automata Rules Using Cases

Ken-ichi Maeda, Chiaki Sakama

in: Proceedings of the 6th International Conference on Discovery Science (DS'03), Lecture Notes in Artificial Intelligence 2843 357 - 364 2003 [Refereed]
Ordering Default Theories

Chiaki Sakama （Part： Lead author )

in: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03) 839 - 844 2003 [Refereed]
An Abductive Framework for Computing Knowledge Base Update

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

Theory and Practice of Logic Programming (Cambridge University Press) 3 ( 6 ) 671 - 713 2003 [Refereed]
Disjunctive explanations

K Inoue, C Sakama

LOGICS PROGRAMMING, PROCEEDINGS ( SPRINGER-VERLAG BERLIN ) 2401 317 - 332 2002 [Refereed]

　View Summary

Abductive logic programming has been widely used to declaratively specify a variety of problems in AI including updates in data and knowledge bases, belief revision, diagnosis, causal theory, and default reasoning. One of the most significant issues in abductive logic programming is to develop a reasonable method for knowledge assimilation, which incorporates obtained explanations into the current knowledge base. This paper offers a solution to this problem by considering disjunctive explanations whenever multiple explanations exist. Disjunctive explanations axe then to be assimilated into the knowledge base so that the assimilated program preserves all and only minimal answer sets from the collection of all possible updated programs. We describe a new form of abductive logic programming which deals with disjunctive explanations in the framework of extended abduction. The proposed framework can be well applied to view updates in disjunctive databases.
Nonmonotonic Inductive Logic Programming

Chiaki Sakama （Part： Lead author )

in: Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), Lecture Notes in Artificial Intelligence 2173 62 - 80 2001 [Refereed] [Invited]
Learning by Answer Sets

Chiaki Sakama （Part： Lead author )

in: Proceedings of the AAAI Spring Symposium on Answer Set Programming, Technical Report SS-01-01, AAAI Press 181 - 187 2001 [Refereed]
A Defeasible Reasoning System in Multi-Agent Environments

Chiaki Sakama, Katsumi Inoue, Koji Iwanuma, Ken Satoh （Part： Lead author )

Proceedings of the CL2000 Workshop on Computational Logic in Multi Agent Systems, London UK (2000) 1 - 6 2000.01 [Refereed]
Abductive Logic Programming and Disjunctive Logic Programming : Their Relationship and Transferability

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

Journal of Logic Programming 44 ( 1-3 ) 71 - 96 2000 [Refereed]

DOI
Inverse Entailment in Nonmonotonic Logic Programs

Chiaki Sakama （Part： Lead author )

Proceedings of the 10th International Conference on Inductive Logic Programming (ILP-2000), Lecture Notes in Artificial Intelligence ( Springer ) 1866 209 - 224 2000 [Refereed]
Prioritized Logic Programming and its Application to Commonsense Reasoning(jointly worked)

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

Artificial Intelligence, Elsevier 123 ( 1/2 ) 185 - 222 2000 [Refereed]

DOI
Speculative Computation by Abduction under Incomplete Communication Environments

Ken Satoh, Katsumi Inoue, Koji Iwanuma, Chiaki Sakama

in: Proceedings of the 4th International Conference on Multi-Agent Systems (ICMAS'00), IEEE Computer Society 263 - 273 2000 [Refereed]
Updating extended logic programs through abduction

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ( Springer Verlag ) 1730 147 - 161 1999 [Refereed]

　View Summary

This paper introduces techniques for updating knowledge bases represented in extended logic programs. Three different types of updates, view updates, theory updates, and inconsistency removal, are considered. We formulate these updates through abduction, and provide methods for computing them with update programs. An update program is an extended logic program which specifies changes on abductive hypotheses, then updates are computed by the U-minimal answer sets of an update program. The proposed technique provides a uniform framework for these different types of updates, and each update is computed using existing procedures of logic programming.

DOI
Abducing Priorities to Derive Intended Conclusions

Katsumi Inoue, Chiaki Sakama

n: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99) 44 - 49 1999 [Refereed]
Some properties of inverse resolution in normal logic programs

C Sakama （Part： Lead author )

INDUCTIVE LOGIC PROGRAMMING ( SPRINGER-VERLAG BERLIN ) 1634 279 - 290 1999 [Refereed]

　View Summary

This paper studies the properties of inverse resolution in normal logic programs. The V-operators are known as operations for inductive generalization in definite logic programs. In the presence of negation as failure in a program, however, the V-operators do not work as generalization operations in general and often make a consistent program inconsistent. Moreover, they may destroy the syntactic structure of logic programs such as acyclicity and local stratification. On the procedural side, unrestricted application of the V-operators may lose answers computed in the original program and make queries flounder. We provide sufficient conditions for the V-operators to avoid these problems.
Computing extended abduction through transaction programs

K Inoue, C Sakama

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE ( BALTZER SCI PUBL BV ) 25 ( 3-4 ) 339 - 367 1999 [Refereed]

　View Summary

To explain observations from nonmonotonic background theories, one often needs removal of some hypotheses as well as addition of other hypotheses. Moreover, some observations should not be explained, while some are to be explained. In order to formalize these situations, extended abduction was introduced by Inoue and Sakama (1995) to generalize traditional abduction in the sense that it can compute negative explanations by removing hypotheses and anti-explanations to unexplain negative observations. In this paper, we propose a computational mechanism for extended abduction. When a background theory is written in a normal logic program, we introduce its transaction program for computing extended abduction. A transaction program is a set of non-deterministic production rules that declaratively specify addition and deletion of abductive hypotheses. Abductive explanations are then computed by the fixpoint of a transaction program using a bottom-up model generation procedure. The correctness of the proposed procedure is shown for the class of acyclic covered abductive logic programs. In the context of deductive databases, a transaction program provides a declarative specification of database update.
Negation as failure in the head

Katsumi Inoue, Chiaki Sakama

Journal of Logic Programming ( Elsevier Inc. ) 35 ( 1 ) 39 - 78 1998 [Refereed]

　View Summary

The class of logic programs with negation as failure in the head is a subset of the logic of MBNF introduced by Lifschitz and is an extension of the class of extended disjunctive programs. An interesting feature of such programs is that the minimality of answer sets does not hold. This paper considers the class of general extended disjunctive programs (GEDPs) as logic programs with negation as failure in the head. First, we discuss that the class of GEDPs is useful for representing knowledge in various domains in which the principle of minimality is too strong. In particular, the class of abductive programs is properly included in the class of GEDPs. Other applications include the representation of inclusive disjunctions and circumscription with fixed predicates. Secondly, the semantic nature of GEDPs is analyzed by the syntax of programs. In acyclic programs, negation as failure in the head can be shifted to the body without changing the answer sets of the program. On the other hand, supported sets of any program are always preserved by the same transformation. Thirdly, the computational complexity of the class of GEDPs is shown to remain in the same complexity class as normal disjunctive programs. Through the simulation of negation as failure in the head, computation of answer sets and supported sets is realized using any proof procedure for extended or positive disjunctive programs. Finally, a simple translation of GEDPs into autoepistemic logic is presented. © 1998 Elsevier Science Inc. All rights reserved.

DOI
On Generality in Abduction and Induction

Chiaki Sakama, Katsumi Inoue

Peter Flach and Antonis Kakas (eds.), Proceedings of the ECAI'98 workshop on Abduction and Induction in AI 49 - 52 1998 [Refereed]
Specifying Transactions for Extended Abduction

Katsumi Inoue, Chiaki Sakama

A.G. Cohn and L. Schubert (eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98) 394 - 405 1998 [Refereed]
Partial deduction in disjunctive logic programming

C Sakama, H Seki （Part： Lead author )

JOURNAL OF LOGIC PROGRAMMING ( ELSEVIER SCIENCE INC ) 32 ( 3 ) 229 - 245 1997.09 [Refereed]

　View Summary

This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal model semantics of positive disjunctive programs and the stable model semantics of normal disjunctive programs. From the procedural side, disjunctive partial deduction is combined with a bottom-up proof procedure of disjunctive logic programs, and top-down partial deduction is introduced for query optimization. Disjunctive partial deduction is also applied to optimizing abductive logic programs and compiling propositional disjunctive programs. (C) Elsevier Science Inc., 1997.

DOI
Representing Priorities in Logic Programs

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

M. Maher (ed.), Logic Programming: Proceedings of the 1996 Joint International Conference and Symposium (JICSLP'96) 82 - 96 1996.09 [Refereed]
A Fixpoint Characterization of Abductive Logic Programs

Katsumi Inoue, Chiaki Sakama

Journal of Logic Programming, North-Holland 27 ( 2 ) 107 - 136 1996 [Refereed]

DOI
Paraconsistent stable semantics for extended disjunctive programs

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

Journal of Logic and Computation 5 ( 3 ) 265 - 285 1995.06 [Refereed]

　View Summary

This paper presents declarative semantics of possibly inconsistent disjunctive logic programs. We introduce the paraconsistent minimal and stable model semantics for extended disjunctive programs, which can distinguish inconsistent information from other information in a program. These semantics are based on lattice-structured multi-valued logics, and are characterized by a new fixpoint semantics of extended disjunctive programs. Applications of the paraconsistent semantics for reasoning in inconsistent programs are also presented. © 1995 Oxford University Press.

DOI
Embedding circumscriptive theories in general disjunctive programs

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

LOGIC PROGRAMMING AND NONMONOTONIC REASONING ( SPRINGER-VERLAG BERLIN ) 928 344 - 357 1995 [Refereed]

　View Summary

This paper presents a, method of embedding circumscriptive theories in general disjunctive programs. In a general disjunctive program, negation as failure occurs not only in the body but in the head of a rule. In this setting, minimized predicates of a circumscriptive theory are specified using the negation in the body, while fixed and varying predicates are expressed by the negation in the head. Moreover, the translation implies a close relationship between circumscription and abductive logic programming. That is, fixed and varying predicates in a circumscriptive theory are also viewed as abducible predicates in an abductive disjunctive program. Our method of translating circumscription into logic programming is fairly general compared with the existing approaches and exploits new applications of logic programming for representing commonsense knowledge.
The Effect of Partial Deduction in Abductive Reasoning

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

in: Proceedings of the 12th International Conference on Logic Programming (ICLP'95) 383 - 397 1995 [Refereed]
Abductive framework for nonmonotonic theory change

K Inoue, C Sakama

IJCAI-95 - PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2 ( MORGAN KAUFMANN PUB INC ) 204 - 210 1995 [Refereed]
An alternative approach to the semantics of disjunctive logic programs and deductive databases

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

Journal of Automated Reasoning ( Kluwer Academic Publishers ) 13 ( 1 ) 145 - 172 1994.02 [Refereed]

　View Summary

In this paper, we study a new semantics of logic programming and deductive databases. The possible model semantics is introduced as a declarative semantics of disjunctive logic programs. The possible model semantics is an alternative theoretical framework to the classical minimal model semantics and provides a flexible inference mechanism for inferring negation in disjunctive logic programs. We also present a proof procedure for the possible model semantics and show that the possible model semantics has an advantage from the computational complexity point of view. © 1994 Kluwer Academic Publishers.

DOI
On Positive Occurrences of Negation as Failure

Katsumi Inoue, Chiaki Sakama

in: Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning (KR'94) ( Elsevier ) 293 - 304 1994 [Refereed]

DOI
Partial Deduction of Disjunctive Logic Programs: A Declarative Approach

Chiaki Sakama, Hirohisa Seki （Part： Lead author )

in: Proceedings of the 14th International Workshop on Logic Program Synthesis and Transformation (LOPSTR'94), Lecture Notes in Computer Science 883 170 - 182 1994 [Refereed]
On the Equivalence between Disjunctive and Abductive Logic Programs

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

P.V. Hentenryck (ed.), Logic Programming: Proceedings of the Eleventh International Conference (ICLP '94) 489 - 503 1994 [Refereed]
Representing Abduction by Positive not

Katsumi Inoue, Chiaki Sakama

P. Codognet, P.M. Dung, A.C. Kakas, and P. Mancarella (eds.), Proceedings of the ICLP'93 Post-conference Workshop on Abductive Reasoning 1 - 9 1993 [Refereed]
Relating Disjunctive Logic Programs to Default Theories

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

L.M. Pereira and A. Nerode (eds.), Logic Programming and Non-monotonic Reasoning: Proceedings of the Second International Workshop (LP&NMR '93) 266 - 282 1993 [Refereed]
Transforming Abductive Logic Programs to Disjunctive Programs

Katsumi Inoue, Chiaki Sakama

D.S. Warren (ed.), Logic Programming: Proceedings of the Tenth International Conference (ICLP '93) 335 - 353 1993 [Refereed]
Negation in Disjunctive Logic Programs

Chiaki Sakama, Katsumi Inoue （Part： Lead author )

D.S. Warren (ed.), Logic Programming: Proceedings of the Tenth International Conference (ICLP '93) 703 - 719 1993 [Refereed]
Extended Well-founded Semantics for Paraconsistent Logic Programs

Chiaki Sakama （Part： Lead author )

in: Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'92) 592 - 599 1992 [Refereed]
Nonmonotonic parallel inheritance network

Chiaki Sakama, Akira Okumura （Part： Lead author )

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ( Springer Verlag ) 383 53 - 66 1989 [Refereed]

　View Summary

This paper discusses a theory of nonmonotonic inheritance reasoning in a semantic network and presents a parallel inheritance algorithm based on this approach.

DOI
PARTIAL EVALUATION OF QUERIES IN DEDUCTIVE DATABASES

Chiaki Sakama, Hidenori Itoh （Part： Lead author )

NEW GENERATION COMPUTING ( SPRINGER VERLAG ) 6 ( 2-3 ) 249 - 258 1988 [Refereed]
Handling Knowledge by its Representative

Chiaki Sakama, Hidenori Itoh （Part： Lead author )

in: Proceedings of the 2nd International Conference on Expert Database Systems (EDS'88) 551 - 565 1988 [Refereed]

▼display all

Books etc

Declarative Agent Languages and Technologies IX

Chiaki Sakama, Sebastian Sardina, Wamberto Vasconcelos, Michael Winikoff( Part： Edit)

Lecture Notes in Artificial Intelligence 7169, Springer-Verlag 2012
Towards the Integration of Inductive and Nonmonotonic Logic Programming

Setsuo Arikawa, Ayumi Shinohara( Part： Contributor, Work： pages 178-188)

Progress in Discovery Science, Lecture Notes in Artificial Intelligence, vol.2281, Springer-Verlag 2002
Abductive Generalization and specialization

Peter A. Flach, Antonis C. Kakas( Part： Contributor, Work： 253-265)

Abduction and Induction-Essays on their Relation and Integration, Kluwer Academic 2000
Handling Knowledge by its Representative(jointly worked)

L. Kerschberg( Part： Contributor, Work： 551-565)

Expert Database Systems, Beujamin/Cummings Publishers 1989

Misc

機械学習を用いた中学校体育ダンス授業支援システムの開発

西尾佳瑶子, 坂間千秋（Part： Last author )

情報処理学会コンピュータと教育研究会 169回研究発表会 2023.03
詰将棋における指し手の意味の説明が可能なAIシステムの構築

森岡勇介, 坂間千秋（Part： Last author )

情報処理学会第49回ゲーム情報学研究発表会 2023.03
再帰型ニューラルネットワークによる航空券の需要予測

今中滉大, 坂間千秋（Part： Last author )

第34回人工知能学会全国大会 2020.06
Reasoning and Programming in Artificial Intelligence

井上克巳, 坂間千秋, 佐藤泰介

人工知能 : 人工知能学会誌 : journal of the Japanese Society for Artificial Intelligence ( 人工知能学会 ; 2014- ) 34 ( 5 ) 703 - 713 2019.09
Evolution of Self-interested Agents in Collaborative Environments

下地竜起, 坂間千秋

先進的学習科学と工学研究会 ( 人工知能学会 ) 72 19 - 23 2014.11
Agent-based Negotiation with Q-learning

北浦愼也, 坂間千秋

先進的学習科学と工学研究会 ( 人工知能学会 ) 72 14 - 18 2014.11
A game-theoretic analysis of electronic commerce : on the effect of customer reviews

YOSHIDA Akihiro, SAKAMA Chiaki

Mathematical Systems Science and its Applications : IEICE technical report ( The Institute of Electronics, Information and Communication Engineers ) 112 ( 383 ) 5 - 9 2013.01

　View Summary

In electronic commerce, online customer reviews play an important role for users in making purchase decisions and selecting stores. On the other hand, there is an attempt to dupe users into believing that those reviews are honest comments by consumers while in fact they are disguised propaganda by a marketing company. In this study, we provide a game-theoretic model in which users make purchase decisions based on customer reviews, and then analyze the effect of those reviews on dealing between customers and stores.
Post-Proceedings of the First International Workshop on Learning and Nonmonotonic Reasoning (LNMR 2013, Corunna, Spain)

Katsumi Inoue, Chiaki Sakama

CoRR arXiv:1311.4639, 2013 2013
Classifying two-dimensional Life and its variants

高田祐輔, 坂間千秋

研究報告数理モデル化と問題解決（MPS） 2012 ( 5 ) 1 - 6 2012.11

　View Summary

本研究では， 2 次元セルオートマトンのライフゲームを変形した「擬似ライフゲーム」について，「誕生」「生存」「死亡」の各遷移規則の適用回数に基づく分類を行う．本研究の結果，従来とは異なる指標に基づく擬似ライフゲームの分類が示され， 3×3 トーラス空間における振る舞いに規則性が見られることが実験により確認された．In this study, we classify the two-dimensional Game of Life and its variants based on the number of applications of different transition rules. We show that the proposed method classifies those games in a manner different from the existing one, and we observe some behavioral rules of those games in 3×3 toroidal grids.
Building a knowledge circulation model for collecting cases in conceptual learning

山本匡, 坂間千秋

研究報告マルチメディア通信と分散処理（DPS） 2011 ( 10 ) 1 - 7 2011.09

　View Summary

本研究では近年 Web 上に見られるようになった「物当てゲーム」の知識循環性と概念の事例収集特性に着目し，このゲームを概念学習における事例収集のために用いる方法を提案する．本システムの特徴は，過去のゲーム結果から概念を学習し，その結果を新たな概念の学習に利用できることである．また，多くの人にプレイされることにより，獲得される概念が平均化される「集合知特性」を持つ．実験の結果，本システムではゲームを繰り返すことにより概念学習が行われ，ゲーム効率が向上することが確かめられた．In this research, we propose a method of using a "read your mind" game on the Web for collecting cases in conceptual learning. The game has the property of knowledge circulation which uses the results of games for future learning. It can also collect cases effectively on the Web by using the wisdom of crowds. We build an experimental system and verify that the system learns concepts by playing games and improves its performance.
An Introduction to Action Languages(<Special Issue>Current Trends in Logic-Based Inference Techniques)

SON Tran Cao, SAKAMA Chiaki, Tran Cao Son, Chiaki Sakama

Journal of Japanese Society for Artificial Intelligence ( 人工知能学会 ) 25 ( 3 ) 379 - 388 2010.05
Answer Set Programming(<Special Issue>Current Trends in Logic-Based Inference Techniques)

SAKAMA Chiaki, INOUE Katsumi, Chiaki Sakama, Katsumi Inoue

Journal of Japanese Society for Artificial Intelligence ( 人工知能学会 ) 25 ( 3 ) 368 - 378 2010.05
Editors' Introduction to "Current Trends in Logic-Based Inference Techniques"

SAKAMA Chiaki, INOUE Katsumi, Chiaki Sakama, Katsumi Inoue

人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence 25 ( 3 ) 366 - 367 2010.05
Answer Set Programming (in Japanese). Survey paper

Chiaki Sakama, Katsumi Inoue

Journal of the Japanese Society for Artificial Intelligence 25 ( 3 ) 368 - 378 2010
From Logic Programming to Answer Set Programming

Katsumi Inoue, Chiaki Sakama

Computer Software ( Japan Society for Software Science and Technology ) 25 ( 3 ) 20 - 32 2008.07

　View Summary

Horn logic programs on which Prolog is based have a restriction in the syntax of programs, where only definite knowledge can be represented. This limitation does not enable us to represent incomplete and indefinite knowledge in logic programs. To overcome this problem, several extended classes of logic programs have been proposed since late in the 1980s. Among them, answer set programming launched out into the new paradigm of logic programming in 1999, in which a logic program represents the constraints of a problem and its answer sets correspond to the solutions of the problem. Answer set programming has grown into one of the most popular research fields in logic programming. In this article, we review the essentials of answer set programming from the past to the future.

DOI
Computing Preferred Answer Sets by means of Answer Set Programming

WAKAKI Toshiko, INOUE Katsumi, SAKAMA Chiaki, NITTA Katsumi

IEICE technical report. Artificial intelligence and knowledge-based processing ( The Institute of Electronics, Information and Communication Engineers ) 103 ( 103 ) 23 - 28 2003.05

　View Summary

A framework of Prioritized logic programs (PLPs) is useful to represent explicit priorities between literals of logic programs. With its expressive power, PLPs theoretically enable us to realize various frameworks of nonmonotonic reasoning as well as preference abduction. However, so far, its implementation issues have scarcely been provided and even any sound procedure to compute preferred answer sets which give the semantics of PLPs, has not been proposed. In this paper, we present a procedure to compute all preferred answer sets of a PLP in answer set programming. We show soundness and completeness theorems for the procedure. Finally we show that our procedure makes PLPs not only practically available, but also have the capability of representing the dynamic preferences in addition to static ones.
事例を用いたセルオートマトンのルール生成 (小特集:「Semantic Webとインテリジェントコンテンツ」および一般)

前田憲一, 坂間千秋

知識ベ-スシステム研究会 ( 人工知能学会 ) 57 13 - 18 2002.09
アブダクションを使った帰納的学習について

坂間千秋

人工知能基礎論研究会 ( 人工知能学会 ) ( 37 ) 57 - 60 1999.07
Studies on Disjunctive Logic Programming

Chiaki Sakama （Part： Lead author )

Dissertation, Kyoto University 1994
Foundations of Disjunctive Logic Programming/J.Lobo,J.Minker,A.Rajasekar(1992)

Chiaki Sakama, Advanced Software Technology and Mechatronics Research Institute of Kyoto (ASTEM).

コンピュ-タソフトウェア ( 日本ソフトウェア科学会 ) 10 ( 5 ) p447 - 449 1993.09
Foundations of Disjunctive Logic Programming, J. Lobo, J. Minker, and A. Rajasekar, The MIT Press, 1992, 307 pages

Sakama Chiaki （Part： Lead author )

Computer Software ( Japan Society for Software Science and Technology ) 10 ( 5 ) 5_447 - 5_449 1993

　View Summary

<p></p>

DOI
非ホーン論理プログラム

坂間千秋

人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence 6 ( 3 ) 443 - 444 1991.05
Partial Evaluation of Knowledgebase

坂間千秋, 森田幸伯, 伊藤英則

全国大会講演論文集 33 ( 0 ) 1353 - 1354 1986.10

　View Summary

知識ベースが大規模化されるにつれて,知識ベースシステムにおける問い合わせ処理の効率化が重要になってくる.知識ベースの構造化, 種々の探索戦略などはいずれも問い合わせ処理における検索の効率化を狙ったものである.プログラムにおける計算の効率化手法の一つに部分評価がある.これはプログラム中のある入力データを固定することによって繰り返し計算における効率向上を狙ったものであるが,以後ロジックプログラミング,演繹データベースなどの分野に応用されてきた.本稿では,Prologのようなホーン節で表現された知識ベースを想定する.そして,そのような知識ベースの部分評価の概念を導入し,問い合わせ処理の効率化手法として適用した場合の方法とその意義についで述べる.

▼display all

Awards & Honors

Best Paper Award

Winner： Chiaki Sakama, Katsumi Inoue, Taisuke Sato

2017.08 10th International Conference on Knowledge Science, Engineering and Management Linear Algebraic Characterization of Logic Programs

Research Exchange

科研基盤Bの共同研究のため本学研究室に滞在

2020.03

　International research exchanges
科研基盤Ａの共同研究のため本学研究室に滞在

2018.01

-

2018.02

　International research exchanges
平成29年度国立情報学研究所共同研究

2017.04

-

2018.03

　Joint research
平成28年度国立情報学研究所共同研究

2016.04

-

2017.03

　Joint research
平成24年度国立情報学研究所共同研究

2012.04

-

2013.03

　Joint research
日本学術振興会(JSPS)平成24年度サマープログラムの一環で、米国ニューメキシコ州立大学博士課程在学中のBen Wright 氏を受け入れ、共同研究を行った。

2012.04

-

2013.03

　International research exchanges

▼display all

KAKENHI

知識表現・推論と機械学習の統合によるロバストAIの実現

2021.04

-

2025.03

Grant-in-Aid for Scientific Research(A) Co-investigator
テンソル空間における巨大知識グラフのための高次推論技術の開発

2018.04

-

2022.03

Grant-in-Aid for Scientific Research(B) Principal investigator
状態遷移列からの関係ダイナミクス学習

2017.04

-

2021.03

Grant-in-Aid for Scientific Research(A) Co-investigator
論理プログラム表現に基づくセルオートマトン遷移規則学習

2014.04

-

2016.03

Grant-in-Aid for Challenging Exploratory Research Co-investigator
不誠実なエージェントに関する研究

2012.04

-

2016.03

Grant-in-Aid for Scientific Research(C) Principal investigator
マルチエージェントシステムにおける社会知能の推論メカニズムに関する研究

2008.04

-

2012.03

Grant-in-Aid for Scientific Research(C) Principal investigator
推論による仮説発見とシステム生物学への応用

2008.04

-

2012.03

Grant-in-Aid for Scientific Research(A) Co-investigator
知的エージェント社会における社交的行動の計算論理に関する研究

2005.04

-

2008.03

Grant-in-Aid for Scientific Research(C) Principal investigator
デフォルト知識を含む論理プログラムの順序化と帰納推論への応用に関する研究

2003.04

-

2005.03

Grant-in-Aid for Scientific Research(C) Principal investigator
先行投機的処理機能を持つマルチエージェントシステムの構築

2001.04

-

2004.03

Grant-in-Aid for Scientific Research(A) Co-investigator
非単調帰納倫理プログラミングにおける逆伴意法に関する研究

2000.04

-

2002.03

Grant-in-Aid for Scientific Research(C) Principal investigator
不完全通信環境下における論理型マルチエージェントシステムの構築

1999.04

-

2001.03

Grant-in-Aid for Scientific Research(B) Co-investigator
アブダクションを使った帰納的学習に関する研究

1998.04

-

2000.03

奨励研究（A） Principal investigator

▼display all

Public Funding (other government agencies of their auxiliary organs, local governments, etc.)

エージェント間交渉の帰納推論による定式化

2008.04

-

2010.03

Principal investigator
知的エージェントの計算論理に関する研究

2005.04

-

2008.03

Principal investigator

Instructor for open lecture, peer review for academic journal, media appearances, etc.

博士論文審査委員

2022.07.14

国立大学法人総合研究大学院大学

　View Details

「学協会、政府、自治体等の公的委員」以外の委員

本学の複合科学研究科情報学専攻の学生の博士号取得にかかる博士論文審査を行う。
客員教授

2022.04.01

-

2023.03.31

国立情報学研究所

　View Details

客員教員（研究開発連携）

情報学分野における大学等との連携体制を強化し情報学研究の一層の推進を図る。
国際会議、国際ジャーナル、国内誌の論文査読２０件以上

2022.01.01

-

2022.12.31

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件以上
著書「深堀り！中学数学」（岩波ジュニア新書）

2021.05.20

-

Now

岩波書店

　View Details

中学数学

著書「深堀り！中学数学」（岩波ジュニア新書）の発行
国際会議、国際ジャーナル、国内誌の論文査読２０件以上

2021.01.01

-

2021.12.31

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件以上
客員教授

2020.04.01

-

2022.03.31

大学共同利用機関法人情報・システム研究機構　国立情報学研究所

　View Details

客員教員（研究開発連携）

情報学分野における大学等との連携体制を強化し情報学研究の一層の推進を図る。
外国人研究者等の受入

2020.03

NII

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Tuan Nguyen
第38回ライフサイエンス懇話会

2020.02

和歌山県医師会

　View Details

公開講座・講演会の企画・講師等

ライフサイエンス懇話会にて人工知能に関する討論を行った,日付:2/2
国際会議、国際ジャーナル、国内誌の論文査読２０件以上

2020.01.01

-

2020.12.31

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件以上
国際会議、国際ジャーナル、国内誌の論文査読２０件以上

2019.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件以上
和歌山大学学部開放授業

2019.04

不明

　View Details

公開講座・講演会の企画・講師等

教養科目「論理的思考」を学部開放授業として行った。
和歌山大学教育学部附属小1年生校外学習

2019.03

その他

　View Details

小・中・高校生を対象とした学部体験入学・出張講座等

和歌山大学教育学部附属小1年生(約100名)の校外学習(和歌山大学見学)のアシストを行った。,日付:3/7
外国人研究者等の受入

2018.12

Hanoi University of Science and Technology, Vietnam

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Tuấn Nguyễn
国際会議、国際ジャーナル、国内誌の論文査読２０件以上

2018.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件以上
和歌山大学学部開放授業

2018.04

不明

　View Details

公開講座・講演会の企画・講師等

教養科目「論理的思考」を学部開放授業として行った。
和歌山大学教育学部附属小1年生校外学習

2018.03

その他

　View Details

小・中・高校生を対象とした学部体験入学・出張講座等

和歌山大学教育学部附属小1年生(98名)の校外学習(和歌山大学見学)のアシストを行った。,日付:3/2
外国人研究者等の受入

2018.01

University of Informatics Technology, VNU-HCM, Vietnam

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Hien D. Nguyen
和歌山大学教育学部附属小2年生校外学習

2017.09

その他

　View Details

小・中・高校生を対象とした学部体験入学・出張講座等

和歌山大学教育学部附属小2年生(104名)の校外学習(和歌山大学見学)のアシストを行った。,日付:9/28
外国人研究者等の受入

2017.09

University of Luxembourg

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Prof. Leon van der Torre
外国人研究者等の受入

2017.09

Vienna University of Technology, Imperial College London

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名: Tobias Kaminski, Benjamin Wu
国際会議、国際ジャーナル、国内誌の論文査読２０件以上

2017.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件以上
和歌山大学オープン・ラボ「公開体験学習会」

2016.11

その他

　View Details

小・中・高校生を対象とした学部体験入学・出張講座等

和歌山大学オープン・ラボ「公開体験学習会」で、一般参加者を対象とした人工知能関係のイベント企画を行った
外国人研究者等の受入

2016.09

NII

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Dr. Sophie Tourret
国際会議、国際ジャーナル、国内誌の論文査読２０件以上

2016.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件以上
外国人研究者等の受入

2015.11

Universita degli Studi di Ferrara, Italy

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Prof. Evelina Lamma
外国人研究者等の受入

2015.06

(1) Ecole Centrale de Nantes, France, (2) CSIC-UPC, Spain, (3) NII, Japan

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:(1) Dr. Morgan Magnin, (2) Dr. David Martinez, (3) Tony Ribeiro
国際会議、国際ジャーナル、国内誌の論文査読２０件以上

2015.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件以上
外国人研究者等の受入

2015.04

University of Luxembourg

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Prof. Leon van der Torre, Dr. Tjitze Rienstra
外国人研究者等の受入

2014.12

(1) Ecole Centrale de Nantes, France, (2) Imperial College London, (3) NII/TRIC, (4) NII

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:(1) Dr. Morgan Magnin, (2) Dr. Andrew Cropper, (3) Dr. Nicolas Schwind, (4) Tony Ribeiro
国際会議、国際ジャーナル、国内誌の論文査読２０件以上

2014.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件以上
外国人研究者等の受入

2013.12

(1) RWTH Aachen Univ., Germany, (2) Universite Paris-Dauphinem, France, (3) Ph.D student, NII, Japan

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:(1) Dr. Marcus Volker, (2) Dr. Gauvain Bourgne, (3) Tony Ribeiro
外国人研究者等の受入

2013.10

Dr. Martin Caminada (University of Aberdeen, UK)

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Martin Caminada
Editorial board member

2013.07

-

Now

Journal of Artificial Intelligence Research

　View Details

学術雑誌等の編集委員・査読・審査員等

Editorial board member
国際会議、国際ジャーナル、国内誌の論文査読２０件前後

2013.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件前後
国際ワークショップLNMR2013のPost-Proceedingsの編集・発行

2013.04

-

2014.03

Computing Research Repository (CoRR)

　View Details

学術雑誌等の編集委員・査読・審査員等

国際ワークショップLNMR2013のPost-Proceedingsの編集・発行
和歌山大学附属小学校一年生課外授業

2013.02

その他

　View Details

小・中・高校生を対象とした学部体験入学・出張講座等

ロボットに関するレクチャーと研究室によるデモを行った。,日付:2013.2
国際会議、国際ジャーナル、国内誌の論文査読２０件前後

2012.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件前後
Advisory Board

2012.04

-

Now

STUDIES IN APPLIED PHILOSOPHY, EPISTEMOLOGY AND RATIONAL ETHICS (Springer)

　View Details

学術雑誌等の編集委員・査読・審査員等

Advisory Board
外国人研究者等の受入

2012.04

-

2013.03

NII, Japan

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Tony Ribeiro
外国人研究者等の受入

2012.04

-

2013.03

米国、ニューメキシコ州立大学

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Ben Wright
国際会議、国際ジャーナル、国内誌の論文査読２０件前後

2011.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件前後
国際会議DALT2011のPost-Proceedingsの編集

2011.04

-

2013.03

Lecture Notes in Artificial Intelligence, vol.7169

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議DALT2011のPost-Proceedingsの編集
外国人研究者等の受入

2011.04

-

2012.03

NII, Japan

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Dr Lena Wiese
Vol.25,No.3「論理に基づく推論技術の動向」ゲストエディタ

2010.04

-

Now

人工知能学会誌

　View Details

学術雑誌等の編集委員・査読・審査員等

Vol.25,No.3「論理に基づく推論技術の動向」ゲストエディタ
国際会議、国際ジャーナル、国内誌の論文査読２０件前後

2010.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件前後
国際会議、国際ジャーナル、国内誌の論文査読２０件前後

2009.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件前後
戦略的国際科学技術協力推進事業　

2009.04

-

2010.03

科学技術振興機構(JST)

　View Details

国際交流事業

日仏研究交流「システム生物学における仮説発見に関する研究」(代表、井上克巳　国立情報学研究所教授)の日本側研究メンバとして参加した。,相手国:フランス
外国人研究者等の受入

2009.04

-

2010.03

Imperial College London, UK

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Dr Oliver Ray
国際会議、国際ジャーナル、国内誌の論文査読２０件前後

2008.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件前後
戦略的国際科学技術協力推進事業　

2008.04

-

2009.03

科学技術振興機構(JST)

　View Details

国際交流事業

日仏研究交流「システム生物学における仮説発見に関する研究」(代表、井上克巳　国立情報学研究所教授)の日本側研究メンバとして参加した。,相手国:フランス
外国人研究者等の受入

2008.04

-

2009.03

米国、ニューメキシコ州立大学; Universite Paris-Dauphinem, France

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Prof. Tran Cao Son; Dr. Gauvain Bourgne
向陽大学ゼミナール

2007.11

その他

　View Details

小・中・高校生を対象とした学部体験入学・出張講座等

向陽高校で「大学と工学部で何を学ぶか?」というテーマで講演を行った。,日付:2007.11
国際会議、国際ジャーナル、国内誌の論文査読２０件前後

2007.04

-

Now

その他

　View Details

学術雑誌等の編集委員・査読・審査員等

国際会議、国際ジャーナル、国内誌の論文査読２０件前後
戦略的国際科学技術協力推進事業　

2007.04

-

2008.03

科学技術振興機構(JST)

　View Details

国際交流事業

日仏研究交流「システム生物学における仮説発見に関する研究」(代表、井上克巳　国立情報学研究所教授)の日本側研究メンバとして参加した。,相手国:フランス
外国人研究者等の受入

2007.04

-

2008.03

Utrechet University, Netherlands; University of Bristol, UK; University of Bath, UK

　View Details

外国人研究者等の受入

外国人研究者等の受入,氏名:Dr Martin Caminada, Dr. Oliver Ray, Martin Brain

▼display all

Committee member history in academic associations, government agencies, municipalities, etc.

プログラム委員

2022.01

-

2022.12

国際会議(8件)

　View Details

学協会、政府、自治体等の公的委員

2021年に開催された5件の国際会議のプログラム委員を勤めた,
客員教授

2021.04

-

2022.03

情報・システム研究機構

　View Details

国や地方自治体、他大学・研究機関等での委員

客員教員,任期:2019年５月～2021年３月
プログラム委員

2021.01

-

2021.12

国際会議(5件)

　View Details

学協会、政府、自治体等の公的委員

2021年に開催された5件の国際会議のプログラム委員を勤めた,
プログラム委員

2020.01

-

2020.12

国際会議(5件)

　View Details

学協会、政府、自治体等の公的委員

2020年に開催された5件の国際会議のプログラム委員を勤めた,
客員教員

2019.04

-

2021.03

情報・システム研究機構

　View Details

国や地方自治体、他大学・研究機関等での委員

客員教員,任期:2019年５月～2021年３月
プログラム委員

2019.01

-

2019.12

国際会議(8件)

　View Details

学協会、政府、自治体等の公的委員

2019年に開催された8件の国際会議のプログラム委員を勤めた,任期:2019.1～2019.12
プログラム委員

2018.01

-

2018.12

国際会議(5件)

　View Details

学協会、政府、自治体等の公的委員

2018年に開催された5件の国際会議のプログラム委員を勤めた,任期:2018.1～2018.12
申請書に基づく書面審査

2017.06

和歌山県産業技術政策課「先駆的産業技術研究開発支援事業」審査委員

　View Details

国や地方自治体、他大学・研究機関等での委員

申請書に基づく書面審査
客員教員

2017.05

-

2018.03

情報・システム研究機構

　View Details

国や地方自治体、他大学・研究機関等での委員

客員教員,任期:2017年５月～2018年３月
プログラム委員

2017.01

-

2017.12

国際会議(8件)

　View Details

学協会、政府、自治体等の公的委員

2017年に開催された8件の国際会議のプログラム委員を勤めた,任期:2017.1～2017.12
申請書に基づく書面審査

2016.08

和歌山県産業技術政策課「先駆的産業技術研究開発支援事業」審査委員

　View Details

国や地方自治体、他大学・研究機関等での委員

申請書に基づく書面審査
プログラム委員

2016.01

-

2016.12

国際会議(5件)

　View Details

学協会、政府、自治体等の公的委員

2016年に開催された5つの国際会議のプログラム委員を勤めた,任期:2016.1～2016.12
プログラム委員

2015.01

-

2015.12

国際会議(9件)

　View Details

学協会、政府、自治体等の公的委員

2015年に開催された9つの国際会議のプログラム委員を勤めた,任期:2015.1～2015.12
プログラム委員

2014.01

-

2014.12

国際会議(7件)

　View Details

学協会、政府、自治体等の公的委員

2014年に開催された7つの国際会議のプログラム委員を勤めた,任期:2014.1～2014.12
プログラム委員

2013.01

-

2013.12

国際会議(9件)

　View Details

学協会、政府、自治体等の公的委員

2013年に開催された9つの国際会議のプログラム委員を勤めた,任期:2013.1～2013.12
プログラム委員

2012.04

-

2012.12

国際会議(5件)

　View Details

学協会、政府、自治体等の公的委員

2012年度に開催された5つの国際会議のプログラム委員を勤めた,任期:2012.4～2012.12
組織委員

2011.05

-

2011.12

9th International Workshop on Declarative Agent Languages and Technologies (DALT)

　View Details

学協会、政府、自治体等の公的委員

2011年に台湾で開催された国際ワークショップ(DALT)の組織委員を勤めた,任期:2011.4～2011.12
プログラム委員

2011.04

-

2011.12

国際会議(6件)

　View Details

学協会、政府、自治体等の公的委員

2011年度に開催された6つの国際会議のプログラム委員を勤めた,任期:2011.4～2011.12
プログラム委員

2010.04

-

2010.12

国際会議(5件)

　View Details

学協会、政府、自治体等の公的委員

2010年度に開催された5つの国際会議(CLIMA, DALT, ILP, JELIA, NonMon@30)のプログラム委員を勤めた,任期:2010.4～2010.12
プログラム委員

2009.04

-

2009.12

Computational logic in multiagent systems (CLIMA)

　View Details

学協会、政府、自治体等の公的委員

2009年度に開催された国際会議(CLIMA)のプログラム委員を勤めた。,任期:2009.4～2009.12
プログラム委員

2009.04

-

2009.12

Declarative Agent Languages and Technologies (DALT)

　View Details

学協会、政府、自治体等の公的委員

2009年度に開催された国際会議(DALT)のプログラム委員を勤めた。,任期:2009.4～2009.12
プログラム委員

2009.04

-

2009.12

International Joint Conference on Artificial Intelligence (IJCAI)

　View Details

学協会、政府、自治体等の公的委員

2009年度に開催された国際会議(IJCAI)のプログラム委員を勤めた。,任期:2009.4～2009.12
プログラム委員

2009.04

-

2009.12

Logic Programming and Nonmonotonic Reasoning (LPNMR)

　View Details

学協会、政府、自治体等の公的委員

2009年度に開催された国際会議(LPNMR)のプログラム委員を勤めた。,任期:2009.4～2009.12
プログラム委員

2008.04

-

2008.12

Logic-Based Program Synthesis and Transformation (LOPSTR)

　View Details

学協会、政府、自治体等の公的委員

2008年度に開催された国際会議(LOPSTR)のプログラム委員を勤めた。,任期:2008.4～2008.12
プログラム委員

2008.04

-

2008.12

Computational logic in multiagent systems (CLIMA)

　View Details

学協会、政府、自治体等の公的委員

2008年度に開催された国際会議(CLIMA)のプログラム委員を勤めた。,任期:2008.4～2008.12
プログラム委員

2008.04

-

2008.12

Nonmonotonic Reasoning (NMR)

　View Details

学協会、政府、自治体等の公的委員

2008年度に開催された国際会議(NMR)のプログラム委員を勤めた。,任期:2008.4～2008.12
プログラム委員

2008.04

-

2008.12

Declarative Agent Languages and Technologies (DALT)

　View Details

学協会、政府、自治体等の公的委員

2008年度に開催された国際会議(DALT)のプログラム委員を勤めた。,任期:2008.4～2008.12
プログラム委員

2007.04

-

2007.12

Declarative Agent Languages and Technologies (DALT)

　View Details

学協会、政府、自治体等の公的委員

2007年度に開催された国際会議(DALT)のプログラム委員を勤めた。,任期:2007.4～2007.12
プログラム委員

2007.04

-

2007.12

Abduction and Induction in AI (AIAI)

　View Details

学協会、政府、自治体等の公的委員

2007年度に開催された国際会議(AIAI)のプログラム委員を勤めた。,任期:2007.4～2007.12
プログラム委員

2007.04

-

2007.12

Computational logic in multiagent systems (CLIMA)

　View Details

学協会、政府、自治体等の公的委員

2007年度に開催された国際会議(CLIMA)のプログラム委員を勤めた。,任期:2007.4～2007.12
プログラム委員

2007.04

-

2007.12

Logic Programming and Nonmonotonic Reasoning (LPNMR)

　View Details

学協会、政府、自治体等の公的委員

2007年度に開催された国際会議(LPNMR)のプログラム委員を勤めた。,任期:2007.4～2007.12
プログラム委員

2006.04

国際会議

　View Details

学協会、政府、自治体等の公的委員

2006年度に開催された5つの国際会議(CLIMA, ECAI, NMR, AIAI, DALT)のプログラム委員を勤めた。,任期:2006.4～2006.4

▼display all

Other Social Activities

民間企業からの受託研究

2020.04

-

2021.03

その他

　View Details

産業界、行政諸機関等と行った共同研究、新技術創出、コンサルティング等

株式会社エスティーワールドからの依頼により、航空券の需要予測に関する受託研究を行った
民間企業からの受託研究

2019.04

-

2020.03

その他

　View Details

産業界、行政諸機関等と行った共同研究、新技術創出、コンサルティング等

株式会社エスティーワールドからの依頼により、航空券の需要予測に関する受託研究を行った
民間企業からの受託研究

2018.04

-

2019.03

その他

　View Details

産業界、行政諸機関等と行った共同研究、新技術創出、コンサルティング等

株式会社エスティーワールドからの依頼により、航空券の需要予測に関する受託研究を行った
システム工学部同窓会近況報告会参加

2016.04

-

2017.03

その他

　View Details

社会との連携を推進する活動

システム工学部同窓会近況報告会に参加した
工学研究合同シーズ発表会での研究発表

2016.04

-

2017.03

その他

　View Details

産業界、行政諸機関等と行った共同研究、新技術創出、コンサルティング等

大阪府立大学との工学研究合同シーズ発表会で研究発表を行った
学部創立２０周年記念式典・祝賀会

2015.10

その他

　View Details

社会との連携を推進する活動

学部創立２０周年記念式典・祝賀会に参加
システム工学部同窓会近況報告会

2014.10

その他

　View Details

社会との連携を推進する活動

システム工学部同窓会近況報告会に参加
システム工学部同窓会近況報告会

2013.10

その他

　View Details

社会との連携を推進する活動

システム工学部同窓会近況報告会に参加

▼display all