Complexity Results for Restricted Credulous Default Reasoning. - Xishun Zhao; Decheng Ding; Hans Kleine Büning (AI Commun., 2000)

Satisfiable Formulas Closed Under Replacement. - Hans Kleine Büning; Xishun Zhao (Electron. Notes Discret. Math., 2001)

Some Algorithms for Extension Computation of Nonmonotonic Rule Systems. - Xishun Zhao; Decheng Ding (Fundam. Informaticae, 2001)

Complexity Results for 2CNF Default Theories. - Xishun Zhao; Decheng Ding (Fundam. Informaticae, 2001)

The Complexity of Read-Once Resolution. - Hans Kleine Büning; Xishun Zhao (Ann. Math. Artif. Intell., 2002)

Complexity of the Unique Extension Problem in Default Logic. - Xishun Zhao; Paolo Liberatore (Fundam. Informaticae, 2002)

Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. - Hans Kleine Büning; Xishun Zhao (Inf. Process. Lett., 2002)

On Boolean Models for Quantified Boolean Horn Formulas. - Hans Kleine Büning; K. Subramani 001; Xishun Zhao (SAT, 2003)

Read-Once Unit Resolution. - Hans Kleine Büning; Xishun Zhao (SAT, 2003)

Complexity of argument-based default reasoning with specificity. - Xishun Zhao (AI Commun., 2003)

On the structure of some classes of minimal unsatisfiable formulas. - Hans Kleine Büning; Xishun Zhao (Discret. Appl. Math., 2003)

Fixed-Parameter Tractability of Disjunction-Free Default Reasoning. - Xishun Zhao; Decheng Ding (J. Comput. Sci. Technol., 2003)

On Odd and Even Cycles in Normal Logic Programs. - Fangzhen Lin; Xishun Zhao (AAAI, 2004)

On Models for Quantified Boolean Formulas. - Hans Kleine Büning; Xishun Zhao (Logic versus Approximation, 2004)

Equivalence Models for Quantified Boolean Formulas. - Hans Kleine Büning; Xishun Zhao (SAT, 2004)

Regular Disjunction-Free Default Theories. - Xishun Zhao (J. Comput. Sci. Technol., 2004)

Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. - Uwe Bubeck; Hans Kleine Büning; Xishun Zhao (SAT, 2005)

Model-Equivalent Reductions. - Xishun Zhao; Hans Kleine Büning (SAT, 2005)

Extension and equivalence problems for clause minimal formulae. - Hans Kleine Büning; Xishun Zhao (Ann. Math. Artif. Intell., 2005)

Minimal False Quantified Boolean Formulas. - Hans Kleine Büning; Xishun Zhao (SAT, 2006)

Complexity of Operators on Compact Sets. - Xishun Zhao; Norbert Th. Müller (CCA, 2007)

Boolean Functions as Models for Quantified Boolean Formulas. - Hans Kleine Büning; K. Subramani 001; Xishun Zhao (J. Autom. Reason., 2007)

The Complexity of Some Subclasses of Minimal Unsatis able Formulas. - Hans Kleine Büning; Xishun Zhao (J. Satisf. Boolean Model. Comput., 2007)

An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas. - Hans Kleine Büning; Xishun Zhao (J. Satisf. Boolean Model. Comput., 2007)

Jordan Areas and Grids. - Norbert Th. Müller; Xishun Zhao (CCA, 2008)

Computational complexity of quantified Boolean formulas with fixed maximal deficiency. - Hans Kleine Büning; Xishun Zhao (Theor. Comput. Sci., 2008)

Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. - Hans Kleine Büning; Xishun Zhao; Uwe Bubeck (SAT, 2009)

Linear CNF formulas and satisfiability. - Stefan Porschen; Ewald Speckenmeyer; Xishun Zhao (Discret. Appl. Math., 2009)

NP-Logic Systems and Model-Equivalence Reductions - Yuping Shen; Xishun Zhao (CCA, 2010)

Resolution on Quantified Generalized Clause-sets.. - Jiwei Jin; Xishun Zhao (J. Satisf. Boolean Model. Comput., 2010)

