Mitsuhiro Okada

81 papers A* 4A 1B 4C 6Journal 34Unranked 27

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Unified Treatment of Reachability and Indistinguishability Properties: First-Order Logic with Overwhelming Truth. IACR Cryptol. ePrint Arch. Gergei Bana, Mitsuhiro Okada
2026	J	`jnl`	Abductive Reasoning with Syllogistic Forms in Large Language Models. CoRR Hirohiko Abe, Risako Ando, Takanobu Morishita, Kentaro Ozeki, Koji Mineshima, Mitsuhiro Okada
2026	—	`conf`	Evaluation of Deontic Conditional Reasoning in Large Language Models: The Case of Wason's Selection Task. EACL (Volume 2: Short Papers) Hirohiko Abe, Kentaro Ozeki, Risako Ando, Takanobu Morishita, Koji Mineshima, Mitsuhiro Okada
2026	J	`jnl`	Evaluation of Deontic Conditional Reasoning in Large Language Models: The Case of Wason's Selection Task. CoRR Hirohiko Abe, Kentaro Ozeki, Risako Ando, Takanobu Morishita, Koji Mineshima, Mitsuhiro Okada
2025	J	`jnl`	Normative Reasoning in Large Language Models: A Comparative Benchmark from Logical and Modal Perspectives. CoRR Kentaro Ozeki, Risako Ando, Takanobu Morishita, Hirohiko Abe, Koji Mineshima, Mitsuhiro Okada
2024	—	`conf`	Abductive Reasoning with Syllogistic Forms in Large Language Models. HAR Hirohiko Abe, Risako Ando, Takanobu Morishita, Kentaro Ozeki, Koji Mineshima, Mitsuhiro Okada
2024	C	`conf`	An Eye-Tracking Study on the Effects of Using Highlighted Multi-attribute Tables: A Preliminary Report. Diagrams Masahiro Morii, Takashi Ideno, Yuki Tamari, Kazuhisa Takemura, Mitsuhiro Okada
2024	C	`conf`	Can Euler Diagrams Improve Syllogistic Reasoning in Large Language Models? Diagrams Risako Ando, Kentaro Ozeki, Takanobu Morishita, Hirohiko Abe, Koji Mineshima, Mitsuhiro Okada
2024	—	`conf`	Exploring Reasoning Biases in Large Language Models Through Syllogism: Insights from the NeuBAROCO Dataset. ACL (Findings) Kentaro Ozeki, Risako Ando, Takanobu Morishita, Hirohiko Abe, Koji Mineshima, Mitsuhiro Okada
2024	J	`jnl`	Exploring Reasoning Biases in Large Language Models Through Syllogism: Insights from the NeuBAROCO Dataset. CoRR Kentaro Ozeki, Risako Ando, Takanobu Morishita, Hirohiko Abe, Koji Mineshima, Mitsuhiro Okada
2023	J	`jnl`	Evaluating Large Language Models with NeuBAROCO: Syllogistic Reasoning Ability and Human-like Biases. CoRR Risako Ando, Takanobu Morishita, Hirohiko Abe, Koji Mineshima, Mitsuhiro Okada
2020	—	`conf`	A Semantics for "Typically" in First-Order Default Reasoning. JSAI-isAI Workshops Gergei Bana, Mitsuhiro Okada
2020	—	`conf`	A Simplified Application of Howard's Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems. WRLA Mitsuhiro Okada, Yuta Takahashi
2020	—	`conf`	A Small Remark on Hilbert's Finitist View of Divisibility and Kanovich-Okada-Scedrov's Logical Analysis of Real-Time Systems. Logic, Language, and Security Mitsuhiro Okada
2020	J	`jnl`	Corrigendum to "Inductive-data-type systems" [Theoret. Comput. Sci. 272 (1-2) (2002) 41-68]. Theor. Comput. Sci. Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
2020	—	`ed.`	Logic, Language, and Security - Essays Dedicated to Andre Scedrov on the Occasion of His 65th Birthday Logic, Language, and Security Vivek Nigam, Tajana Ban Kirigin, Carolyn L. Talcott, Joshua D. Guttman, Stepan L. Kuznetsov, Boon Thau Loo, Mitsuhiro Okada
2020	C	`conf`	On Effects of Changing Multi-attribute Table Design on Decision Making: An Eye-Tracking Study. Diagrams Takashi Ideno, Masahiro Morii, Kazuhisa Takemura, Mitsuhiro Okada
2020	J	`jnl`	Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability. ACM Trans. Comput. Log. Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla, Mitsuhiro Okada
2018	—	`conf`	On Quasi Ordinal Diagram Systems. TERMGRAPH@FSCD Mitsuhiro Okada, Yuta Takahashi
2016	B	`conf`	Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4. CSL Gergei Bana, Mitsuhiro Okada
2016	J	`jnl`	Syntactic reduction in Husserl's early phenomenology of arithmetic. Synth. Mirja Helena Hartimo, Mitsuhiro Okada
2014	J	`jnl`	Towards explaining the cognitive efficacy of Euler diagrams in syllogistic reasoning: A relational perspective. J. Vis. Lang. Comput. Koji Mineshima, Yuri Sato, Ryo Takemura, Mitsuhiro Okada
2013	A*	`conf`	Computationally complete symbolic attacker and key exchange. CCS Gergei Bana, Koji Hasebe, Mitsuhiro Okada
2013	—	`conf`	Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk). RTA Mitsuhiro Okada
2013	—	`conf`	Shape Perception in Chemistry. SHAPES Janna Hastings, Colin R. Batchelor, Mitsuhiro Okada
2012	J	`jnl`	A Diagrammatic Inference System with Euler Circles. J. Log. Lang. Inf. Koji Mineshima, Mitsuhiro Okada, Ryo Takemura
2012	J	`jnl`	A Generalized Syllogistic Inference System based on Inclusion and Exclusion Relations. Stud Logica Koji Mineshima, Mitsuhiro Okada, Ryo Takemura
2012	—	`conf`	On the Cognitive Efficacy of Euler Diagrams in Syllogistic Reasoning: A Relational Perspective. ED@Diagrams Yuri Sato, Koji Mineshima, Ryo Takemura, Mitsuhiro Okada
2012	C	`conf`	Very low-delay H.264 codec for consumer applications. ICCE Hiroki Mizosoe, Mitsuhiro Okada, Hironori Komi, Manabu Sasamoto, Yoshinori Hatori
2010	J	`jnl`	Secrecy-Oriented First-Order Logical Analysis of Cryptographic Protocols. IACR Cryptol. ePrint Arch. Gergei Bana, Koji Hasebe, Mitsuhiro Okada
2010	C	`conf`	Two Types of Diagrammatic Inference Systems: Natural Deduction Style and Resolution Style. Diagrams Koji Mineshima, Mitsuhiro Okada, Ryo Takemura
2009	—	`conf`	Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols. Formal to Practical Security Gergei Bana, Koji Hasebe, Mitsuhiro Okada
2009	—	`ed.`	Formal to Practical Security - Papers Issued from the 2005-2008 French-Japanese Collaboration Formal to Practical Security Véronique Cortier, Claude Kirchner, Mitsuhiro Okada, Hideki Sakurada
2008	C	`conf`	Diagrammatic Reasoning System with Euler Circles: Theory and Experiment Design. Diagrams Koji Mineshima, Mitsuhiro Okada, Yuri Sato, Ryo Takemura
2007	—	`conf`	Computational Semantics for Basic Protocol Logic - A Stochastic Approach. ASIAN Gergei Bana, Koji Hasebe, Mitsuhiro Okada
2007	J	`jnl`	Computational Semantics for Basic Protocol Logic - A Stochastic Approach. IACR Cryptol. ePrint Arch. Gergei Bana, Koji Hasebe, Mitsuhiro Okada
2007	—	`conf`	Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic Rewriting, Computation and Proof Mitsuhiro Okada, Ryo Takemura
2006	—	`conf`	Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences. Essays Dedicated to Joseph A. Goguen Mitsuhiro Okada, Yutaro Sugimoto, Sumi Yoshikawa, Akihiko Konagaya
2006	J	`jnl`	Inductive-data-type Systems CoRR Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
2006	J	`jnl`	Intuitionistic phase semantics is almost classical. Math. Struct. Comput. Sci. Max I. Kanovich, Mitsuhiro Okada, Kazushige Terui
2006	J	`jnl`	The Calculus of Algebraic Constructions CoRR Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
2005	—	`conf`	Completeness and Counter-Example Generations of a Basic Protocol Logic: (Extended Abstract). RULE@RDP Koji Hasebe, Mitsuhiro Okada
2003	J	`jnl`	A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic. Theor. Comput. Sci. Misao Nagayama, Mitsuhiro Okada
2003	—	`conf`	Inferences on Honesty in Compositional Logic for Protocol Analysis. ISSS Koji Hasebe, Mitsuhiro Okada
2003	J	`jnl`	Phase semantics for light linear logic. Theor. Comput. Sci. Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
2003	J	`jnl`	Preface. Theor. Comput. Sci. Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
2003	—	`ed.`	Software Security -- Theories and Systems, Mext-NSF-JSPS International Symposium, ISSS 2002, Tokyo, Japan, November 8-10, 2002, Revised Papers ISSS Mitsuhiro Okada, Benjamin C. Pierce, Andre Scedrov, Hideyuki Tokuda, Akinori Yonezawa
2002	—	`conf`	A Logical Verification Method for Security Protocols Based on Linear Logic and BAN Logic. ISSS Koji Hasebe, Mitsuhiro Okada
2002	J	`jnl`	A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theor. Comput. Sci. Mitsuhiro Okada
2002	—	`conf`	Ideal Concepts, Intuitions, and Mathematical Knowledge Acquisitions in Husserl and Hilbert. Progress in Discovery Science Mitsuhiro Okada
2002	J	`jnl`	Inductive-data-type systems. Theor. Comput. Sci. Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
2002	J	`jnl`	Theories of Types and Proofs 1997 - Preface. Theor. Comput. Sci. Mariangiola Dezani-Ciancaglini, Mitsuhiro Okada, Masako Takahashi
2001	J	`jnl`	A New Correctness Criterion for The Proof Nets of Non-Commutative Multiplicative Linear Logics. J. Symb. Log. Misao Nagayama, Mitsuhiro Okada
1999	J	`jnl`	Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic. Theor. Comput. Sci. Mitsuhiro Okada
1999	—	`conf`	The Calculus of algebraic Constructions. RTA Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
1999	J	`jnl`	The Finite Model Property for Various Fragments of Intuitionistic Linear Logic. J. Symb. Log. Mitsuhiro Okada, Kazushige Terui
1998	J	`jnl`	A direct independence proof of Buchholz's Hydra Game on finite labeled trees. Arch. Math. Log. Masahiro Hamano, Mitsuhiro Okada
1998	—	`conf`	Specifying Real-Time Finite-State Systems in Linear Logic. COTIC Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
1997	J	`jnl`	A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game. Math. Log. Q. Masahiro Hamano, Mitsuhiro Okada
1997	J	`jnl`	Abstract Data Type Systems. Theor. Comput. Sci. Jean-Pierre Jouannaud, Mitsuhiro Okada
1997	B	`conf`	Phase semantics for light linear logic. MFPS Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
1996	—	`conf`	A Graph-Theoretic Characterization Theorem for Multiplicative Fragment of Non-Commutative Linear Logic. Linear Logic Tokyo Meeting Misao Nagayama, Mitsuhiro Okada
1996	—	`ed.`	Linear Logic Tokyo Meeting 1996, Keio University, Mita Campus, Tokyo, Japan, March 29 - April 2, 1996 Linear Logic Tokyo Meeting Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
1996	—	`conf`	Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs. Linear Logic Tokyo Meeting Mitsuhiro Okada
1996	—	`conf`	Preface. Linear Logic Tokyo Meeting Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
1993	—	`conf`	LAMBDALG: Higher Order Algebraic Specification Language. RTA Yexuan Gui, Mitsuhiro Okada
1993	B	`conf`	System Description of LAMBDALG - A Higher Order Algebraic Specification Language. LPAR Yexuan Gui, Mitsuhiro Okada
1991	A*	`conf`	A Computation Model for Executable Higher-Order Algebraic Specification Languages LICS Jean-Pierre Jouannaud, Mitsuhiro Okada
1991	—	`ed.`	Conditional and Typed Rewriting Systems, 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990, Proceedings CTRS Stéphane Kaplan, Mitsuhiro Okada
1991	A*	`conf`	Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable. ICALP Jean-Pierre Jouannaud, Mitsuhiro Okada
1990	J	`jnl`	A Rationale for Conditional Equational Programming. Theor. Comput. Sci. Nachum Dershowitz, Mitsuhiro Okada
1989	B	`conf`	Strong Normalizability for the Combined System of the Typed lambda Calculus and an Arbitrary Convergent Term Rewrite System. ISSAC Mitsuhiro Okada
1988	A	`conf`	Canonical Conditional Rewrite Systems. CADE Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar
1988	—	`conf`	Conditional Equational Programming and the Theory of Conditional Term Rewriting. FGCS Nachum Dershowitz, Mitsuhiro Okada
1988	J	`jnl`	Note on a Proof of the Extended Kirby - Paris Theorem on Labeled Finite Trees. Eur. J. Comb. Mitsuhiro Okada
1988	J	`jnl`	On a Theory of Weak Implications. J. Symb. Log. Mitsuhiro Okada
1988	A*	`conf`	Proof-Theoretic Techniques for Term Rewriting Theory LICS Nachum Dershowitz, Mitsuhiro Okada
1987	—	`conf`	A Logical Analysis on Theory of Conditional Rewriting. CTRS Mitsuhiro Okada
1987	J	`jnl`	A Simple Relationship between Buchholz's New System of Ordinal Notations and Takeuti's System of Ordinal Diagrams. J. Symb. Log. Mitsuhiro Okada
1987	J	`jnl`	A weak intuitionistic propositional logic with purely constructive implication. Stud Logica Mitsuhiro Okada
1987	—	`conf`	Confluence of Conditional Rewrite Systems. CTRS Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar