Xishun Zhao - RankMe

63 papers A* 2A 11C 3Journal 44Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	The logics for the complexity classes with limited non-determinism. J. Log. Comput. Kexu Wang, Shiguang Feng, Xishun Zhao
2024	J	`jnl`	Computationally Hard Problems for Logic Programs under Answer Set Semantics. ACM Trans. Comput. Log. Yuping Shen, Xishun Zhao
2023	J	`jnl`	Capturing the polynomial hierarchy by second-order revised Krom logic. Log. Methods Comput. Sci. Kexu Wang, Shiguang Feng, Xishun Zhao
2022	J	`jnl`	Capturing the polynomial hierarchy by second-order revised Krom logic. CoRR Shiguang Feng, Kexu Wang, Xishun Zhao, Yuping Shen
2022	J	`jnl`	The Complexity and Expressive Power of Second-Order Extended Logic. CoRR Shiguang Feng, Xishun Zhao
2020	J	`jnl`	Multi-task learning using a hybrid representation for text classification. Neural Comput. Appl. Guangquan Lu, Jiangzhang Gan, Jian Yin, Zhiping Luo, Bo Li, Xishun Zhao
2020	J	`jnl`	Multi-task learning using variational auto-encoder for sentiment classification. Pattern Recognit. Lett. Guangquan Lu, Xishun Zhao, Jian Yin, Weiwei Yang, Bo Li
2019	J	`jnl`	Logarithmic-Bounded Second-Order Quantifiers and Limited Nondeterminism. CoRR Kexu Wang, Xishun Zhao
2018	J	`jnl`	Norm-based deontic logic for access control, some computational results. Future Gener. Comput. Syst. Xin Sun, Xishun Zhao, Livio Robaldo
2018	J	`jnl`	Quantum-enhanced Logic-based Blockchain I: Quantum Honest-success Byzantine Agreement and Qulogicoin. CoRR Xin Sun, Quanlong Wang, Piotr Kulicki, Xishun Zhao
2018	J	`jnl`	Stag hunt and trust emergence in social networks. Future Gener. Comput. Syst. Lu Zhou, Chunhua Su, Xin Sun, Xishun Zhao, Kim-Kwang Raymond Choo
2017	J	`jnl`	Ali Baba and the Thief, Convention Emergence in Games. J. Artif. Soc. Soc. Simul. Xin Sun, Xishun Zhao, Livio Robaldo
2017	J	`jnl`	Realizing correlated equilibrium by secure computation. J. Inf. Secur. Appl. Lirong Qiu, Xin Sun, Xishun Zhao
2016	J	`jnl`	Reasoning about actions with loops via Hoare logic. Frontiers Comput. Sci. Jiankun He, Xishun Zhao
2016	J	`jnl`	Unsatisfiable hitting clause-sets with three more clauses than variables. CoRR Oliver Kullmann, Xishun Zhao
2015	J	`jnl`	Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses. CoRR Oliver Kullmann, Xishun Zhao
2014	J	`jnl`	Bounds for variables with few occurrences in conjunctive normal forms. CoRR Oliver Kullmann, Xishun Zhao
2014	A*	`conf`	Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas. KR Yuping Shen, Xishun Zhao
2014	J	`jnl`	Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas. CoRR Yuping Shen, Xishun Zhao
2014	J	`jnl`	More on Descriptive Complexity of Second-Order HORN Logics. CoRR Shiguang Feng, Xishun Zhao
2014	J	`jnl`	Proof systems for planning under 0-approximation semantics. Sci. China Inf. Sci. Yuping Shen, Xishun Zhao
2014	—	`conf`	Reasoning about Actions with Loops. SETN Jiankun He, Yuping Shen, Xishun Zhao
2013	J	`jnl`	Complexity and expressive power of second-order extended Horn logic. Math. Log. Q. Shiguang Feng, Xishun Zhao
2013	J	`jnl`	On Davis-Putnam reductions for minimally unsatisfiable clause-sets. Theor. Comput. Sci. Oliver Kullmann, Xishun Zhao
2013	J	`jnl`	Proof Systems for Planning Under Cautious Semantics. Minds Mach. Yuping Shen, Xishun Zhao
2012	A	`conf`	On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets. SAT Oliver Kullmann, Xishun Zhao
2012	J	`jnl`	On Davis-Putnam reductions for minimally unsatisfiable clause-sets CoRR Oliver Kullmann, Xishun Zhao
2011	A	`conf`	On Variables with Few Occurrences in Conjunctive Normal Forms. SAT Oliver Kullmann, Xishun Zhao
2011	J	`jnl`	Proof System for Plan Verification under 0-Approximation Semantics CoRR Xishun Zhao, Yuping Shen
2011	A	`conf`	Transformations into Normal Forms for Quantified Circuits. SAT Hans Kleine Büning, Xishun Zhao, Uwe Bubeck
2010	C	`conf`	NP-Logic Systems and Model-Equivalence Reductions CCA Yuping Shen, Xishun Zhao
2010	J	`jnl`	On variables with few occurrences in conjunctive normal forms CoRR Oliver Kullmann, Xishun Zhao
2010	J	`jnl`	Resolution on Quantified Generalized Clause-sets.. J. Satisf. Boolean Model. Comput. Jiwei Jin, Xishun Zhao
2009	J	`jnl`	Linear CNF formulas and satisfiability. Discret. Appl. Math. Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao
2009	A	`conf`	Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. SAT Hans Kleine Büning, Xishun Zhao, Uwe Bubeck
2008	J	`jnl`	Computational complexity of quantified Boolean formulas with fixed maximal deficiency. Theor. Comput. Sci. Hans Kleine Büning, Xishun Zhao
2008	C	`conf`	Jordan Areas and Grids. CCA Norbert Th. Müller, Xishun Zhao
2008	A	`ed.`	Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings SAT Hans Kleine Büning, Xishun Zhao
2007	J	`jnl`	An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas. J. Satisf. Boolean Model. Comput. Hans Kleine Büning, Xishun Zhao
2007	J	`jnl`	Boolean Functions as Models for Quantified Boolean Formulas. J. Autom. Reason. Hans Kleine Büning, K. Subramani, Xishun Zhao
2007	C	`conf`	Complexity of Operators on Compact Sets. CCA Xishun Zhao, Norbert Th. Müller
2007	J	`jnl`	The Complexity of Some Subclasses of Minimal Unsatis able Formulas. J. Satisf. Boolean Model. Comput. Hans Kleine Büning, Xishun Zhao
2006	A	`conf`	Minimal False Quantified Boolean Formulas. SAT Hans Kleine Büning, Xishun Zhao
2005	J	`jnl`	Extension and equivalence problems for clause minimal formulae. Ann. Math. Artif. Intell. Hans Kleine Büning, Xishun Zhao
2005	A	`conf`	Model-Equivalent Reductions. SAT Xishun Zhao, Hans Kleine Büning
2005	A	`conf`	Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. SAT Uwe Bubeck, Hans Kleine Büning, Xishun Zhao
2004	A	`conf`	Equivalence Models for Quantified Boolean Formulas. SAT Hans Kleine Büning, Xishun Zhao
2004	—	`conf`	Equivalence Models for Quantified Boolean Formulas. SAT (Selected Papers Hans Kleine Büning, Xishun Zhao
2004	—	`conf`	On Models for Quantified Boolean Formulas. Logic versus Approximation Hans Kleine Büning, Xishun Zhao
2004	A*	`conf`	On Odd and Even Cycles in Normal Logic Programs. AAAI Fangzhen Lin, Xishun Zhao
2004	J	`jnl`	Regular Disjunction-Free Default Theories. J. Comput. Sci. Technol. Xishun Zhao
2003	J	`jnl`	Complexity of argument-based default reasoning with specificity. AI Commun. Xishun Zhao
2003	J	`jnl`	Fixed-Parameter Tractability of Disjunction-Free Default Reasoning. J. Comput. Sci. Technol. Xishun Zhao, Decheng Ding
2003	A	`conf`	On Boolean Models for Quantified Boolean Horn Formulas. SAT Hans Kleine Büning, K. Subramani, Xishun Zhao
2003	J	`jnl`	On the structure of some classes of minimal unsatisfiable formulas. Discret. Appl. Math. Hans Kleine Büning, Xishun Zhao
2003	A	`conf`	Read-Once Unit Resolution. SAT Hans Kleine Büning, Xishun Zhao
2002	J	`jnl`	Complexity of the Unique Extension Problem in Default Logic. Fundam. Informaticae Xishun Zhao, Paolo Liberatore
2002	J	`jnl`	Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. Inf. Process. Lett. Hans Kleine Büning, Xishun Zhao
2002	J	`jnl`	The Complexity of Read-Once Resolution. Ann. Math. Artif. Intell. Hans Kleine Büning, Xishun Zhao
2001	J	`jnl`	Complexity Results for 2CNF Default Theories. Fundam. Informaticae Xishun Zhao, Decheng Ding
2001	J	`jnl`	Satisfiable Formulas Closed Under Replacement. Electron. Notes Discret. Math. Hans Kleine Büning, Xishun Zhao
2001	J	`jnl`	Some Algorithms for Extension Computation of Nonmonotonic Rule Systems. Fundam. Informaticae Xishun Zhao, Decheng Ding
2000	J	`jnl`	Complexity Results for Restricted Credulous Default Reasoning. AI Commun. Xishun Zhao, Decheng Ding, Hans Kleine Büning