Publication not explained
This publication has not yet been explained in plain language by the author(s). However, you can still read the publication.
If you are one of the authors, claim this publication so you can create a plain language summary to help more people find, understand and use it.
Featured Image
Read the Original
This page is a summary of: Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning, Logical Methods in Computer Science, December 2008, Logical Methods in Computer Science,
DOI: 10.2168/lmcs-4(4:13)2008.
You can read the full text:
Contributors
The following have contributed to this page
