default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXishun Zhao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j30]Kexu Wang
, Shiguang Feng, Xishun Zhao:
Capturing the polynomial hierarchy by second-order revised Krom logic. Log. Methods Comput. Sci. 19(3) (2023)- 2022
- [i12]Shiguang Feng, Kexu Wang, Xishun Zhao, Yuping Shen:
Capturing the polynomial hierarchy by second-order revised Krom logic. CoRR abs/2207.09226 (2022) - [i11]Shiguang Feng, Xishun Zhao:
The Complexity and Expressive Power of Second-Order Extended Logic. CoRR abs/2209.04837 (2022) - 2020
- [j29]Guangquan Lu, Jiangzhang Gan, Jian Yin, Zhiping Luo, Bo Li, Xishun Zhao:
Multi-task learning using a hybrid representation for text classification. Neural Comput. Appl. 32(11): 6467-6480 (2020) - [j28]Guangquan Lu, Xishun Zhao, Jian Yin, Weiwei Yang, Bo Li:
Multi-task learning using variational auto-encoder for sentiment classification. Pattern Recognit. Lett. 132: 115-122 (2020)
2010 – 2019
- 2019
- [i10]Kexu Wang, Xishun Zhao:
Logarithmic-Bounded Second-Order Quantifiers and Limited Nondeterminism. CoRR abs/1912.03841 (2019) - 2018
- [j27]Xin Sun, Xishun Zhao, Livio Robaldo:
Norm-based deontic logic for access control, some computational results. Future Gener. Comput. Syst. 79: 295-302 (2018) - [j26]Lu Zhou, Chunhua Su, Xin Sun, Xishun Zhao, Kim-Kwang Raymond Choo:
Stag hunt and trust emergence in social networks. Future Gener. Comput. Syst. 88: 168-172 (2018) - [i9]Xin Sun, Quanlong Wang, Piotr Kulicki, Xishun Zhao:
Quantum-enhanced Logic-based Blockchain I: Quantum Honest-success Byzantine Agreement and Qulogicoin. CoRR abs/1805.06768 (2018) - 2017
- [j25]Lirong Qiu, Xin Sun, Xishun Zhao:
Realizing correlated equilibrium by secure computation. J. Inf. Secur. Appl. 34: 251-254 (2017) - [j24]Xin Sun, Xishun Zhao, Livio Robaldo:
Ali Baba and the Thief, Convention Emergence in Games. J. Artif. Soc. Soc. Simul. 20(3) (2017) - 2016
- [j23]Jiankun He, Xishun Zhao:
Reasoning about actions with loops via Hoare logic. Frontiers Comput. Sci. 10(5): 870-888 (2016) - [i8]Oliver Kullmann, Xishun Zhao:
Unsatisfiable hitting clause-sets with three more clauses than variables. CoRR abs/1604.01288 (2016) - 2015
- [i7]Oliver Kullmann, Xishun Zhao:
Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses. CoRR abs/1505.02318 (2015) - 2014
- [j22]Yuping Shen, Xishun Zhao:
Proof systems for planning under 0-approximation semantics. Sci. China Inf. Sci. 57(7): 1-12 (2014) - [c18]Yuping Shen, Xishun Zhao:
Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas. KR 2014 - [c17]Jiankun He, Yuping Shen, Xishun Zhao:
Reasoning about Actions with Loops. SETN 2014: 504-509 - [i6]Shiguang Feng, Xishun Zhao:
More on Descriptive Complexity of Second-Order HORN Logics. CoRR abs/1403.6611 (2014) - [i5]Oliver Kullmann, Xishun Zhao:
Bounds for variables with few occurrences in conjunctive normal forms. CoRR abs/1408.0629 (2014) - [i4]Yuping Shen, Xishun Zhao:
Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas. CoRR abs/1412.0320 (2014) - 2013
- [j21]Yuping Shen, Xishun Zhao:
Proof Systems for Planning Under Cautious Semantics. Minds Mach. 23(1): 5-45 (2013) - [j20]Shiguang Feng, Xishun Zhao:
Complexity and expressive power of second-order extended Horn logic. Math. Log. Q. 59(1-2): 4-11 (2013) - [j19]Oliver Kullmann, Xishun Zhao:
On Davis-Putnam reductions for minimally unsatisfiable clause-sets. Theor. Comput. Sci. 492: 70-87 (2013) - 2012
- [c16]Oliver Kullmann, Xishun Zhao:
On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets. SAT 2012: 270-283 - [i3]Oliver Kullmann, Xishun Zhao:
On Davis-Putnam reductions for minimally unsatisfiable clause-sets. CoRR abs/1202.2600 (2012) - 2011
- [c15]Oliver Kullmann, Xishun Zhao:
On Variables with Few Occurrences in Conjunctive Normal Forms. SAT 2011: 33-46 - [c14]Hans Kleine Büning, Xishun Zhao, Uwe Bubeck:
Transformations into Normal Forms for Quantified Circuits. SAT 2011: 245-258 - [i2]Xishun Zhao, Yuping Shen:
Proof System for Plan Verification under 0-Approximation Semantics. CoRR abs/1108.5943 (2011) - 2010
- [j18]Jiwei Jin, Xishun Zhao:
Resolution on Quantified Generalized Clause-sets.. J. Satisf. Boolean Model. Comput. 7(1): 17-34 (2010) - [c13]Yuping Shen, Xishun Zhao:
NP-Logic Systems and Model-Equivalence Reductions. CCA 2010: 130-138 - [i1]Oliver Kullmann, Xishun Zhao:
On variables with few occurrences in conjunctive normal forms. CoRR abs/1010.5756 (2010)
2000 – 2009
- 2009
- [j17]Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao:
Linear CNF formulas and satisfiability. Discret. Appl. Math. 157(5): 1046-1068 (2009) - [c12]Hans Kleine Büning, Xishun Zhao, Uwe Bubeck:
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. SAT 2009: 391-397 - 2008
- [j16]Hans Kleine Büning, Xishun Zhao:
Computational complexity of quantified Boolean formulas with fixed maximal deficiency. Theor. Comput. Sci. 407(1-3): 448-457 (2008) - [c11]Norbert Th. Müller, Xishun Zhao:
Jordan Areas and Grids. CCA 2008: 191-206 - [e1]Hans Kleine Büning, Xishun Zhao:
Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings. Lecture Notes in Computer Science 4996, Springer 2008, ISBN 978-3-540-79718-0 [contents] - 2007
- [j15]Hans Kleine Büning, K. Subramani, Xishun Zhao:
Boolean Functions as Models for Quantified Boolean Formulas. J. Autom. Reason. 39(1): 49-75 (2007) - [j14]Hans Kleine Büning, Xishun Zhao:
The Complexity of Some Subclasses of Minimal Unsatis able Formulas. J. Satisf. Boolean Model. Comput. 3(1-2): 1-17 (2007) - [j13]Hans Kleine Büning, Xishun Zhao:
An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas. J. Satisf. Boolean Model. Comput. 3(3-4): 115-123 (2007) - [c10]Xishun Zhao, Norbert Th. Müller:
Complexity of Operators on Compact Sets. CCA 2007: 101-119 - 2006
- [c9]Hans Kleine Büning, Xishun Zhao:
Minimal False Quantified Boolean Formulas. SAT 2006: 339-352 - 2005
- [j12]Hans Kleine Büning, Xishun Zhao:
Extension and equivalence problems for clause minimal formulae. Ann. Math. Artif. Intell. 43(1): 295-306 (2005) - [c8]Xishun Zhao, Hans Kleine Büning:
Model-Equivalent Reductions. SAT 2005: 355-370 - [c7]Uwe Bubeck, Hans Kleine Büning, Xishun Zhao:
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. SAT 2005: 386-392 - 2004
- [j11]Xishun Zhao:
Regular Disjunction-Free Default Theories. J. Comput. Sci. Technol. 19(3): 329-340 (2004) - [c6]Fangzhen Lin, Xishun Zhao:
On Odd and Even Cycles in Normal Logic Programs. AAAI 2004: 80-85 - [c5]Hans Kleine Büning, Xishun Zhao:
On Models for Quantified Boolean Formulas. Logic versus Approximation 2004: 18-32 - [c4]Hans Kleine Büning, Xishun Zhao:
Equivalence Models for Quantified Boolean Formulas. SAT 2004 - [c3]Hans Kleine Büning, Xishun Zhao:
Equivalence Models for Quantified Boolean Formulas. SAT (Selected Papers 2004: 224-234 - 2003
- [j10]Xishun Zhao:
Complexity of argument-based default reasoning with specificity. AI Commun. 16(2): 107-119 (2003) - [j9]Hans Kleine Büning, Xishun Zhao:
On the structure of some classes of minimal unsatisfiable formulas. Discret. Appl. Math. 130(2): 185-207 (2003) - [j8]Xishun Zhao, Decheng Ding:
Fixed-Parameter Tractability of Disjunction-Free Default Reasoning. J. Comput. Sci. Technol. 18(1): 118-124 (2003) - [c2]Hans Kleine Büning, K. Subramani, Xishun Zhao:
On Boolean Models for Quantified Boolean Horn Formulas. SAT 2003: 93-104 - [c1]Hans Kleine Büning, Xishun Zhao:
Read-Once Unit Resolution. SAT 2003: 356-369 - 2002
- [j7]Hans Kleine Büning, Xishun Zhao:
The Complexity of Read-Once Resolution. Ann. Math. Artif. Intell. 36(4): 419-435 (2002) - [j6]Xishun Zhao, Paolo Liberatore:
Complexity of the Unique Extension Problem in Default Logic. Fundam. Informaticae 53(1): 79-104 (2002) - [j5]Hans Kleine Büning, Xishun Zhao:
Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. Inf. Process. Lett. 84(3): 147-151 (2002) - 2001
- [j4]Hans Kleine Büning, Xishun Zhao:
Satisfiable Formulas Closed Under Replacement. Electron. Notes Discret. Math. 9: 48-58 (2001) - [j3]Xishun Zhao, Decheng Ding:
Complexity Results for 2CNF Default Theories. Fundam. Informaticae 45(4): 393-404 (2001) - [j2]Xishun Zhao, Decheng Ding:
Some Algorithms for Extension Computation of Nonmonotonic Rule Systems. Fundam. Informaticae 48(1): 93-106 (2001) - 2000
- [j1]Xishun Zhao, Decheng Ding, Hans Kleine Büning:
Complexity Results for Restricted Credulous Default Reasoning. AI Commun. 13(4): 249-258 (2000)
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-04-24 23:08 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:
