Arrow Research search

Author name cluster

Kaiyang Lin

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
2 author rows

Possible papers

3

LORI Conference 2021 Conference Paper

Discrete Linear Temporal Logic with Knowing-Value Operator

  • Kaiyang Lin

Abstract In epistemic logic we are not only interested in the propositional knowledge expressed by “knowing that” operators, but also care about other types of knowledge used in natural language. In [ 1 ], Plaza proposed the “knowing value” operators and gave the complete axiomatization for the logic of knowledge with nonrigid designators. Moreover, in [ 2 ] Halpern and colleagues holds that, when analyzing a system in terms of knowledge, not only is the current state of knowledge of the agents in the system relevant, but also how that state of knowledge changes over time. So we introduce temporal logic operators ‘next’ and ‘until’ to extend Plaza’s system. The completeness proof is highly non-trivial and we referred to the work of [ 2, 3 ].

AAAI Conference 2019 Short Paper

Location-Based End-to-End Speech Recognition with Multiple Language Models

  • Zhijie Lin
  • Kaiyang Lin
  • Shiling Chen
  • Linlin Li
  • Zhou Zhao

End-to-End deep learning approaches for Automatic Speech Recognition (ASR) has been a new trend. In those approaches, starting active in many areas, language model can be considered as an important and effective method for semantic error correction. Many existing systems use one language model. In this paper, however, multiple language models (LMs) are applied into decoding. One LM is used for selecting appropriate answers and others, considering both context and grammar, for further decision. Experiment on a general location-based dataset show the effectiveness of our method.

LORI Conference 2019 Conference Paper

The Sequent Systems and Algebraic Semantics of Intuitionistic Tense Logics

  • Kaiyang Lin
  • Zhe Lin 0002

Abstract In this paper we consider a weak Ewald’s intuitionistic tense logic (wIK. t). We study its sequent system and algebraic semantics. We prove the soundness and the completeness results. We also show that the sequent system for wIK. t introduced in the present paper admits cut elimination. Finally we propose a criterion and prove that all extensions of wIK. t satisfying this criterion have cut free sequent systems.

v2026.09.13