Mitsuhiro Okada

Orcid: 0000-0001-9117-4935

According to our database1, Mitsuhiro Okada authored at least 66 papers between 1987 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Eye-Tracking Study on the Effects of Using Highlighted Multi-attribute Tables: A Preliminary Report.
Proceedings of the Diagrammatic Representation and Inference, 2024

Can Euler Diagrams Improve Syllogistic Reasoning in Large Language Models?
Proceedings of the Diagrammatic Representation and Inference, 2024

Exploring Reasoning Biases in Large Language Models Through Syllogism: Insights from the NeuBAROCO Dataset.
Proceedings of the Findings of the Association for Computational Linguistics, 2024

2023
Evaluating Large Language Models with NeuBAROCO: Syllogistic Reasoning Ability and Human-like Biases.
CoRR, 2023

2022
FPGA-Accelerated Searchable Encrypted Database Management Systems for Cloud Services.
IEEE Trans. Cloud Comput., 2022

2021
Sensor-Augmented Egocentric-Video Captioning with Dynamic Modal Attention.
Proceedings of the MM '21: ACM Multimedia Conference, Virtual Event, China, October 20, 2021

2020
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability.
ACM Trans. Comput. Log., 2020

Corrigendum to "Inductive-data-type systems" [Theoret. Comput. Sci. 272 (1-2) (2002) 41-68].
Theor. Comput. Sci., 2020

A Simplified Application of Howard's Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems.
Proceedings of the Rewriting Logic and Its Applications - 13th International Workshop, 2020

A Semantics for "Typically" in First-Order Default Reasoning.
Proceedings of the New Frontiers in Artificial Intelligence, 2020

On Effects of Changing Multi-attribute Table Design on Decision Making: An Eye-Tracking Study.
Proceedings of the Diagrammatic Representation and Inference, 2020

A Small Remark on Hilbert's Finitist View of Divisibility and Kanovich-Okada-Scedrov's Logical Analysis of Real-Time Systems.
Proceedings of the Logic, 2020

2019
Quantifying Quality of Actions Using Wearable Sensor.
Proceedings of the Advanced Analytics and Learning on Temporal Data, 2019

2018
On Quasi Ordinal Diagram Systems.
Proceedings of the Proceedings Tenth International Workshop on Computing with Terms and Graphs, 2018

2016
Syntactic reduction in Husserl's early phenomenology of arithmetic.
Synth., 2016

Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2014
Towards explaining the cognitive efficacy of Euler diagrams in syllogistic reasoning: A relational perspective.
J. Vis. Lang. Comput., 2014

2013
Shape Perception in Chemistry.
Proceedings of the Second Interdisciplinary Workshop The Shape of Things, 2013

Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk).
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Computationally complete symbolic attacker and key exchange.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012
A Generalized Syllogistic Inference System based on Inclusion and Exclusion Relations.
Stud Logica, 2012

A Diagrammatic Inference System with Euler Circles.
J. Log. Lang. Inf., 2012

Very low-delay H.264 codec for consumer applications.
Proceedings of the IEEE International Conference on Consumer Electronics, 2012

On the Cognitive Efficacy of Euler Diagrams in Syllogistic Reasoning: A Relational Perspective.
Proceedings of the 3rd International Workshop on Euler Diagrams, 2012

2010
Secrecy-Oriented First-Order Logical Analysis of Cryptographic Protocols.
IACR Cryptol. ePrint Arch., 2010

Two Types of Diagrammatic Inference Systems: Natural Deduction Style and Resolution Style.
Proceedings of the Diagrammatic Representation and Inference, 6th International Conference, 2010

2009
Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols.
Proceedings of the Formal to Practical Security, 2009

2008
Diagrammatic Reasoning System with Euler Circles: Theory and Experiment Design.
Proceedings of the Diagrammatic Representation and Inference, 5th International Conference, 2008

