John S. Schlipf

Publication Activity (10 Years)

Years Active: 1976-2014
Publications (10 Years): 0

Top Topics

Incomplete Information

Chemical Reaction

Handling Uncertainty

Top Venues

J. Bioinform. Comput. Biol.

Publications

Krishnendu Ghosh, John S. Schlipf
Formal modeling of a system of chemical reactions under uncertainty. J. Bioinform. Comput. Biol. 12 (5) (2014)
John S. Schlipf, Marc Denecker
Complexity of First Order ID-Logic. ISAIM (2008)
Sean A. Weaver, John V. Franco, John S. Schlipf
Extending Existential Quantification in Conjunctions of BDDs. J. Satisf. Boolean Model. Comput. 1 (2) (2006)
Jeffrey Ward, John S. Schlipf
Answer Set Programming with Clause Learning. LPNMR (2004)
John V. Franco, Michal Kouril, John S. Schlipf, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet
Function-Complete Lookahead in Support of Efficient SAT Search Heuristics. J. Univers. Comput. Sci. 10 (12) (2004)
John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet
SBSAT: a State-Based, BDD-Based Satisfiability Solver. SAT (2003)
Chris Giannella, John S. Schlipf
An Empirical Study of the 4-valued Kripke-Kleene and 4-valued Well-Founded Semantics in Random Propositional Logic Programs. Ann. Math. Artif. Intell. 25 (3-4) (1999)
John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan
An Algorithm for the Class of Pure Implicational Formulas. Discret. Appl. Math. (1999)
J. Seitzer, John S. Schlipf
Affordable Classes of Normal Logic Programs. LPNMR (1997)
Kenneth A. Berman, John S. Schlipf, John V. Franco
Computing Well-founded Semantics Faster. LPNMR (1995)
John S. Schlipf
Complexity and Undecidability Results for Logic Programming. Ann. Math. Artif. Intell. 15 (3-4) (1995)
Howard A. Blair, V. Wiktor Marek, John S. Schlipf
The Expressiveness of Locally Stratified Programs. Ann. Math. Artif. Intell. 15 (2) (1995)
Kenneth A. Berman, John V. Franco, John S. Schlipf
Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. Discret. Appl. Math. 60 (1-3) (1995)
John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan
On Finding Solutions for Extended Horn Formulas. Inf. Process. Lett. 54 (3) (1995)
John S. Schlipf
The Expressive Powers of the Logic Programming Semantics. J. Comput. Syst. Sci. 51 (1) (1995)
Allen Van Gelder, John S. Schlipf
Commonsense Axiomatizations for Logic Programs. J. Log. Program. 17 (2/3&4) (1993)
John S. Schlipf
Formalizing a Logic for Logic Programming. Ann. Math. Artif. Intell. 5 (2-4) (1992)
John S. Schlipf
A Survey of Complexity and Undecidability Results in Logic Programming. Structural Complexity and Recursion-theoretic methods in Logic-Programming (1992)
John S. Schlipf
Representing Epistemic Intervals in Logic Programs. LPNMR (1991)
Allen Van Gelder, Kenneth A. Ross, John S. Schlipf
The Well-Founded Semantics for General Logic Programs. J. ACM 38 (3) (1991)
John S. Schlipf
The Expressive Powers of the Logic Programming Semantics. PODS (1990)
John S. Schlipf
When is Closed World Reasoning Tractable? ISMIS (1988)
Allen Van Gelder, Kenneth A. Ross, John S. Schlipf
Unfounded Sets and Well-Founded Semantics for General Logic Programs. PODS (1988)
John S. Schlipf
Decidability and definability with circumscription. Ann. Pure Appl. Log. 35 (1987)
John S. Schlipf
How Uncomputable is General Circumscription? (Extended Abstract) LICS (1986)
John S. Schlipf
Toward Model Theory Through Recursive Saturation. J. Symb. Log. 43 (2) (1978)
John S. Schlipf
Ordinal Spectra of First-Order Theories. J. Symb. Log. 42 (4) (1977)
Jon Barwise, John S. Schlipf
An Introduction to Recursively Saturated and Resplendent Models. J. Symb. Log. 41 (2) (1976)