Zhe Lin

According to our database, Zhe Lin authored at least 20 papers between 2010 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

From weakly topological quasi-Boolean algebra to weak pre-rough algebra and closely related structures: an algebraic and logical investigation.

Yiheng Wang, Zhe Lin, Mihir Kumar Chakraborty

Log. J. IGPL, 2026

2022

A Proof-Theoretic Approach to Negative Translations in Intuitionistic Tense Logics.

Zhe Lin, Minghui Ma

Stud Logica, 2022

2021

Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability.

Zhe Lin, Mihir Kumar Chakraborty, Minghui Ma

Fundam. Informaticae, 2021

Language-Guided Global Image Editing via Cross-Modal Cyclic Mechanism.

Wentao Jiang, Ning Xu, Jiayun Wang, Chen Gao, Jing Shi, Zhe Lin, Si Liu

Proceedings of the 2021 IEEE/CVF International Conference on Computer Vision, 2021

2020

Incorporating Reinforced Adversarial Learning in Autoregressive Image Generation.

Kenan E. Ak, Ning Xu, Zhe Lin, Yilin Wang

Proceedings of the Computer Vision - ECCV 2020, 2020

2019

Gentzen sequent calculi for some intuitionistic modal logics.

Zhe Lin, Minghui Ma

Log. J. IGPL, 2019

The Sequent Systems and Algebraic Semantics of Intuitionistic Tense Logics.

Kaiyang Lin, Zhe Lin

Proceedings of the Logic, Rationality, and Interaction - 7th International Workshop, 2019

The Finite Embeddability Property for Topological Quasi-Boolean Algebra 5.

Zhe Lin, Mihir Kumar Chakraborty

Proceedings of the Logic and Its Applications - 8th Indian Conference, 2019

2018

Finite Model Property of Pretransitive Modal Logic.

Zhe Lin, Minghui Ma

CoRR, 2018

Sequent Calculi for Varieties of Topological Quasi-Boolean Algebras.

Minghui Ma, Mihir Kumar Chakraborty, Zhe Lin

Proceedings of the Rough Sets - International Joint Conference, 2018

Decidability in Pre-rough Algebras: Extended Abstract.

Zhe Lin, Mihir Kumar Chakraborty, Minghui Ma

Proceedings of the Rough Sets - International Joint Conference, 2018

2016

On the Complexity of the Equational Theory of Residuated Boolean Algebras.

Zhe Lin, Minghui Ma

Proceedings of the Logic, Language, Information, and Computation, 2016

2014

Non-associative Lambek calculus with modalities: interpolation, complexity and FEP.

Zhe Lin

Log. J. IGPL, 2014

Residuated Basic Logic II. Interpolation, Decidability and Embedding.

Minghui Ma, Zhe Lin

CoRR, 2014

Residuated Basic Logic I.

Minghui Ma, Zhe Lin

CoRR, 2014

The Computational Compexity of Decision Problem in Additive Extensions of Nonassociative Lambek Calculus.

Zhe Lin, Minghui Ma

CoRR, 2014

2012

Pregroup grammars with letter promotions: Complexity and context-freeness.

Wojciech Buszkowski, Zhe Lin, Katarzyna Moroz

J. Comput. Syst. Sci., 2012

Distributive Full Nonassociative Lambek Calculus with S4-Modalities Is Context-Free.

Zhe Lin

Proceedings of the Logical Aspects of Computational Linguistics, 2012

2010

Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness.

Zhe Lin

Proceedings of the Language and Automata Theory and Applications, 2010

Pregroup Grammars with Letter Promotions.

Wojciech Buszkowski, Zhe Lin

Proceedings of the Language and Automata Theory and Applications, 2010