Journal ArticleOPEN ACCESS

Pool resolution is NP-hard to recognize

Archive for Mathematical Logic (2009) 48(8) 793-798
DOI: 10.1007/s00153-009-0152-4
3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A pool resolution proof is a dag-like resolution proof which admits a depth-first traversal tree in which no variable is used as a resolution variable twice on any branch. The problem of determining whether a given dag-like resolution proof is a valid pool resolution proof is shown to be NP-complete. © The Author(s) 2009.

Author supplied keywords

Cite

CITATION STYLE

APA

Buss, S. R. (2009). Pool resolution is NP-hard to recognize. Archive for Mathematical Logic, 48(8), 793–798. https://doi.org/10.1007/s00153-009-0152-4

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