1. On the automatizability of resolution and related propositional proof systems;Atserias;Inf. Comput.,2004
2. An exponential separation between regular and general resolution;Alekhnovich;Theory Comput.,2007
3. Automating resolution is NP-hard;Atserias;J. ACM,2020
4. Automating regular or ordered resolution is NP-hard;Bell,2020
5. Resolution trees with lemmas: resolution refinements that characterize DLL algorithms with clause learning;Buss;Log. Methods Comput. Sci.,2008