default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhiguang Zhao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Lei Guo, Lei Liu
, Zhiguang Zhao, Xiaodong Xia:
An improved RIME optimization algorithm for lung cancer image segmentation. Comput. Biol. Medicine 174: 108219 (2024)- [j13]Zhiguang Zhao:
Sahlqvist completeness theory for hybrid logic with downarrow binder. Log. J. IGPL 32(3): 367-393 (2024) - [j12]Aosheng Cheng, Yan Zhang, Zhiqiang Qian, Xueli Yuan, Sumei Yao, Wenqing Ni, Yijin Zheng, Hongmin Zhang, Quan Lu, Zhiguang Zhao:
Integrating multi-task and cost-sensitive learning for predicting mortality risk of chronic diseases in the elderly using real-world data. Int. J. Medical Informatics 191: 105567 (2024) - [j11]Sumei Yao, Yan Zhang, Jing Chen, Quan Lu, Zhiguang Zhao:
Enhancing identification performance of cognitive impairment high-risk based on a semi-supervised learning method. J. Biomed. Informatics 157: 104699 (2024) - 2023
- [j10]Zhiguang Zhao:
Algorithmic correspondence for hybrid logic with binder. Log. J. IGPL 31(1): 39-67 (2023) - [j9]Zhiguang Zhao:
Jónsson-style canonicity in distributive modal µ-calculus. Log. J. IGPL 31(3): 401-421 (2023) - [j8]Zhiguang Zhao:
Sahlqvist correspondence theory for second-order propositional modal logic. J. Log. Comput. 33(3): 577-598 (2023) - [j7]Zhiguang Zhao:
Correspondence Theory for Modal Fairtlough-Mendler Semantics of Intuitionistic Modal Logic. Stud Logica 111(6): 1057-1082 (2023) - [c11]Xiaoxuan Fu, Zhiguang Zhao:
Dynamic Modal Logic with Counting: When Reduction Axioms Work and Fail. CLAR 2023: 11-24 - [c10]Xiaoxuan Fu, Zhiguang Zhao:
A Logic for Preference Lifting Under Uncertainty and Its Decidability. CLAR 2023: 213-223 - 2022
- [c9]Zhiguang Zhao:
Correspondence Theory for Generalized Modal Algebras. WoLLIC 2022: 53-69 - [i10]Zhiguang Zhao:
Sahlqvist-Type Completeness Theory for Hybrid Logic with Binder. CoRR abs/2207.01288 (2022) - [i9]Zhiguang Zhao:
Correspondence Theory for Modal Fairtlough-Mendler Semantics of Intuitionistic Modal Logic. CoRR abs/2210.02216 (2022) - [i8]Zhiguang Zhao:
Taming "McKinsey-like" formula: An Extended Correspondence and Completeness Theory for Hybrid Logic H(@). CoRR abs/2210.04433 (2022) - 2021
- [j6]Zhiguang Zhao:
Algorithmic correspondence and canonicity for possibility semantics. J. Log. Comput. 31(2): 523-572 (2021) - [c8]Zhiguang Zhao:
Sahlqvist-type Correspondence Theory for Second-Order Propositional Modal Logic (Short Paper). SOQE@KR 2021: 112-121 - [i7]Zhiguang Zhao:
Algorithmic Correspondence for Hybrid Logic with Binder. CoRR abs/2102.13291 (2021) - [i6]Zhiguang Zhao:
Sahlqvist Correspondence Theory for Second-Order Propositional Modal Logic. CoRR abs/2110.08561 (2021) - 2020
- [i5]Zhiguang Zhao:
Sahlqvist Correspondence Theory for Sabotage Modal Logic. CoRR abs/2003.08070 (2020) - [i4]Zhiguang Zhao:
Sahlqvist Correspondence Theory for Instantial Neighbourhood Logic. CoRR abs/2003.14187 (2020)
2010 – 2019
- 2019
- [j5]Willem Conradie, Alessandra Palmigiano, Zhiguang Zhao:
Sahlqvist via Translation. Log. Methods Comput. Sci. 15(1) (2019) - 2018
- [j4]Giuseppe Greco, Minghui Ma, Alessandra Palmigiano, Apostolos Tzimoulis, Zhiguang Zhao:
Unified correspondence as a proof-theoretic tool. J. Log. Comput. 28(7): 1367-1442 (2018) - 2017
- [j3]Alessandra Palmigiano, Sumit Sourabh, Zhiguang Zhao:
Sahlqvist theory for impossible worlds. J. Log. Comput. 27(3): 775-816 (2017) - [j2]Alessandra Palmigiano, Sumit Sourabh, Zhiguang Zhao:
Jónsson-style canonicity for ALBA-inequalities. J. Log. Comput. 27(3): 817-865 (2017) - [j1]Minghui Ma, Zhiguang Zhao:
Unified correspondence and proof theory for strict implication. J. Log. Comput. 27(3): 921-960 (2017) - [c7]Zhiguang Zhao:
Algorithmic Correspondence and Canonicity for Possibility Semantics (Abstract). SOQE 2017: 106-109 - [c6]Willem Conradie, Andrew Craig, Alessandra Palmigiano, Zhiguang Zhao:
Constructive Canonicity for Lattice-Based Fixed Point Logics. WoLLIC 2017: 92-109 - [c5]Zhiguang Zhao:
Algorithmic Sahlqvist Preservation for Modal Compact Hausdorff Spaces. WoLLIC 2017: 387-400 - 2016
- [i3]Giuseppe Greco, Minghui Ma, Alessandra Palmigiano, Apostolos Tzimoulis, Zhiguang Zhao:
Unified Correspondence as a Proof-Theoretic Tool. CoRR abs/1603.08204 (2016) - [i2]María Esteban, Alessandra Palmigiano, Zhiguang Zhao:
An Abstract Algebraic Logic View on Judgment Aggregation. CoRR abs/1603.08206 (2016) - 2015
- [c4]Geghard Bedrosian, Alessandra Palmigiano, Zhiguang Zhao:
Generalized Ultraproduct and Kirman-Sondermann Correspondence for Vote Abstention. LORI 2015: 27-39 - [c3]María Esteban, Alessandra Palmigiano, Zhiguang Zhao:
An Abstract Algebraic Logic View on Judgment Aggregation. LORI 2015: 77-89 - [c2]Nick Bezhanishvili, Dick de Jongh, Apostolos Tzimoulis, Zhiguang Zhao:
Universal Models for the Positive Fragment of Intuitionistic Logic. TbiLLC 2015: 229-250 - [i1]Willem Conradie, Alessandra Palmigiano, Sumit Sourabh, Zhiguang Zhao:
Canonicity and Relativized Canonicity via Pseudo-Correspondence: an Application of ALBA. CoRR abs/1511.04271 (2015) - 2013
- [c1]Dick de Jongh, Zhiguang Zhao:
Positive Formulas in Intuitionistic and Minimal Logic. TbiLLC 2013: 175-189
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
