Intriactability of Read-Once Resolution

Using the Groebner basis algorithm to find proofs of unsatisfiability

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

The Complexity of Read-Once Resolution

Annals of Mathematics and Artificial Intelligence

On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas

ASIAN '02 Proceedings of the7th Asian Computing Science Conference on Advances in Computing Science: Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster

NP-Completeness of Refutability by Literal-Once Resolution

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning

Optimal length tree-like resolution refutations for 2SAT formulas

ACM Transactions on Computational Logic (TOCL)

Complexity results on DPLL and resolution

ACM Transactions on Computational Logic (TOCL)

Note: The NP-hardness of finding a directed acyclic graph for regular resolution

Theoretical Computer Science

Optimal Length Resolution Refutations of Difference Constraint Systems

Journal of Automated Reasoning

Performance test of local search algorithms using new types of random CNF formulas

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Read-once resolution for unsatisfiability-based Max-SAT algorithms

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One