Answer Set Programming (ASP) is a declarative problem solving approach, initially tailored
to modeling problems in the area of Knowledge Representation and Reasoning (KRR) …

Symmetry and dominance breaking can be crucial for solving hard combinatorial search and
optimisation problems, but the correctness of these techniques sometimes relies on subtle …

We consider the range avoidance problem (called Avoid): given the description of a circuit
with more output gates than input gates, find a string that is not in the range of the circuit …

Over the last decade, indistinguishability obfuscation (iO) has emerged as a seemingly
omnipotent primitive with numerous applications to cryptography and beyond. Moreover …

Although propositional model counting (# SAT) was long considered too hard to be practical,
today's highly efficient solvers facilitate applications in probabilistic reasoning, reliability …

Query-to-communication lifting theorems, which connect the query complexity of a Boolean
function to the communication complexity of an associatedlifted'function obtained by …

We establish new, and surprisingly tight, connections between propositional proof
complexity and finite model theory. Specifically, we show that the power of several …

We study Frege proofs using depth-d Boolean formulas for the Tseitin contradiction on n*n
grids. We prove that if each line in the proof is of size M then the number of lines is …

In this paper we present a proof system that operates on graphs instead of formulas. Starting
from the well-known relationship between formulas and cographs, we drop the cograph …

Combinatorial proofs form a syntax-independent presentation of proofs, originally proposed
by Hughes for classical propositional logic. In this paper we present a notion of …