We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
Chris Calabro, Russell Impagliazzo, Ramamohan Patu...
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
Most current propositional SAT solvers apply resolution at various stages to derive new clauses or simplify existing ones. The former happens during conflict analysis, while the l...
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...