Curriculum Vita: John S. Schlipf

Professor, Computer Science, and Member of the Graduate Faculty
Department of Electrical & Computer Engineering and Computer Science
College of Engineering
The University of Cincinnati
Cincinnati, OH 45221-0030, USA

Employment History:

• 1983-Present: Professor of Computer Science (1993-Present)

Associate Professor of Computer Science (1987-1993),
Assistant Professor of Computer Science (1984-1987),
and Assistant Professor of Mathematical Sciences (1983-1984),
University of Cincinnati.
• 1996-1997: Associate Head for Computer Science

Dept. of Electrical & Computer Engineering & Computer Science
University of Cincinnati
• Spring 1995: Visiting Scholar, University of Kentucky
• Summer 1991: Visitor at Mathematical Sciences Institute, Cornell University.
• 1981-1983: Senior Computer Specialist, Dynamac Corporation,

Information and Management Systems Division.
Part time instructor in computer science, St. Mary's College of Maryland.
• 1979-1981: Assistant Professor of Mathematics, St. Mary's College of Maryland.
• 1977-1977: Visiting Lecturer in Mathematics, University of Illinois, Urbana-Champaign.
• 1975-1977: Bateman Research Instructor of Mathematics, California Institute of Technology.

Education:

• 1966-1970: Undergraduate, Carleton College, Northfield, Minnesota. B.A., 1970, mathematics, magna cum Laude.
• 1970-1975: Graduate student, mathematics, University of Wisconsin, Madison.

M.A., 1972, mathematics.
Ph.D., 1975, mathematics; major area: mathematical logic; dissertation advisor: K. Jon Barwise

Research Articles:

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).

 

 

Book Chapter:

1. ``A comparison of notions of negation as failure'', in Advances in Logic Programming Theory, Giorgio Levi ed., Clarendon Press, Oxford, 1994, pages 1-53.

 

 

Invited Addresses:

1. ``On recursively saturated models'', presented to the University of Oslo, Norway, logic seminar, June, 1975.


``Relative constructibility and model theory'', presented to the annual logic meeting at UCLA, November, 1975.

2. ``Ordinal spectra of first order theories'', presented to the Association for Symbolic Logic in Reno, Nevada, April, 1975.
3. ``Scribblings on papers of Kirby and Paris and Paris and Harrington'', presented to the American Mathematical Society (special session on model theory and recursion theory) in Houston, Texas, April, 1978.
4. ``Next admissible sets and structures for infinite languages'', presented to the American Mathematical Society (special session on countable models) in Honolulu, Hawaii, April, 1979.
5. ``When is closed-world reasoning tractable?'', presented to the University of Kentucky computer science seminar, November, 1986.
6. ``Three valued epistemic logic and logic programming'', presented to the University of Kentucky computer science seminar, November, 1987.
7. ``The well-founded semantics for logic programming'', colloquium at the Department of Computer Science, University of Kentucky, November, 1989.
8. ``Formalizing a logic for logic programming'', presented to the First International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, January, 1990.
9. ``The expressive power of the well-founded semantics for logic programming'', colloquium at the School of Computer and Information Sciences, Syracuse University, August, 1991.
10. ``The well-founded and stable semantics for logic programming'', Indiana University logic seminar, September, 1991.
11. ``A framework for comparing different notions of negation'', a series of five lectures at the Fourth International School for Computer Science Researchers, Acireale, Italy, June 29-July 3, 1992.
12. ``An algorithm for unique satisfiability of Horn clauses'', mathematics colloquium, University of Siena (Italy), July, 1992.
13. ``Kripke models for logic programming with partial information'', Dagstuhl seminar on Nonclassical Logics in Computer Science, SchloßDagstuhl, Saarland, Germany, September, 1993.
14. Panel discussion on recursion theory in logic programming and nonmonotonic reasoning, at the Logic Programming and NonMonotonic Reasoning Retreat, Shakertown, Kentucky, October 1994. With Howard Blair and Jeffrey Remmel.
15. ``Well-founded semantics for revision programs'', series of 2 seminar talks, presented to the Logic and Artificial Intelligence Seminary, University of Kentucky, April 1995.
16. ``An algorithm for the class of pure implicational formulas'', Workshop on the Satisfiability Problem, Siena, Italy, April 1996.
17. ``An algorithm for the class of pure implicational formulas'', Fifth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, Jaunary, 1998.

Refereed Addresses:

1. ``Another formulation for circumscription'', presented to the Logic and Computer Science Workshop, Lexington, Kentucky, June, 1985.
2. ``How uncomputable is general circumscription?'', presented to the First Annual Conference on Logic in Computer Science of the IEEE, ACM, and ASL, Cambridge, Massachusetts, June, 1986.
3. ``When is closed world reasoning tractable?'', presented to the Third International Symposium on Methodologies for Intelligent Systems, Turin, Italy, October 1988.
4. ``The expressive powers of the logic programming semantics'', presented to the ninth Symposium on Principles of Database Systems, Nashville, Tennessee, April, 1990.
5. ``Representing epistemic intervals in logic programming'', presented to the First International Workshop on Logic Programming and Non-Monotonic Reasoning, Washington, D.C., July, 1991.
6. ``A survey of complexity and undecidability results in logic programming'', presented to the Workshop on Recursion-theoretic Methods in Logic Programming, held in conjunction with the 1992 Joint International Conference and Symposium on Logic Programming.
7. ``Some remarks on computability and open domain semantics'', presented to the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, held in conjunction with the International Logic Programming Symposium, Vancouver, B.C., October, 1993.
8. ``On finding solutions for extended Horn formulas'', presented to the First International Joint Workshop on Artificial Intelligence and Operations Research, Timberline, Oregon, June, 1995.
9. ``Computing the well-founded semantics faster'', presented to the Third International Conference on Logic Programming and Nonmonotonic Reasoning, Lexington, KY, June, 1995.

(Also contributed papers at meetings of the ASL and the AMS.)

Graduate Students Supervised:

• David Sims, M.S., University of Cincinnati, 1992
• Jennifer Seitzer, Ph.D., University of Cincinnati, 1997

Dissertation: A Study of the Well-Founded and Stable Logic Programming Semantics
• Thomas Wulf, M.S., University of Cincinnati, 2000

Professional Associations: Association for Computing Machinery (ACM)
American Mathematical Society (AMS)
Association for Symbolic Logic (ASL)
Sigma Xi ()

Grants and Contracts While at Cincinnati: : UC Taft Summer Faculty Grant, University of Cincinnati
1986: UC Taft Summer Faculty Grant, University of Cincinnati
1988-1989: NSF Grant IRI-87-05184 (Knowledge & Database Systems)
1989-1992: NSF Grant IRI-89-05166 (Knowledge Models & Cognitive Systems)
1993-1996: ONR Grant N00014-94-1-0382, with John Franco
1998-2001: NSF MRI grant 9871345 (instrumentation grant for UC; one of several co-PI's)
1999-2001: DoD contract MDA904-99-C-4547, co-PI with John Franco
 

• About this document ...

Fri Oct 6 14:52:40 EDT 2000