Mitsuhiro Okada

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 15

Top Topics

Database Management

Default Reasoning

Probabilistic Logic

Top Venues

JSAI-isAI Workshops

Publications

Kentaro Ozeki, Risako Ando, Takanobu Morishita, Hirohiko Abe, Koji Mineshima, Mitsuhiro Okada
Exploring Reasoning Biases in Large Language Models Through Syllogism: Insights from the NeuBAROCO Dataset. ACL (Findings) (2024)
Risako Ando, Takanobu Morishita, Hirohiko Abe, Koji Mineshima, Mitsuhiro Okada
Evaluating Large Language Models with NeuBAROCO: Syllogistic Reasoning Ability and Human-like Biases. CoRR (2023)
Mitsuhiro Okada, Takayuki Suzuki, Naoya Nishio, Hasitha Muthumala Waidyasooriya, Masanori Hariyama
FPGA-Accelerated Searchable Encrypted Database Management Systems for Cloud Services. IEEE Trans. Cloud Comput. 10 (2) (2022)
Katsuyuki Nakamura, Hiroki Ohashi, Mitsuhiro Okada
Sensor-Augmented Egocentric-Video Captioning with Dynamic Modal Attention. CoRR (2021)
Katsuyuki Nakamura, Hiroki Ohashi, Mitsuhiro Okada
Sensor-Augmented Egocentric-Video Captioning with Dynamic Modal Attention. ACM Multimedia (2021)
Mitsuhiro Okada
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 (2020)
Takashi Ideno, Masahiro Morii, Kazuhisa Takemura, Mitsuhiro Okada
On Effects of Changing Multi-attribute Table Design on Decision Making: An Eye-Tracking Study. Diagrams (2020)
Mitsuhiro Okada, Yuta Takahashi
A Simplified Application of Howard's Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems. WRLA@ETAPS (2020)
Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
Corrigendum to "Inductive-data-type systems" [Theoret. Comput. Sci. 272 (1-2) (2002) 41-68]. Theor. Comput. Sci. 817 (2020)
Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla, Mitsuhiro Okada
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability. ACM Trans. Comput. Log. 21 (1) (2020)
Gergei Bana, Mitsuhiro Okada
A Semantics for "Typically" in First-Order Default Reasoning. JSAI-isAI Workshops (2020)
Mohammad Al-Naser, Takehiro Niikura, Sheraz Ahmed, Hiroki Ohashi, Takuto Sato, Mitsuhiro Okada, Katsuyuki Nakamura, Andreas Dengel
Quantifying Quality of Actions Using Wearable Sensor. AALTD@PKDD/ECML (2019)
Mitsuhiro Okada, Yuta Takahashi
On Quasi Ordinal Diagram Systems. TERMGRAPH@FSCD (2018)
Gergei Bana, Mitsuhiro Okada
Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4. CSL (2016)
Mirja Helena Hartimo, Mitsuhiro Okada
Syntactic reduction in Husserl's early phenomenology of arithmetic. Synth. 193 (3) (2016)
Koji Mineshima, Yuri Sato, Ryo Takemura, Mitsuhiro Okada
Towards explaining the cognitive efficacy of Euler diagrams in syllogistic reasoning: A relational perspective. J. Vis. Lang. Comput. 25 (3) (2014)
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
Computationally complete symbolic attacker and key exchange. CCS (2013)
Janna Hastings, Colin R. Batchelor, Mitsuhiro Okada
Shape Perception in Chemistry. SHAPES (2013)
Mitsuhiro Okada
Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk). RTA (2013)
Koji Mineshima, Mitsuhiro Okada, Ryo Takemura
A Diagrammatic Inference System with Euler Circles. J. Log. Lang. Inf. 21 (3) (2012)
Koji Mineshima, Mitsuhiro Okada, Ryo Takemura
A Generalized Syllogistic Inference System based on Inclusion and Exclusion Relations. Stud Logica 100 (4) (2012)
Yuri Sato, Koji Mineshima, Ryo Takemura, Mitsuhiro Okada
On the Cognitive Efficacy of Euler Diagrams in Syllogistic Reasoning: A Relational Perspective. ED@Diagrams (2012)
Hiroki Mizosoe, Mitsuhiro Okada, Hironori Komi, Manabu Sasamoto, Yoshinori Hatori
Very low-delay H.264 codec for consumer applications. ICCE (2012)
Koji Mineshima, Mitsuhiro Okada, Ryo Takemura
Two Types of Diagrammatic Inference Systems: Natural Deduction Style and Resolution Style. Diagrams (2010)
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
Secrecy-Oriented First-Order Logical Analysis of Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2010 (2010)
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols. Formal to Practical Security (2009)
Koji Mineshima, Mitsuhiro Okada, Yuri Sato, Ryo Takemura
Diagrammatic Reasoning System with Euler Circles: Theory and Experiment Design. Diagrams (2008)
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
Computational Semantics for Basic Protocol Logic - A Stochastic Approach. IACR Cryptol. ePrint Arch. 2007 (2007)
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
Computational Semantics for Basic Protocol Logic - A Stochastic Approach. ASIAN (2007)
Mitsuhiro Okada, Ryo Takemura
-Calculus. Rewriting, Computation and Proof (2007)
Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
Inductive-data-type Systems CoRR (2006)
Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
The Calculus of Algebraic Constructions CoRR (2006)
Koji Hasebe, Mitsuhiro Okada
Completeness and Counter-Example Generations of a Basic Protocol Logic: (Extended Abstract). Electron. Notes Theor. Comput. Sci. 147 (1) (2006)
Max I. Kanovich, Mitsuhiro Okada, Kazushige Terui
Intuitionistic phase semantics is almost classical. Math. Struct. Comput. Sci. 16 (1) (2006)
Mitsuhiro Okada, Yutaro Sugimoto, Sumi Yoshikawa, Akihiko Konagaya
Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences. Essays Dedicated to Joseph A. Goguen (2006)
Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
Phase semantics for light linear logic. Theor. Comput. Sci. 294 (3) (2003)
Koji Hasebe, Mitsuhiro Okada
Inferences on Honesty in Compositional Logic for Protocol Analysis. ISSS (2003)
Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
Preface. Theor. Comput. Sci. 294 (3) (2003)
Misao Nagayama, Mitsuhiro Okada
A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic. Theor. Comput. Sci. 294 (3) (2003)
Mitsuhiro Okada
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theor. Comput. Sci. 281 (1-2) (2002)
Koji Hasebe, Mitsuhiro Okada
A Logical Verification Method for Security Protocols Based on Linear Logic and BAN Logic. ISSS (2002)
Mariangiola Dezani-Ciancaglini, Mitsuhiro Okada, Masako Takahashi
Theories of Types and Proofs 1997 - Preface. Theor. Comput. Sci. 272 (1-2) (2002)
Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
Inductive-data-type systems. Theor. Comput. Sci. 272 (1-2) (2002)
Mitsuhiro Okada
Ideal Concepts, Intuitions, and Mathematical Knowledge Acquisitions in Husserl and Hilbert. Progress in Discovery Science (2002)
Misao Nagayama, Mitsuhiro Okada
A New Correctness Criterion for The Proof Nets of Non-Commutative Multiplicative Linear Logics. J. Symb. Log. 66 (4) (2001)
Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
The Calculus of algebraic Constructions. RTA (1999)
Mitsuhiro Okada
Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic. Theor. Comput. Sci. 227 (1-2) (1999)
Mitsuhiro Okada, Kazushige Terui
The Finite Model Property for Various Fragments of Intuitionistic Linear Logic. J. Symb. Log. 64 (2) (1999)
Masahiro Hamano, Mitsuhiro Okada
A direct independence proof of Buchholz's Hydra Game on finite labeled trees. Arch. Math. Log. 37 (2) (1998)
Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
Specifying Real-Time Finite-State Systems in Linear Logic. Electron. Notes Theor. Comput. Sci. 16 (1) (1998)
Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
Phase semantics for light linear logic. MFPS (1997)
Jean-Pierre Jouannaud, Mitsuhiro Okada
Abstract Data Type Systems. Theor. Comput. Sci. 173 (2) (1997)
Masahiro Hamano, Mitsuhiro Okada
A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game. Math. Log. Q. 43 (1997)
Misao Nagayama, Mitsuhiro Okada
A Graph-Theoretic Characterization Theorem for Multiplicative Fragment of Non-Commutative Linear Logic. Electron. Notes Theor. Comput. Sci. 3 (1996)
Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
Preface. Electron. Notes Theor. Comput. Sci. 3 (1996)
Mitsuhiro Okada
Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs. Electron. Notes Theor. Comput. Sci. 3 (1996)
Yexuan Gui, Mitsuhiro Okada
System Description of LAMBDALG - A Higher Order Algebraic Specification Language. LPAR (1993)
Yexuan Gui, Mitsuhiro Okada
LAMBDALG: Higher Order Algebraic Specification Language. RTA (1993)
Jean-Pierre Jouannaud, Mitsuhiro Okada
A Computation Model for Executable Higher-Order Algebraic Specification Languages LICS (1991)
Jean-Pierre Jouannaud, Mitsuhiro Okada
Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable. ICALP (1991)
Nachum Dershowitz, Mitsuhiro Okada
A Rationale for Conditional Equational Programming. Theor. Comput. Sci. 75 (1&2) (1990)
Mitsuhiro Okada
Strong Normalizability for the Combined System of the Typed lambda Calculus and an Arbitrary Convergent Term Rewrite System. ISSAC (1989)
Nachum Dershowitz, Mitsuhiro Okada
Proof-Theoretic Techniques for Term Rewriting Theory LICS (1988)
Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar
Canonical Conditional Rewrite Systems. CADE (1988)
Mitsuhiro Okada
Note on a Proof of the Extended Kirby - Paris Theorem on Labeled Finite Trees. Eur. J. Comb. 9 (3) (1988)
Nachum Dershowitz, Mitsuhiro Okada
Conditional Equational Programming and the Theory of Conditional Term Rewriting. FGCS (1988)
Mitsuhiro Okada
On a Theory of Weak Implications. J. Symb. Log. 53 (1) (1988)
Mitsuhiro Okada
A weak intuitionistic propositional logic with purely constructive implication. Stud Logica 46 (4) (1987)
Mitsuhiro Okada
A Simple Relationship between Buchholz's New System of Ordinal Notations and Takeuti's System of Ordinal Diagrams. J. Symb. Log. 52 (3) (1987)
Mitsuhiro Okada
A Logical Analysis on Theory of Conditional Rewriting. CTRS (1987)
Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar
Confluence of Conditional Rewrite Systems. CTRS (1987)