Unit contradiction versus unit propagation

Details Unit contradiction versus unit propagation Unit contradiction versus unit propagation

2012-04-03

arxiv.org/abs/1204.0731v1

Computer Science

Artificial Intelligence

Scientific paper

Some aspects of the result of applying unit resolution on a CNF formula can be formalized as functions with domain a set of partial truth assignments. We are interested in two ways for computing such functions, depending on whether the result is the production of the empty clause or the assignment of a variable with a given truth value. We show that these two models can compute the same functions with formulae of polynomially related sizes, and we explain how this result is related to the CNF encoding of Boolean constraints.

Affiliated with

Also associated with

No associations

Rating

Unit contradiction versus unit propagation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Unit contradiction versus unit propagation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unit contradiction versus unit propagation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-355445