(2008). Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"Resolution Trees with Lemmas: Resolution Refinements That Characterize DLL Algorithms with Clause Learning."
Logical Methods in Computer Science 2008.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"Resolution Trees with Lemmas: Resolution Refinements That Characterize DLL Algorithms with Clause Learning."
Logical Methods in Computer Science, 2008.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.