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 × Czech Republic
1 × Finland
1 × Italy
1 × Portugal
2 × Canada
3 × Germany
3 × United Kingdom
4 × USA
Collaborated with:
X.Zhao U.Bubeck M.Karpinski D.Xu T.Lettmann K.Subramani A.Flögel U.Löwen S.Schmitgen P.H.Schmitt
Talks about:
quantifi (13) formula (13) boolean (9) model (7) equival (5) horn (5) minim (4) resolut (3) complex (3) subclass (2)

Person: Hans Kleine Büning

DBLP DBLP: B=uuml=ning:Hans_Kleine

Facilitated 7 volumes:

SAT 2008Ed
CSL 1992Ed
CSL 1991Ed
CSL 1990Ed
CSL 1989Ed
CSL 1988Ed
CSL 1987Ed

Contributed to:

SAT 20132013
SAT 20112011
SAT 20102010
SAT 20092009
SAT 20072007
SAT 20062006
SAT 20052005
SAT 20042004
SAT 20042005
SAT 20032003
SAT 20022002
SAT 20012001
CSL 19981998
CSL 19901990
CSL 19881988
CSL 19871987
CADE 19861986

Wrote 21 papers:

SAT-2013-BubeckB #modelling #quantifier
Nested Boolean Functions as Models for Quantified Boolean Formulas (UB, HKB), pp. 267–275.
SAT-2011-BuningZB #normalisation #quantifier
Transformations into Normal Forms for Quantified Circuits (HKB, XZ, UB), pp. 245–258.
SAT-2010-BubeckB #quantifier
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN (UB, HKB), pp. 58–70.
SAT-2009-BuningZB #quantifier #subclass
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits (HKB, XZ, UB), pp. 391–397.
SAT-2007-BubeckB #bound #preprocessor
Bounded Universal Expansion for Preprocessing QBF (UB, HKB), pp. 244–257.
SAT-2006-BubeckB #complexity #dependence #modelling #quantifier
Dependency Quantified Horn Formulas: Models and Complexity (UB, HKB), pp. 198–211.
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-BueningX #complexity #morphism #satisfiability
The complexity of homomorphisms and renamings of minimal unsatisfiable formulas (HKB, DX), p. 9.
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.
CSL-1998-Buning #bound
An Upper Bound for Minimal Resolution Refutations (HKB), pp. 171–178.
CSL-1990-FlogelKB #quantifier #subclass
Subclasses of Quantified Boolean Formulas (AF, MK, HKB), pp. 145–155.
CSL-1988-BuningLS #detection #prolog #source code
Loop Detection in Propositional Prolog Programs (HKB, UL, SS), pp. 148–165.
CSL-1987-KarpinskiBS #complexity #horn clause #on the #quantifier
On the Computational Complexity of Quantified Horn Clauses (MK, HKB, PHS), pp. 129–137.
CADE-1986-BuningL #first-order #satisfiability
Classes of First Order Formulas Under Various Satisfiability Definitions (HKB, TL), pp. 553–563.

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.