
Proof Complexity of Symbolic QBF Reasoning
We introduce and investigate symbolic proof systems for Quantified Boole...
read it

Characterizing Tseitinformulas with short regular resolution refutations
Tseitinformulas are systems of parity constraints whose structure is de...
read it

On Irrelevant Literals in PseudoBoolean Constraint Learning
Learning pseudoBoolean (PB) constraints in PB solvers exploiting cuttin...
read it

Lower Bounds for Approximate Knowledge Compilation
Knowledge compilation studies the tradeoff between succinctness and eff...
read it

Revisiting Graph Width Measures for CNFEncodings
We consider bounded width CNFformulas where the width is measured by po...
read it

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates
We give an algorithm to enumerate the results on trees of monadic second...
read it

ConstantDelay Enumeration for Nondeterministic Document Spanners
We consider the information extraction approach known as document spanne...
read it

Knowledge Compilation, Width and Quantification
We generalize many results concerning the tractability of SAT and #SAT o...
read it

QBF as an Alternative to Courcelle's Theorem
We propose reductions to quantified Boolean formulas (QBF) as a new appr...
read it

On tractable query evaluation for SPARQL
Despite much work within the last decade on foundational properties of S...
read it

Enumeration on Trees under Relabelings
We study how to evaluate MSO queries with free variables on trees, withi...
read it

Understanding model counting for βacyclic CNFformulas
We extend the knowledge about socalled structural restrictions of #SAT ...
read it

Hypergraph Acyclicity and Propositional Model Counting
We show that the propositional model counting problem #SAT for CNF form...
read it
Stefan Mengel
is this you? claim profile