BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
2 × Canada
2 × Italy
2 × United Kingdom
4 × USA
Collaborated with:
H.K.Büning O.Kullmann U.Bubeck Y.Shen K.Subramani
Talks about:
formula (9) quantifi (8) boolean (6) equival (5) model (5) minim (3) resolut (2) circuit (2) reduct (2) normal (2)

Person: Xishun Zhao

DBLP DBLP: Zhao:Xishun

Facilitated 1 volumes:

SAT 2008Ed

Contributed to:

KR 20142014
SAT 20122012
SAT 20112011
SAT 20092009
SAT 20062006
SAT 20052005
SAT 20042004
SAT 20042005
SAT 20032003
SAT 20022002
SAT 20012001

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.
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.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.