Person: Xishun Zhao

DBLP: Zhao:Xishun

Facilitated 1 volumes:

Ed

Contributed to:

2014

2012

2011

2009

2006

2005

2004

2005

2003

2002

2001

Wrote 14 papers:

KR-2014-ShenZ #canonical #logic programming #source code

Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas (YS, XZ).

SAT-2012-KullmannZ #on the #reduction #satisfiability

On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets (OK, XZ), pp. 270–283.

SAT-2011-BuningZB #normalisation #quantifier

Transformations into Normal Forms for Quantified Circuits (HKB, XZ, UB), pp. 245–258.

SAT-2011-KullmannZ #normalisation #on the

On Variables with Few Occurrences in Conjunctive Normal Forms (OK, XZ), pp. 33–46.

SAT-2009-BuningZB #quantifier #subclass

Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits (HKB, XZ, UB), pp. 391–397.

SAT-2006-BuningZ #quantifier

Minimal False Quantified Boolean Formulas (HKB, XZ), pp. 339–352.

SAT-2005-BubeckBZ #equivalence #modelling #quantifier

Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas (UB, HKB, XZ), pp. 386–392.

SAT-2005-ZhaoB #reduction

Model-Equivalent Reductions (XZ, HKB), pp. 355–370.

SAT-2004-BuningZ #equivalence #modelling #quantifier

Equivalence Models for Quantified Boolean Formulas (HKB, XZ), pp. 230–237.

SAT-J-2004-BuningZ05 #equivalence #modelling #quantifier

Equivalence Models for Quantified Boolean Formulas (HKB, XZ), pp. 224–234.

SAT-2003-BuningSZ #modelling #on the #quantifier

On Boolean Models for Quantified Boolean Horn Formulas (HKB, KS, XZ), pp. 93–104.

SAT-2003-BuningZ

Read-Once Unit Resolution (HKB, XZ), pp. 356–369.

SAT-2002-ZhaoB #equivalence #problem

Extension and equivalence problems for clause minimal formulas (XZ, HKB), p. 43.

SAT-2001-BuningZ #satisfiability

Satisfiable Formulas Closed Under Replacement (HKB, XZ), pp. 48–58.