Xishun Zhao

Publication Activity (10 Years)

Years Active: 2000-2023
Publications (10 Years): 13

Top Topics

Propositional Formulas

Top Venues

Future Gener. Comput. Syst.

Sci. China Inf. Sci.

Publications

Kexu Wang, Shiguang Feng, Xishun Zhao
Capturing the polynomial hierarchy by second-order revised Krom logic. Log. Methods Comput. Sci. 19 (3) (2023)
Shiguang Feng, Xishun Zhao
The Complexity and Expressive Power of Second-Order Extended Logic. CoRR (2022)
Shiguang Feng, Kexu Wang, Xishun Zhao, Yuping Shen
Capturing the polynomial hierarchy by second-order revised Krom logic. CoRR (2022)
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) (2020)
Guangquan Lu, Xishun Zhao, Jian Yin, Weiwei Yang, Bo Li
Multi-task learning using variational auto-encoder for sentiment classification. Pattern Recognit. Lett. 132 (2020)
Kexu Wang, Xishun Zhao
Logarithmic-Bounded Second-Order Quantifiers and Limited Nondeterminism. CoRR (2019)
Xin Sun, Quanlong Wang, Piotr Kulicki, Xishun Zhao
Quantum-enhanced Logic-based Blockchain I: Quantum Honest-success Byzantine Agreement and Qulogicoin. CoRR (2018)
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 (2018)
Xin Sun, Xishun Zhao, Livio Robaldo
Norm-based deontic logic for access control, some computational results. Future Gener. Comput. Syst. 79 (2018)
Lirong Qiu, Xin Sun, Xishun Zhao
Realizing correlated equilibrium by secure computation. J. Inf. Secur. Appl. 34 (2017)
Xin Sun, Xishun Zhao, Livio Robaldo
Ali Baba and the Thief, Convention Emergence in Games. J. Artif. Soc. Soc. Simul. 20 (3) (2017)
Oliver Kullmann, Xishun Zhao
Unsatisfiable hitting clause-sets with three more clauses than variables. CoRR (2016)
Jiankun He, Xishun Zhao
Reasoning about actions with loops via Hoare logic. Frontiers Comput. Sci. 10 (5) (2016)
Oliver Kullmann, Xishun Zhao
Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses. CoRR (2015)
Yuping Shen, Xishun Zhao
Proof systems for planning under 0-approximation semantics. Sci. China Inf. Sci. 57 (7) (2014)
Yuping Shen, Xishun Zhao
Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas. KR (2014)
Yuping Shen, Xishun Zhao
Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas. CoRR (2014)
Jiankun He, Yuping Shen, Xishun Zhao
Reasoning about Actions with Loops. SETN (2014)
Shiguang Feng, Xishun Zhao
More on Descriptive Complexity of Second-Order HORN Logics. CoRR (2014)
Oliver Kullmann, Xishun Zhao
Bounds for variables with few occurrences in conjunctive normal forms. CoRR (2014)
Yuping Shen, Xishun Zhao
Proof Systems for Planning Under Cautious Semantics. Minds Mach. 23 (1) (2013)
Oliver Kullmann, Xishun Zhao
On Davis-Putnam reductions for minimally unsatisfiable clause-sets. Theor. Comput. Sci. 492 (2013)
Shiguang Feng, Xishun Zhao
Complexity and expressive power of second-order extended Horn logic. Math. Log. Q. 59 (1-2) (2013)
Oliver Kullmann, Xishun Zhao
On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets. SAT (2012)
Oliver Kullmann, Xishun Zhao
On Davis-Putnam reductions for minimally unsatisfiable clause-sets CoRR (2012)
Hans Kleine Büning, Xishun Zhao, Uwe Bubeck
Transformations into Normal Forms for Quantified Circuits. SAT (2011)
Xishun Zhao, Yuping Shen
Proof System for Plan Verification under 0-Approximation Semantics CoRR (2011)
Oliver Kullmann, Xishun Zhao
On Variables with Few Occurrences in Conjunctive Normal Forms. SAT (2011)
Jiwei Jin, Xishun Zhao
Resolution on Quantified Generalized Clause-sets.. J. Satisf. Boolean Model. Comput. 7 (1) (2010)
Yuping Shen, Xishun Zhao
NP-Logic Systems and Model-Equivalence Reductions CCA (2010)
Oliver Kullmann, Xishun Zhao
On variables with few occurrences in conjunctive normal forms CoRR (2010)
Hans Kleine Büning, Xishun Zhao, Uwe Bubeck
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. SAT (2009)
Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao
Linear CNF formulas and satisfiability. Discret. Appl. Math. 157 (5) (2009)
Norbert Th. Müller, Xishun Zhao
Jordan Areas and Grids. Electron. Notes Theor. Comput. Sci. 221 (2008)
Hans Kleine Büning, Xishun Zhao
Computational complexity of quantified Boolean formulas with fixed maximal deficiency. Theor. Comput. Sci. 407 (1-3) (2008)
Xishun Zhao, Norbert Th. Müller
Complexity of Operators on Compact Sets. Electron. Notes Theor. Comput. Sci. 202 (2008)
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) (2007)
Hans Kleine Büning, K. Subramani, Xishun Zhao
Boolean Functions as Models for Quantified Boolean Formulas. J. Autom. Reason. 39 (1) (2007)
Hans Kleine Büning, Xishun Zhao
The Complexity of Some Subclasses of Minimal Unsatis able Formulas. J. Satisf. Boolean Model. Comput. 3 (1-2) (2007)
Hans Kleine Büning, Xishun Zhao
Minimal False Quantified Boolean Formulas. SAT (2006)
Uwe Bubeck, Hans Kleine Büning, Xishun Zhao
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. SAT (2005)
Hans Kleine Büning, Xishun Zhao
Extension and equivalence problems for clause minimal formulae. Ann. Math. Artif. Intell. 43 (1) (2005)
Xishun Zhao, Hans Kleine Büning
Model-Equivalent Reductions. SAT (2005)
Hans Kleine Büning, Xishun Zhao
Equivalence Models for Quantified Boolean Formulas. SAT (Selected Papers (2004)
Hans Kleine Büning, Xishun Zhao
On Models for Quantified Boolean Formulas. Logic versus Approximation (2004)
Fangzhen Lin, Xishun Zhao
On Odd and Even Cycles in Normal Logic Programs. AAAI (2004)
Xishun Zhao
Regular Disjunction-Free Default Theories. J. Comput. Sci. Technol. 19 (3) (2004)
Hans Kleine Büning, Xishun Zhao
Equivalence Models for Quantified Boolean Formulas. SAT (2004)
Hans Kleine Büning, Xishun Zhao
On the structure of some classes of minimal unsatisfiable formulas. Discret. Appl. Math. 130 (2) (2003)
Xishun Zhao, Decheng Ding
Fixed-Parameter Tractability of Disjunction-Free Default Reasoning. J. Comput. Sci. Technol. 18 (1) (2003)
Hans Kleine Büning, Xishun Zhao
Read-Once Unit Resolution. SAT (2003)
Hans Kleine Büning, K. Subramani, Xishun Zhao
On Boolean Models for Quantified Boolean Horn Formulas. SAT (2003)
Xishun Zhao
Complexity of argument-based default reasoning with specificity. AI Commun. 16 (2) (2003)
Hans Kleine Büning, Xishun Zhao
The Complexity of Read-Once Resolution. Ann. Math. Artif. Intell. 36 (4) (2002)
Xishun Zhao, Paolo Liberatore
Complexity of the Unique Extension Problem in Default Logic. Fundam. Informaticae 53 (1) (2002)
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) (2002)
Xishun Zhao, Decheng Ding
Some Algorithms for Extension Computation of Nonmonotonic Rule Systems. Fundam. Informaticae 48 (1) (2001)
Hans Kleine Büning, Xishun Zhao
Satisfiable Formulas Closed Under Replacement. Electron. Notes Discret. Math. 9 (2001)
Xishun Zhao, Decheng Ding
Complexity Results for 2CNF Default Theories. Fundam. Informaticae 45 (4) (2001)
Xishun Zhao, Decheng Ding, Hans Kleine Büning
Complexity Results for Restricted Credulous Default Reasoning. AI Commun. 13 (4) (2000)