#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2005

2015

- This year (0)
- Last five years (2)

#### Publication Type

#### Co-author

#### Publication Venue

#### 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 unit… (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,. We also consider more general… (More)

- Uwe Bubeck, Hans Kleine Büning
- Discrete Applied Mathematics
- 2008

In this paper, quantified Horn formulas (QHORN) are investigated. We prove that the behavior of the existential quantifiers depends only on the cases where at most one of the universally quantified variables is zero. Accordingly, we give a detailed characterization of QHORN satisfiability models which describe the set of satisfying truth assignments to the… (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 quan-tifiers. 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 of… (More)

- Uwe Bubeck, Hans Kleine Büning
- Inf. Process. Lett.
- 2009

For propositional formulas we present a new transformation into satisfiability equivalent 3-CNF formulas of linear length. The main idea is to represent formulas as parallel-serial graphs. This is a subclass of directed acyclic multigraphs where the edges are labeled with literals and the AND operation (respectively, the OR operation) is expressed as… (More)

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

In this paper, we consider the problem of compactly representing nested instantia-tions 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)