Skip to main content
Journal ArticleOPEN ACCESS

Finding a tree structure in a resolution proof is NP-complete

Theoretical Computer Science (2009) 410(21-23) 2295-2300
DOI: 10.1016/j.tcs.2009.02.018
2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The resolution tree problem consists of deciding whether a given sequence-like resolution refutation admits a tree structure. This paper shows the NP-completeness of both the resolution tree problem and a natural generalization of the resolution tree problem that does not involve resolution. © 2009 Elsevier B.V. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Hoffmann, J. (2009). Finding a tree structure in a resolution proof is NP-complete. Theoretical Computer Science, 410(21–23), 2295–2300. https://doi.org/10.1016/j.tcs.2009.02.018

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free