nextupprevious
Next:About this document

Publications of John S. Schlipf

  1. ``On recursively saturated models of arithmetic'', Model Theory and Algebra: A Memorial Tribute to Abraham Robinson, D.H. Saracino and V.B. Weispfenning, eds., Springer-Verlag, 1975, 42-55. Co-authored with Jon Barwise.
  2. ``An introduction to recursively saturated and resplendent models'', Journal of Symbolic Logic 41, 1976, 531-536. Co-authored with Jon Barwise.
  3. ``A guide to the identification of admissible sets above structures'', Annals of Mathematical Logic 12, 1977, 151-192.
  4. ``Ordinal Spectra of first order theories'', Journal of Symbolic Logic 42, 1977, 492-505.
  5. ``Toward model theory through recursive saturation'', Journal of Symbolic Logic 43, 1978, 183-206.
  6. ``A generalized Kleene-Moschovakis theorem'', Proceedings of the American Mathematical Society 68, 1978, 209-214. Co-authored with Leo Harrington and Lefteris Kirousis.
  7. ``Recursively saturated models of set theory'', Proceedings of the American Mathematical Society 80, 1980, 135-142.
  8. ``Generating subsets of order statistics with applications to trimmed means and means of trimmings'', Journal of Statistical Computation and Simulation 24,1986, 83-97. Co-authored with Paul Horn.
  9. ``How uncomputable is general circumscription?'', Proceedings of the Symposium on Logic in Computer Science (of the IEEE), 1986, 92-95.
  10. ``Who's being swindled? A case for enlightened naivite'', Journal of Statistical Computation and Simulation 26, 1986, 21-36. Co-authored with Paul Horn.
  11. ``Definability and decidability using circumscription'', Annals of Pure and Applied Logic 35, 1987, 173-191.
  12. ``When is closed world reasoning tractable?'', Proceedings of the Third International Symposium on Methodologies for Intelligent Systems, 1988, 485-494
  13. ``The well-founded semantics for general logic programs'', Journal of the ACM, 1991, 620-650. Co-authored with Allen Van Gelder and Kenneth Ross.
  14. ``Representing epistemic intervals in logic programming'', in A. Nerode, W. Marek, and V.S. Subramahnian, editors, Logic Programming and Non-monotonic Reasoning: Proceedings of the First International Workshop, MIT Press, 1991, 133-147.
  15. ``Formalizing a logic for logic programming'', Annals of Mathematics and Artificial Intelligence 5, 1992, 279-302.
  16. ``The expressive powers of the logic programming semantics'', Journal of Computer and Systems Sciences 51 (1995), pp. 64-86. A preliminary version appeared in Proceedings of the Eighth Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1990, 196-204.
  17. ``Common sense axiomatizations for logic programs'', Journal of Logic Programming 17 (1993), pp. 161-195. Co-authored with Allen Van Gelder.
  18. ``The expressiveness of locally stratified programs'', Annals of Mathematics & Artificial Intelligence 15(1995), pp. 209-229. Co-authored with Howard Blair and Wiktor Marek.
  19. ``Unique satisfiability of Horn sets can be solved in nearly linear time'', Discrete Applied Mathematics 60 (1995), pp. 77-91. Co-authored with Kenneth Berman and John Franco.
  20. ``Complexity and undecidability results in logic programming'', Annals of Mathematics and Artificial Intelligence 15 (1995), pp. 257-288. A preliminary version appeared in the proceedings of the Workshop on Recursion-theoretic Methods in Logic Programming, 1992 Joint International Conference and Symposium on Logic Programming.
  21. ``On finding solutions for extended Horn formulas'', Information Processing Letters 54(1995) 133-137. Co-authored with Fred Annexstein, John Franco, and R. P. Swaminathan.
  22.  "Some remarks on computability and open domain semantics," proceedings of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming of the International Logic Programming Symposium, Vancouver, B.C., October, 1993.
  23. ``Computing the well-founded semantics faster'', Logic Programming and Nonmonotonic Reasoning, Proceedings of the Third International Conference (June, 1995), V. W. Marek, A. Nerode, and M. Truszczynski, eds, Springer Verlag Lecture Notes in Artificial Intelligence 928, pp. 113-126. Co-authored with Kenneth Berman and John Franco.
  24. ``Affordable classes of normal logic programs,'' Logic Programming and Nonmonotonic Reasonging, Proceedings of the Fourth International Conference (July, 1997), J. Dix, U. Furbach, and A. Nerode, eds., Springer-Verlag Lecture Notes in Artificial Intelligence 1265, pp. 92-111. Co-authored with Jennifer Seitzer.
  25.  ``An algorithm for the class of pure implicational formulas,''Discrete Applied Mathematics 96-97 (1999), pp. 80-106. Co-authored with John Franco, Judy Goldsmith, Ewald Speckenmeyer, and R. P. Swaminathan.
  26.  "An empirical study of the 4-valued Kripke--Kleene and 4-valued well-founded semantics in random propositional logic programs," Annals of Mathematics and Artificial Intelligence 25 (1999), pp. 275-309. Co-authored with Chris Giannella. (A preliminary version appeared in Proceedings of the Logic Programming Workshop of the Seventh International Workshop on Nonmonotonic Reasoning (Trento, Italy, May-June, 1998).

    27.  

     
     
     
     
     


nextupprevious
Next:About this document
John Schlipf

Fri Oct 6 15:24:49 EDT 2000