#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2005

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hans Kleine Büning, Uwe Bubeck
- Handbook of Satisfiability
- 2009

- Uwe Bubeck, Hans Kleine Büning
- SAT
- 2007

We present a new approach for preprocessing Quantified Boolean Formulas (QBF ) in conjunctive normal form (CNF ) by expanding a selection of universally quantified variables with bounded expansion costs. We describe a suitable selection strategy which exploits locality of universals and combines cost estimates with goal orientation by taking into account… (More)

- Uwe Bubeck, Hans Kleine Büning
- JSAT
- 2012

In this paper, we consider the problem of compactly representing nested instantiations of propositional subformulas with different arguments as quantified Boolean formulas (QBF). We develop a generic QBF encoding pattern which combines and generalizes existing QBF encoding techniques for simpler types of redundancy. We obtain an equivalence-preserving… (More)

- Uwe Bubeck, Hans Kleine Büning
- Journal of Automated Reasoning
- 2007

In this paper, we introduce the notion of models for quantified Boolean formulas. For various classes of quantified Boolean formulas and various classes of Boolean functions, we investigate the problem of determining whether a model exists. Furthermore, we show for these classes the complexity of the model checking problem, which is to check whether a given… (More)

This paper reports on recent research in the area of multibiometric authentication. After outlining the motivation behind this extension of conventional biometrics to incorporate multiple biometric identifiers, the main part of the paper gives a comparative overview of the different architectures of multibiometric systems. In the last part of the paper, I… (More)

Using auxiliary variables to introduce definitions is a popular and powerful technique in knowledge representation which can lead to shorter and more natural encodings without long repetitions. In this paper, we formally define the notion of auxiliary variables and then examine their expressive power and discuss interesting applications. We relate the idea… (More)

- Hans Kleine Büning, Xishun Zhao, Uwe Bubeck
- SAT
- 2011

We consider the extension of Boolean circuits to quantified Boolean circuits by adding universal and existential quantifier nodes with semantics adopted from quantified Boolean formulas (QBF). The concept allows not only prenex representations of the form ∀x1∃y1...∀xn∃yn c where c is an ordinary Boolean circuit with inputs x1, ..., xn, y1, ..., yn. We also… (More)

- Uwe Bubeck
- 2010

- Uwe Bubeck, Hans Kleine Büning
- SAT
- 2006

Dependency quantified Boolean formulas (DQBF ) extend quantified Boolean formulas with Henkin-style partially ordered quantifiers. It has been shown that this is likely to yield more succinct representations at the price of a computational blow-up from PSPACE to NEXPTIME. In this paper, we consider dependency quantified Horn formulas (DQHORN ), a subclass… (More)