Get started
Author

John Stewart Schlipf

The well-founded semantics for general logic programs
1991 · Allen Van Gelder, Kenneth A. Ross, et al. · Journal of the ACM · 1,650
Unfounded sets and well-founded semantics for general logic programs
1988 · Allen Van Gelder, Kenneth Ross, et al. · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · 380
PDF
The Expressive Powers of the Logic Programming Semantics
1995 · J.S. Schlipf · Journal of Computer and System Sciences · 132
An introduction to recursively saturated and resplendent models
1976 · Jon Barwise, John Schlipf · Journal of Symbolic Logic · 110
On finding solutions for extended Horn formulas
1995 · John S. Schlipf, Fred S. Annexstein, et al. · Information Processing Letters · 63
Formalizing a logic for logic programming
1992 · John S. Schlipf · Annals of Mathematics and Artificial Intelligence · 54
Answer Set Programming with Clause Learning
2003 · Jeffrey Ward, John S. Schlipf · Lecture notes in computer science · 53
On recursively saturated models of arithmetic
1975 · Jon Barwise, John Schlipf · Lecture notes in mathematics · 53
Toward model theory through recursive saturation
1978 · John Stewart Schlipf · Journal of Symbolic Logic · 45
Complexity and undecidability results for logic programming
1995 · John S. Schlipf · Annals of Mathematics and Artificial Intelligence · 42
The expressive powers of the logic programming semantics (extended abstract)
1990 · John S. Schlipf · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · 42
PDF
Decidability and definability with circumscription
1987 · John S. Schlipf · Annals of Pure and Applied Logic · 36
PDF
The expressiveness of locally stratified programs
1995 · Howard A. Blair, V. Wiktor Marek, et al. · Annals of Mathematics and Artificial Intelligence · 29
SBSAT: a State-Based, BDD-Based Satisfiability Solver
2004 · John Franco, Michal Kouril, et al. · Lecture notes in computer science · 27
Computing the well-founded semantics faster
1995 · Kenneth A. Berman, John S. Schlipf, et al. · Lecture notes in computer science · 26
A Survey of Complexity and Undecidability Results in Logic Programming.
1992 · John S. Schlipf · 24
Logic Programming and Nonmonotonic Reasoning: 9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007. Proceedings
2007 · Chitta Baral, Gerhard Brewka, et al. · Lecture notes in computer science · 23
A guide to the identification of admissible sets above structures
1977 · John S. Schlipf · Annals of Mathematical Logic · 20
PDF
Extending Existential Quantification in Conjunctions of BDDs
2006 · Sean Weaver, John Franco, et al. · Journal on Satisfiability Boolean Modeling and Computation · 15
PDF
An algorithm for the class of pure implicational formulas
1999 · John Franco, Judy Goldsmith, et al. · Discrete Applied Mathematics · 15
Formal modeling of a system of chemical reactions under uncertainty
2014 · Krishnendu Ghosh, John Schlipf · Journal of Bioinformatics and Computational Biology · 9
Commonsense axiomatizations for logic programs
1993 · Allen Van Gelder, John S. Schlipf · The Journal of Logic Programming · 9
When is Closed World Reasoning Tractable
1988 · John S. Schlipf · International Syposium on Methodologies for Intelligent Systems · 8
Function-Complete Lookahead in Support of Efficient SAT Search Heuristics
2004 · John Franco, John Schlipf, et al. · 7
Generating subsets of order statistics with applications to trimmed means and means of trimmings
1986 · Paul S. Horn, John S. Schlipf · Journal of Statistical Computation and Simulation · 7
Works count: 45
Citation count: 2,904
H-index: 18
I10-index: 20
Year
Topic
Type