Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
The well-founded semantics for general logic programs
Countries citing papers authored by Allen Van Gelder
Since
Specialization
Citations
This map shows the geographic impact of Allen Van Gelder's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Allen Van Gelder with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Allen Van Gelder more than expected).
Fields of papers citing papers by Allen Van Gelder
This network shows the impact of papers produced by Allen Van Gelder. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Allen Van Gelder. The network helps show where Allen Van Gelder may publish in the future.
Co-authorship network of co-authors of Allen Van Gelder
This figure shows the co-authorship network connecting the top 25 collaborators of Allen Van Gelder.
A scholar is included among the top collaborators of Allen Van Gelder based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Allen Van Gelder. Allen Van Gelder is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Gelder, Allen Van. (2008). Verifying RUP Proofs of Propositional Unsatisfiability..13 indexed citations
5.
Bacchus, Fahiem, et al.. (2008). Clause learning can effectively P-simulate general propositional resolution. National Conference on Artificial Intelligence. 283–290.20 indexed citations
Gelder, Allen Van. (2006). Preliminary report on input cover number as a metric for propositional resolution proofs.
8.
Gelder, Allen Van. (2002). Generalizations of Watched Literals for Backtracking Search.. Annals of Mathematics and Artificial Intelligence. 14(3). 1–12.12 indexed citations
9.
Gelder, Allen Van. (2002). Extracting (Easily) Checkable Proofs from a Satisfiability Solver that Employs both Preorder and Postorder Resolution.. Annals of Mathematics and Artificial Intelligence.21 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.