# Xishun Zhao

According to our database

^{1}, Xishun Zhao## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Norm-based deontic logic for access control, some computational results.

Future Generation Comp. Syst., 2018

2017

Ali Baba and the Thief, Convention Emergence in Games.

J. Artificial Societies and Social Simulation, 2017

Realizing correlated equilibrium by secure computation.

J. Inf. Sec. Appl., 2017

2016

Reasoning about actions with loops via Hoare logic.

Frontiers Comput. Sci., 2016

Unsatisfiable hitting clause-sets with three more clauses than variables.

CoRR, 2016

2015

Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses.

CoRR, 2015

2014

Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas.

CoRR, 2014

Bounds for variables with few occurrences in conjunctive normal forms.

CoRR, 2014

More on Descriptive Complexity of Second-Order HORN Logics.

CoRR, 2014

Proof systems for planning under 0-approximation semantics.

SCIENCE CHINA Information Sciences, 2014

Reasoning about Actions with Loops.

Proceedings of the Artificial Intelligence: Methods and Applications, 2014

Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas.

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

2013

On Davis-Putnam reductions for minimally unsatisfiable clause-sets.

Theor. Comput. Sci., 2013

Complexity and expressive power of second-order extended Horn logic.

Math. Log. Q., 2013

Proof Systems for Planning Under Cautious Semantics.

Minds and Machines, 2013

2012

On Davis-Putnam reductions for minimally unsatisfiable clause-sets

CoRR, 2012

On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets.

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

2011

Proof System for Plan Verification under 0-Approximation Semantics

CoRR, 2011

On Variables with Few Occurrences in Conjunctive Normal Forms.

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Transformations into Normal Forms for Quantified Circuits.

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

2010

Resolution on Quantified Generalized Clause-sets..

JSAT, 2010

On variables with few occurrences in conjunctive normal forms

CoRR, 2010

NP-Logic Systems and Model-Equivalence Reductions

Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

2009

Linear CNF formulas and satisfiability.

Discrete Applied Mathematics, 2009

Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits.

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

Computational complexity of quantified Boolean formulas with fixed maximal deficiency.

Theor. Comput. Sci., 2008

Complexity of Operators on Compact Sets.

Electr. Notes Theor. Comput. Sci., 2008

Jordan Areas and Grids.

Electr. Notes Theor. Comput. Sci., 2008

2007

An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas.

JSAT, 2007

The Complexity of Some Subclasses of Minimal Unsatis able Formulas.

JSAT, 2007

Boolean Functions as Models for Quantified Boolean Formulas.

J. Autom. Reasoning, 2007

2006

Minimal False Quantified Boolean Formulas.

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

2005

Extension and equivalence problems for clause minimal formulae.

Ann. Math. Artif. Intell., 2005

Model-Equivalent Reductions.

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas.

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

2004

Regular Disjunction-Free Default Theories.

J. Comput. Sci. Technol., 2004

Equivalence Models for Quantified Boolean Formulas.

Proceedings of the Theory and Applications of Satisfiability Testing, 2004

Equivalence Models for Quantified Boolean Formulas.

Proceedings of the SAT 2004, 2004

On Models for Quantified Boolean Formulas.

Proceedings of the Logic versus Approximation, 2004

On Odd and Even Cycles in Normal Logic Programs.

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003

Fixed-Parameter Tractability of Disjunction-Free Default Reasoning.

J. Comput. Sci. Technol., 2003

On the structure of some classes of minimal unsatisfiable formulas.

Discrete Applied Mathematics, 2003

Complexity of argument-based default reasoning with specificity.

AI Commun., 2003

Read-Once Unit Resolution.

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

On Boolean Models for Quantified Boolean Horn Formulas.

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002

Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.

Inf. Process. Lett., 2002

Complexity of the Unique Extension Problem in Default Logic.

Fundam. Inform., 2002

The Complexity of Read-Once Resolution.

Ann. Math. Artif. Intell., 2002

2001

Complexity Results for 2CNF Default Theories.

Fundam. Inform., 2001

Some Algorithms for Extension Computation of Nonmonotonic Rule Systems.

Fundam. Inform., 2001

Satisfiable Formulas Closed Under Replacement.

Electronic Notes in Discrete Mathematics, 2001

2000

Complexity Results for Restricted Credulous Default Reasoning.

AI Commun., 2000