The width of a Resolution proof is defined to be the max. imal number of liter& in any clause
of the proof. In this paper we relate proof width to proof length (&size), in both general …

Bayesian inference is an important problem with numerous applications in probabilistic
reasoning. Counting satisfying assignments is a closely related problem of fundamental …

We present the best known separation between tree-like and general resolution, improving
on the recent exp (n∈) separation of [2]. This is done by constructing a natural family of …

This article introduces and studies a proof system∀ Exp+ Res that enables us to refute
quantified Boolean formulas (QBFs). The system∀ Exp+ Res operates in two stages: it …

Abstract Inference in Bayes Nets (BAYES) is an important problem with numerous
applications in probabilistic reasoning. Counting the number of satisfying assignments of a …

An exponential lower bound for the size of tree-like cutting planes refutations of a certain
family of conjunctive normal form (CNF) formulas with polynomial size resolution refutations …

Backtracking search is a powerful algorithmic paradigm that can be used to solve many
problems. It is in a certain sense the dual of variable elimination; but on many problems, eg …

Propositional satisfiability (SAT) solvers are deemed to be among the most efficient
reasoners, which have been successfully used in a wide range of practical applications. As …

We investigate a hierarchy Gk (U; S) of classes of conjunctive normal forms, recognizable
and SAT-decidable in polynomial time, with special emphasize on the corresponding …

In the article, within the framework of the Boolean Satisfiability problem (SAT), the problem of
estimating the hardness of specific Boolean formulas wrt a specific complete SAT solving …