John S. Schlipf

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

Chitta Baral, Gerhard Brewka, John S. Schlipf (Eds.): Logic Programming and Nonmonotonic Reasoning, 9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, Proceedings. Lecture Notes in Computer Science 4483, Springer 2007, isbn 978-3-540-72199-4

Gary Haggard, John S. Schlipf, Sue Whitesides: Discrete mathematics for computer science. Thomson Brooks/Cole 2006, isbn 978-0-534-49501-5, pp. I-XXXIII, 1-600

Sean Weaver, John V. Franco, John S. Schlipf: Extending Existential Quantification in Conjunctions of BDDs. JSAT 1(2): 89-110 (2006)

John V. Franco, Michal Kouril, John S. Schlipf, Sean Weaver, Michael Dransfield, W. Mark Vanfleet: Function-Complete Lookahead in Support of Efficient SAT Search Heuristics. J. UCS 10(12): 1655-1695 (2004)

Jeffrey Ward, John S. Schlipf: Answer Set Programming with Clause Learning. LPNMR 2004: 302-313

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

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): 275-309 (1999)

John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan: An Algorithm for the Class of Pure Implicational Formulas. Discrete Applied Mathematics 96-97: 89-106 (1999)

J. Seitzer, John S. Schlipf: Affordable Classes of Normal Logic Programs. LPNMR 1997: 92-111

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

John S. Schlipf: Complexity and Undecidability Results for Logic Programming. Ann. Math. Artif. Intell. 15(3-4): 257-288 (1995)

Kenneth A. Berman, John V. Franco, John S. Schlipf: Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. Discrete Applied Mathematics 60(1-3): 77-91 (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): 133-137 (1995)

John S. Schlipf: The Expressive Powers of the Logic Programming Semantics. J. Comput. Syst. Sci. 51(1): 64-86 (1995)

Kenneth A. Berman, John S. Schlipf, John V. Franco: Computing Well-founded Semantics Faster. LPNMR 1995: 113-126

Allen Van Gelder, John S. Schlipf: Commonsense Axiomatizations for Logic Programs. J. Log. Program. 17(2/3&4): 161-195 (1993)

John S. Schlipf: Formalizing a Logic for Logic Programming. Ann. Math. Artif. Intell. 5(2-4): 279-302 (1992)

John S. Schlipf: A Survey of Complexity and Undecidability Results in Logic Programming. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 143-164

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

John S. Schlipf: Representing Epistemic Intervals in Logic Programs. LPNMR 1991: 133-147

John S. Schlipf: The Expressive Powers of the Logic Programming Semantics. PODS 1990: 196-204

John S. Schlipf: When is Closed World Reasoning Tractable? ISMIS 1988: 485-494

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

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

John S. Schlipf: Toward Model Theory Through Recursive Saturation. J. Symb. Log. 43(2): 183-206 (1978)

John S. Schlipf: Ordinal Spectra of First-Order Theories. J. Symb. Log. 42(4): 492-505 (1977)

Jon Barwise, John S. Schlipf: An Introduction to Recursively Saturated and Resplendent Models. J. Symb. Log. 41(2): 531-536 (1976)