Computer Science – Artificial Intelligence
Scientific paper
2011-06-17
Computer Science
Artificial Intelligence
Scientific paper
This preliminary report addresses the expressive power of unit resolution regarding input data encoded with partial truth assignments of propositional variables. A characterization of the functions that are computable in this way, which we propose to call propagatable functions, is given. By establishing that propagatable functions can also be computed using monotone circuits, we show that there exist polynomial time complexity propagable functions requiring an exponential amount of clauses to be computed using unit resolution. These results shed new light on studying CNF encodings of NP-complete problems in order to solve them using propositional satisfiability algorithms.
No associations
LandOfFree
On the expressive power of unit resolution 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 On the expressive power of unit resolution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the expressive power of unit resolution will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-696176