Resolution Theorem Proving is a formal deductive method in automated theorem proving that belongs to the class of refutation-based proof procedures and is distinguished by its use of the resolution rule to derive contradictions from clausal logic representations.
126
Publications
9.2K
Citations
186
Authors
117
Institutions
Publications per year
2017–2026
8
Variants
Resolution-based Theorem Proving
Parents
Publications
126
Many hard examples for resolution
Vašek Chvátal, Endre Szemerédi · Journal of the ACM · 1988 · 445 citations · Full text
Simplified and improved resolution lower bounds
Paul Beame, Toniann Pitassi · 2002 · 197 citations
1–5 of 126
Authors
186
- HG
4
h-index
- SR
3
h-index
- DL
3
h-index
- LB
3
h-index
- JR
3
h-index
1–5 of 186
Institutions
117
Max Planck Institute for Informatics
Saarbrücken, Germany
8 h-index
10 publications
248 citations
TU Wien
Vienna, Austria
5 h-index
8 publications
277 citations
National Institutes of Health
Bethesda, United States
5 h-index
6 publications
421 citations
SRI International
Menlo Park, United States
5 h-index
6 publications
8.3K citations
University of Amsterdam
Amsterdam, The Netherlands
4 h-index
6 publications
117 citations
Stanford University
Stanford, United States
4 h-index
6 publications
334 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
4 publications
175 citations
Max Planck Society
Munich, Germany
4 h-index
6 publications
109 citations
1–8 of 117
Venues
- Journal of the ACM
JACM · 13 publications · 1.4K citations
12
h-index
- National Conference on Artificial Intelligence
Conference · 4 publications · 97 citations
4
h-index
- Annals of Pure and Applied Logic
4 publications · 136 citations
4
h-index
- AI Communications
AICOM · 4 publications · 85 citations
4
h-index
- Information Sciences
3 publications · 48 citations
3
h-index
1–5