2007
Computational Semantics for Basic Protocol Logic - A Stochastic Approach.
IACR Cryptol. ePrint Arch., 2007

Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic <i>lambda</i> -Calculus.
Proceedings of the Rewriting, 2007

2006
Intuitionistic phase semantics is almost classical.
Math. Struct. Comput. Sci., 2006

Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences.
Proceedings of the Algebra, Meaning, and Computation, 2006

2005
Completeness and Counter-Example Generations of a Basic Protocol Logic: (Extended Abstract).
Proceedings of the 6th International Workshop on Rule-Based Programming, 2005

2003
A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic.
Theor. Comput. Sci., 2003

Phase semantics for light linear logic.
Theor. Comput. Sci., 2003

Preface.
Theor. Comput. Sci., 2003

Inferences on Honesty in Compositional Logic for Protocol Analysis.
Proceedings of the Software Security, 2003

2002
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
Theor. Comput. Sci., 2002

Theories of Types and Proofs 1997 - Preface.
Theor. Comput. Sci., 2002

Inductive-data-type systems.
Theor. Comput. Sci., 2002

A Logical Verification Method for Security Protocols Based on Linear Logic and BAN Logic.
Proceedings of the Software Security -- Theories and Systems, 2002

Ideal Concepts, Intuitions, and Mathematical Knowledge Acquisitions in Husserl and Hilbert.
Proceedings of the Progress in Discovery Science, 2002

2001
A New Correctness Criterion for The Proof Nets of Non-Commutative Multiplicative Linear Logics.
J. Symb. Log., 2001

1999
Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic.
Theor. Comput. Sci., 1999

The Finite Model Property for Various Fragments of Intuitionistic Linear Logic.
J. Symb. Log., 1999

The Calculus of algebraic Constructions.
Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

1998
Specifying Real-Time Finite-State Systems in Linear Logic.
Proceedings of the Second Workshop on Concurrent Constraint Programming for Time Critical Applications and Multi-Agent Systems, 1998

A direct independence proof of Buchholz's Hydra Game on finite labeled trees.
Arch. Math. Log., 1998

1997
Abstract Data Type Systems.
Theor. Comput. Sci., 1997

A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game.
Math. Log. Q., 1997

1996
Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs.
Proceedings of the Linear Logic Tokyo Meeting 1996, Keio University, Mita Campus, Tokyo, Japan, March 29, 1996

1993
LAMBDALG: Higher Order Algebraic Specification Language.
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

System Description of LAMBDALG - A Higher Order Algebraic Specification Language.
Proceedings of the Logic Programming and Automated Reasoning,4th International Conference, 1993

1991
A Computation Model for Executable Higher-Order Algebraic Specification Languages
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
A Rationale for Conditional Equational Programming.
Theor. Comput. Sci., 1990

1989
Strong Normalizability for the Combined System of the Typed lambda Calculus and an Arbitrary Convergent Term Rewrite System.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1988
On a Theory of Weak Implications.
J. Symb. Log., 1988

Note on a Proof of the Extended Kirby - Paris Theorem on Labeled Finite Trees.
Eur. J. Comb., 1988

Proof-Theoretic Techniques for Term Rewriting Theory
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

Conditional Equational Programming and the Theory of Conditional Term Rewriting.
Proceedings of the International Conference on Fifth Generation Computer Systems, 1988

Canonical Conditional Rewrite Systems.
Proceedings of the 9th International Conference on Automated Deduction, 1988

1987
A weak intuitionistic propositional logic with purely constructive implication.
Stud Logica, 1987

A Simple Relationship between Buchholz's New System of Ordinal Notations and Takeuti's System of Ordinal Diagrams.
J. Symb. Log., 1987

A Logical Analysis on Theory of Conditional Rewriting.
Proceedings of the Conditional Term Rewriting Systems, 1987

Confluence of Conditional Rewrite Systems.
Proceedings of the Conditional Term Rewriting Systems, 1987


  Loading...