Reified unit resolution and the failed literal rule

11/12/2010
by   Olivier Bailleux, et al.
0

Unit resolution can simplify a CNF formula or detect an inconsistency by repeatedly assign the variables occurring in unit clauses. Given any CNF formula sigma, we show that there exists a satisfiable CNF formula psi with size polynomially related to the size of sigma such that applying unit resolution to psi simulates all the effects of applying it to sigma. The formula psi is said to be the reified counterpart of sigma. This approach can be used to prove that the failed literal rule, which is an inference rule used by some SAT solvers, can be entirely simulated by unit resolution. More generally, it sheds new light on the expressive power of unit resolution.

READ FULL TEXT

page 1

page 2

page 3

research
01/16/2014

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution

We offer a new understanding of some aspects of practical SAT-solvers th...
research
09/06/2011

Lifted Unit Propagation for Effective Grounding

A grounding of a formula ϕ over a given finite domain is a ground formul...
research
04/03/2012

Unit contradiction versus unit propagation

Some aspects of the result of applying unit resolution on a CNF formula ...
research
06/17/2011

On the expressive power of unit resolution

This preliminary report addresses the expressive power of unit resolutio...
research
03/31/2009

Learning for Dynamic subsumption

In this paper a new dynamic subsumption technique for Boolean CNF formul...
research
05/13/2021

A Fast Algorithm for SAT in Terms of Formula Length

In this paper, we prove that the general CNF satisfiability problem can ...
research
09/03/2023

An analysis of Ermakov-Zolotukhin quadrature using kernels

We study a quadrature, proposed by Ermakov and Zolotukhin in the sixties...

Please sign up or login with your details

Forgot password? Click here to reset