Transformations into Normal Forms for Quantified Circuits. - Hans Kleine Büning; Xishun Zhao; Uwe Bubeck (SAT, 2011)

On Variables with Few Occurrences in Conjunctive Normal Forms. - Oliver Kullmann; Xishun Zhao (SAT, 2011)

Proof System for Plan Verification under 0-Approximation Semantics - Xishun Zhao; Yuping Shen (CoRR, 2011)

Proof Systems for Planning Under Cautious Semantics. - Yuping Shen; Xishun Zhao (Minds Mach., 2013)

Complexity and expressive power of second-order extended Horn logic. - Shiguang Feng; Xishun Zhao (Math. Log. Q., 2013)

On Davis-Putnam reductions for minimally unsatisfiable clause-sets. - Oliver Kullmann; Xishun Zhao (Theor. Comput. Sci., 2013)

Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas. - Yuping Shen; Xishun Zhao (KR, 2014)

Reasoning about Actions with Loops. - Jiankun He; Yuping Shen; Xishun Zhao (SETN, 2014)

Proof systems for planning under 0-approximation semantics. - Yuping Shen; Xishun Zhao (Sci. China Inf. Sci., 2014)

More on Descriptive Complexity of Second-Order HORN Logics. - Shiguang Feng; Xishun Zhao (CoRR, 2014)

Bounds for variables with few occurrences in conjunctive normal forms. - Oliver Kullmann; Xishun Zhao (CoRR, 2014)

Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses. - Oliver Kullmann; Xishun Zhao (CoRR, 2015)

Unsatisfiable hitting clause-sets with three more clauses than variables. - Oliver Kullmann; Xishun Zhao (CoRR, 2016)

Reasoning about actions with loops via Hoare logic. - Jiankun He; Xishun Zhao (Frontiers Comput. Sci., 2016)

Realizing correlated equilibrium by secure computation. - Lirong Qiu; Xin Sun 001; Xishun Zhao (J. Inf. Secur. Appl., 2017)

Ali Baba and the Thief, Convention Emergence in Games. - Xin Sun 001; Xishun Zhao; Livio Robaldo (J. Artif. Soc. Soc. Simul., 2017)

Quantum-enhanced Logic-based Blockchain I: Quantum Honest-success Byzantine Agreement and Qulogicoin. - Xin Sun 001; Quanlong Wang; Piotr Kulicki; Xishun Zhao (CoRR, 2018)

Norm-based deontic logic for access control, some computational results. - Xin Sun 001; Xishun Zhao; Livio Robaldo (Future Gener. Comput. Syst., 2018)

Stag hunt and trust emergence in social networks. - Lu Zhou 002; Chunhua Su; Xin Sun 001; Xishun Zhao; Kim-Kwang Raymond Choo (Future Gener. Comput. Syst., 2018)

Logarithmic-Bounded Second-Order Quantifiers and Limited Nondeterminism. - Kexu Wang; Xishun Zhao (CoRR, 2019)

Multi-task learning using a hybrid representation for text classification. - Guangquan Lu; Jiangzhang Gan; Jian Yin 001; Zhiping Luo; Bo Li 117; Xishun Zhao (Neural Comput. Appl., 2020)

Multi-task learning using variational auto-encoder for sentiment classification. - Guangquan Lu; Xishun Zhao; Jian Yin 001; Weiwei Yang; Bo Li 117 (Pattern Recognit. Lett., 2020)

Capturing the polynomial hierarchy by second-order revised Krom logic. - Shiguang Feng; Kexu Wang; Xishun Zhao; Yuping Shen (CoRR, 2022)

The Complexity and Expressive Power of Second-Order Extended Logic. - Shiguang Feng; Xishun Zhao (CoRR, 2022)

Capturing the polynomial hierarchy by second-order revised Krom logic. - Kexu Wang; Shiguang Feng; Xishun Zhao (Log. Methods Comput. Sci., 2023)

Computationally Hard Problems for Logic Programs under Answer Set Semantics. - Yuping Shen; Xishun Zhao (ACM Trans. Comput. Log., 2024)