Keyword

resolution proofs

Description: Formal derivations in propositional logic that repeatedly apply the resolution rule to establish that a set of clauses is unsatisfiable.
OpenAlex ID: keywords/resolution-proofs
1997 · Pavel Pudlák · Journal of Symbolic Logic · 516
1988 · Vašek Chvátal, Endre Szemerédi · Journal of the ACM · 494
2013 · Marijn J. H. Heule, Warren A. Hunt, et al. · Formal Methods in Computer-Aided Design · 177
1981 · David A. Plaisted · Artificial Intelligence · 156
2002 · Ran Raz · IEEE Conference on Computational Complexity (CCC) · 116
2002 · Paul Beame, Richard Karp, et al. · SIAM Journal on Computing · 109
2007 · Lawrence C. Paulson, Kong Woei Susanto · Lecture notes in computer science · 101
2008 · Eli Ben-Sasson, Jakob Nordström · Annual Symposium on Foundations of Computer Science · 94
1998 · Sam Buss, Toniann Pitassi · Lecture notes in computer science · 80
2012 · Aina Niemetz, Mathias Preiner, et al. · Lecture notes in computer science · 76
2006 · Joshua Buresh-Oppenheim, Nicola Galesi, et al. · Theory of Computing · 76
2009 · Jakob Nordström · SIAM Journal on Computing · 75
1995 · László Lovász, Moni Naor, et al. · SIAM Journal on Discrete Mathematics · 73
2001 · Dimitris Achlioptas, Paul Beame, et al. · ACM Symposium on Theory of Computing (STOC) · 70
1994 · DAVID J. PYM, JAMES A. HARLAND · Journal of Logic and Computation · 67
1996 · Gunnar Stålmarck · Acta Informatica · 61
2011 · Alasdair Urquhart · Studia Logica · 59
1984 · David A. Plaisted · Journal of Computer and System Sciences · 57
2010 · Ben-Sasson, Eli, Nordström, Jakob · arXiv (Cornell University) · 54
2007 · Tjark Weber, Hasan Amjad · Journal of Applied Logic · 53
2009 · Eli Ben-Sasson · SIAM Journal on Computing · 52
2003 · E. Ben-Sasson, R. Impagliazzo · Annual Symposium on Foundations of Computer Science · 52
2005 · Matthias Baaz, Alexander Leitsch · Journal of Symbolic Computation · 50
2000 · G. Amati · The Computer Journal · 49
2012 · Paul Beame, Christopher Beck, et al. · ACM Symposium on Theory of Computing (STOC) · 46
Works count: 199
Citation count: 4,429
Year
Topic
Type