John S. Schlipf

2.8k total citations · 1 hit paper
29 papers, 1.3k citations indexed

About

John S. Schlipf is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, John S. Schlipf has authored 29 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 16 papers in Artificial Intelligence and 6 papers in Geometry and Topology. Recurrent topics in John S. Schlipf's work include Logic, Reasoning, and Knowledge (15 papers), Advanced Algebra and Logic (11 papers) and Logic, programming, and type systems (9 papers). John S. Schlipf is often cited by papers focused on Logic, Reasoning, and Knowledge (15 papers), Advanced Algebra and Logic (11 papers) and Logic, programming, and type systems (9 papers). John S. Schlipf collaborates with scholars based in United States and Germany. John S. Schlipf's co-authors include Allen Van Gelder, Kenneth A. Ross, Jon Barwise, John Franco, Ram Swaminathan, Fred S. Annexstein, Victor W. Marek, Howard A. Blair, Gerhard Brewka and Chitta Baral and has published in prestigious journals such as Journal of the ACM, Proceedings of the American Mathematical Society and Lecture notes in computer science.

In The Last Decade

John S. Schlipf

26 papers receiving 1.1k citations

Hit Papers

align trajectories

What are hit papers?

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

1991 770 citations Allen Van Gelder, Kenneth A. Ross et al. profile →

Peers

Countries citing papers authored by John S. Schlipf

Since Specialization

Citations

This map shows the geographic impact of John S. Schlipf'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 John S. Schlipf with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John S. Schlipf more than expected).

Fields of papers citing papers by John S. Schlipf

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by John S. Schlipf. 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 John S. Schlipf. The network helps show where John S. Schlipf may publish in the future.

Co-authorship network of co-authors of John S. Schlipf

This figure shows the co-authorship network connecting the top 25 collaborators of John S. Schlipf. A scholar is included among the top collaborators of John S. Schlipf 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 John S. Schlipf. John S. Schlipf is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Function-Complete Lookahead in Support of Efficient SAT Search Heuristics 2020 ·Zenodo (CERN European Organization for Nuclear Research) ·John Franco, John S. Schlipf, (unknown), Michal Kouril, Sean Weaver, (unknown)	0
2	Formal modeling of a system of chemical reactions under uncertainty 2014 ·Journal of Bioinformatics and Computational Biology ·(unknown), John S. Schlipf	4
3	Extending Existential Quantification in Conjunctions of BDDs 2006 ·Sean Weaver, John Franco, John S. Schlipf	5
4	An algorithm for the class of pure implicational formulas 1999 ·Discrete Applied Mathematics ·John Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ram Swaminathan	11
5	Unique satisfiability of Horn sets can be solved in nearly linear time 1995 ·Discrete Applied Mathematics ·Kenneth A. Berman, John Franco, John S. Schlipf	1
6	Complexity and undecidability results for logic programming 1995 ·Annals of Mathematics and Artificial Intelligence ·John S. Schlipf	24
7	The expressiveness of locally stratified programs 1995 ·Annals of Mathematics and Artificial Intelligence ·Howard A. Blair, Victor W. Marek, John S. Schlipf	15
8	A Survey of Complexity and Undecidability Results in Logic Programming. 1992 ·John S. Schlipf	15
9	Formalizing a logic for logic programming 1992 ·Annals of Mathematics and Artificial Intelligence ·John S. Schlipf	28
10	The expressive powers of the logic programming semantics (extended abstract) 1990 ·John S. Schlipf	19
11	When is Closed World Reasoning Tractable 1988 ·John S. Schlipf	8
12	Unfounded sets and well-founded semantics for general logic programs 1988 ·Allen Van Gelder, Kenneth A. Ross, John S. Schlipf	200
13	Decidability and definability with circumscription 1987 ·Annals of Pure and Applied Logic ·John S. Schlipf	23
14	Generating subsets of order statistics with applications to trimmed means and means of trimmings 1986 ·Journal of Statistical Computation and Simulation ·Paul S. Horn, John S. Schlipf	3
15	How Uncomputable is General Circumscription? (Extended Abstract) 1986 ·John S. Schlipf	2
16	Who's being swindled?: a case for enlightened naivete 1986 ·Journal of Statistical Computation and Simulation ·Paul S. Horn, John S. Schlipf	0
17	Recursively saturated models of set theory 1980 ·Proceedings of the American Mathematical Society ·John S. Schlipf	2
18	Recursively Saturated Models of Set Theory 1980 ·Proceedings of the American Mathematical Society ·John S. Schlipf	1
19	A guide to the identification of admissible sets above structures 1977 ·Annals of Mathematical Logic ·John S. Schlipf	13
20	An introduction to recursively saturated and resplendent models 1976 ·Journal of Symbolic Logic ·Jon Barwise, John S. Schlipf	39

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.

Explore authors with similar magnitude of impact