We study BDD-based bucket elimination, an approach to satisfiability tes...
When extracting a relation of spans (intervals) from a text document, a
...
It is shown that disjunction of two switch-lists can blow up the
represe...
We consider the task of lexicographic direct access to query answers. Th...
Bottom-up knowledge compilation is a paradigm for generating representat...
This note closes a minor gap in the literature on the counting complexit...
Arithmetic circuits (AC) are circuits over the real numbers with 0/1-val...
We introduce and investigate symbolic proof systems for Quantified Boole...
Tseitin-formulas are systems of parity constraints whose structure is
de...
Learning pseudo-Boolean (PB) constraints in PB solvers exploiting cuttin...
Knowledge compilation studies the trade-off between succinctness and
eff...
We consider bounded width CNF-formulas where the width is measured by po...
We give an algorithm to enumerate the results on trees of monadic
second...
We consider the information extraction approach known as document spanne...
We generalize many results concerning the tractability of SAT and #SAT o...
We propose reductions to quantified Boolean formulas (QBF) as a new appr...
Despite much work within the last decade on foundational properties of S...
We study how to evaluate MSO queries with free variables on trees, withi...
We extend the knowledge about so-called structural restrictions of
#SAT ...
We show that the propositional model counting problem #SAT for CNF- form...