Suivre
Shota Motoura
Shota Motoura
NEC Corporation
Aucune adresse e-mail validée
Titre
Citée par
Citée par
Année
Optimization of information-seeking dialogue strategy for argumentation-based dialogue system
H Katsumi, T Hiraoka, K Yoshino, K Yamamoto, S Motoura, K Sadamasa, ...
arXiv preprint arXiv:1811.10728, 2018
82018
Translating MFM into FOL: towards plant operation planning
S Motoura, K Yamamoto, S Kubosawa, T Onishi
arXiv preprint arXiv:1806.07037, 2018
32018
A general framework for modal correspondence in dynamic epistemic logic
S Motoura
Logic, Rationality, and Interaction: 5th International Workshop, LORI 2015 …, 2015
32015
Cooperative hypothesis building for computer security incident response
S Motoura, A Hoshino, I Hosomi
ICT with Intelligent Applications: Proceedings of ICTIS 2021, Volume 1, 489-497, 2022
22022
A general framework for dynamic epistemic logic: towards canonical correspondences
S Motoura
Journal of Applied Non-Classical Logics 27 (1-2), 50-89, 2017
22017
A general framework for dynamic epistemic logic
S Motoura
京都大学 (Kyoto University), 2017
22017
A Logical Framework for User-Feedback Dialogues on Hypotheses in Weighted Abduction
S Motoura, A Hoshino, I Hosomi, K Sadamasa
European Conference on Symbolic and Quantitative Approaches with Uncertainty …, 2023
12023
Detecticon: A prototype inquiry dialog system
T Hiraoka, S Motoura, K Sadamasa
9th International Workshop on Spoken Dialogue System Technology, 381-387, 2019
12019
A Logical Formalisation of a Hypothesis in Weighted Abduction: towards User-Feedback Dialogues
S Motoura, A Hoshino, I Hosomi, K Sadamasa
International Journal of Approximate Reasoning, 109382, 2025
2025
On Inverse Operators in Dynamic Epistemic Logic
S Motoura, S Katsumata
International Symposium on Logical Foundations of Computer Science, 217-235, 2021
2021
A Logic and Computation for Popper’s Conditional Probabilities
S Motoura
Symbolic and Quantitative Approaches to Reasoning with Uncertainty: 16th …, 2021
2021
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–11