An Introduction to Recursively Saturated and Resplendent Models. - Jon Barwise; John S. Schlipf (J. Symb. Log., 1976)

Ordinal Spectra of First-Order Theories. - John S. Schlipf (J. Symb. Log., 1977)

Toward Model Theory Through Recursive Saturation. - John S. Schlipf (J. Symb. Log., 1978)

How Uncomputable is General Circumscription? (Extended Abstract) - John S. Schlipf (LICS, 1986)

Decidability and definability with circumscription. - John S. Schlipf (Ann. Pure Appl. Log., 1987)

When is Closed World Reasoning Tractable? - John S. Schlipf (ISMIS, 1988)

Unfounded Sets and Well-Founded Semantics for General Logic Programs. - Allen Van Gelder; Kenneth A. Ross; John S. Schlipf (PODS, 1988)

Representing Epistemic Intervals in Logic Programs. - John S. Schlipf (LPNMR, 1991)

The Well-Founded Semantics for General Logic Programs. - Allen Van Gelder; Kenneth A. Ross; John S. Schlipf (J. ACM, 1991)

A Survey of Complexity and Undecidability Results in Logic Programming. - John S. Schlipf (Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992)

Formalizing a Logic for Logic Programming. - John S. Schlipf (Ann. Math. Artif. Intell., 1992)

Commonsense Axiomatizations for Logic Programs. - Allen Van Gelder; John S. Schlipf (J. Log. Program., 1993)

Computing Well-founded Semantics Faster. - Kenneth A. Berman; John S. Schlipf; John V. Franco (LPNMR, 1995)

The Expressiveness of Locally Stratified Programs. - Howard A. Blair; V. Wiktor Marek; John S. Schlipf (Ann. Math. Artif. Intell., 1995)

Complexity and Undecidability Results for Logic Programming. - John S. Schlipf (Ann. Math. Artif. Intell., 1995)

Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. - Kenneth A. Berman; John V. Franco; John S. Schlipf (Discret. Appl. Math., 1995)

On Finding Solutions for Extended Horn Formulas. - John S. Schlipf; Fred S. Annexstein; John V. Franco; Ramjee P. Swaminathan (Inf. Process. Lett., 1995)

The Expressive Powers of the Logic Programming Semantics. - John S. Schlipf (J. Comput. Syst. Sci., 1995)

Affordable Classes of Normal Logic Programs. - J. Seitzer; John S. Schlipf (LPNMR, 1997)

An Empirical Study of the 4-valued Kripke-Kleene and 4-valued Well-Founded Semantics in Random Propositional Logic Programs. - Chris Giannella; John S. Schlipf (Ann. Math. Artif. Intell., 1999)

An Algorithm for the Class of Pure Implicational Formulas. - John V. Franco; Judy Goldsmith; John S. Schlipf; Ewald Speckenmeyer; Ramjee P. Swaminathan (Discret. Appl. Math., 1999)

SBSAT: a State-Based, BDD-Based Satisfiability Solver. - John V. Franco; Michal Kouril; John S. Schlipf; Jeffrey Ward; Sean A. Weaver; Michael R. Dransfield; W. Mark Vanfleet (SAT, 2003)

Answer Set Programming with Clause Learning. - Jeffrey Ward; John S. Schlipf (LPNMR, 2004)

Function-Complete Lookahead in Support of Efficient SAT Search Heuristics. - John V. Franco; Michal Kouril; John S. Schlipf; Sean A. Weaver; Michael R. Dransfield; W. Mark Vanfleet (J. Univers. Comput. Sci., 2004)

Discrete mathematics for computer science. - Gary Haggard; John S. Schlipf; Sue Whitesides (Thomson Brooks/Cole, 2006)

Extending Existential Quantification in Conjunctions of BDDs. - Sean A. Weaver; John V. Franco; John S. Schlipf (J. Satisf. Boolean Model. Comput., 2006)

Complexity of First Order ID-Logic. - John S. Schlipf; Marc Denecker (ISAIM, 2008)

Formal modeling of a system of chemical reactions under uncertainty. - Krishnendu Ghosh; John S. Schlipf (J. Bioinform. Comput. Biol., 2014)