NP-Completeness of Refutability by Literal-Once Resolution

Stefan Szeider
January 2001
bib

Abstract

Full Citation:

Stefan Szeider. NP-Completeness of Refutability by Literal-Once Resolution. IJCAR 2001, Proceedings of the International Joint Conference on Automated Reasoning (R. Gor'e and A. Leitsch and T. Nipkow), volume 2083 of Lecture Notes in Artificial Intelligence, pages 168-181, 2001, Springer Verlag.

Type
Conference Paper
Stefan Szeider
Stefan Szeider
Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.