Computer Science – Logic in Computer Science
Scientific paper
2008-11-07
LMCS 4 (4:13) 2008
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-4(4:13)2008
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there is no regularity condition. For regular proofs, an exponential separation between regular dag-like resolution and both regular WRTL and regular WRTI is given. It is proved that DLL proof search algorithms that use clause learning based on unit propagation can be polynomially simulated by regular WRTI. More generally, non-greedy DLL algorithms with learning by unit propagation are equivalent to regular WRTI. A general form of clause learning, called DLL-Learn, is defined that is equivalent to regular WRTL. A variable extension method is used to give simulations of resolution by regular WRTI, using a simplified form of proof trace extensions. DLL-Learn and non-greedy DLL algorithms with learning by unit propagation can use variable extensions to simulate general resolution without doing restarts. Finally, an exponential lower bound for WRTL where the lemmas are restricted to short clauses is shown.
Buss Samuel R.
Hoffmann Jan
Johannsen Jan
No associations
LandOfFree
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning 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 Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-228524