Skip to main content
SpringerLink
Log in

Mark Stickel: His Earliest Work

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We consider Mark Stickel’s activities and accomplishments while a graduate student, with a focus on several of the results for which he became known. We report on work we did together, addressing Mark’s substantial contribution, then summarize his work on the unification problem, including the important associative-commutative unification algorithm. We close with Mark’s definition of a fuzzy four-valued logic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Belnap Jr, N.D.: How a computer should think. In: Ryle, G., Bergström, L. (eds.) Contemporary aspects of philosophy, oxford international symposium, pp. 30–56 (1975)

  2. Belnap Jr, N.D.: A useful four-valued logic (summary). In: Dunn, J.M., Epstein, G. (eds.) 1975 international symposium on multiple-valued logic, Bloomington, Indiana, p. 399 (1975)

  3. Fages, F.: Associative-commutative unification. In: Shostak, R.E. (ed.) CADE-7, LNCS, vol. 170, pp. 194–208. Springer, Heidelberg (1984)

  4. Gelernter, H.: Machine-generated Problem-solving Graphs. Symposium on mathematical theory of automata, pp. 179–203, Polytechnic Press, Brooklyn, N.Y. (1962). Reprinted. In: Siekmann, J., Wrightson, G. (eds.) : Automation of Reasoning, vol 1, pp. 288-312. Springer, Heidelberg (1983)

    Google Scholar 

  5. Harrison, J.: Handbook of practical logic and automated reasoning. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  6. Hurd, J.: An Lcf-style Interface Between HOL and First-order Logic. In: Voronkov, A. (ed.) : CADE-18, LNAI, vol. 2392, pp. 134–138. Springer, Heidelberg (2002)

    Google Scholar 

  7. Kowalski, R.A., Kuehner, D.: Linear resolution with the selection function. Artif. Intell. 2, 227–260 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  8. Letz, R., Schumann, J., Bayerl, S., Bibel, W.: SETHEO: a High-performance theorem prover. J. Auto. Reasoning 4, 297–338 (1992)

    MathSciNet  Google Scholar 

  9. Livesey, M., Siekmann, J.: Termination and Decidability Results for String-unification. Memo CSM-12, Univ. of Essex (1975)

  10. Livesey, M., Siekmann, J.: Unification of sets and multisets. Technical Report, Univ. Karlsruhe (1976)

  11. Loveland, D.W., Hodel, R.E., Sterrett, S.G.: Three views of logic: mathematics, philosophy, and computer science. Princeton Univ Press, Princeton (2014)

    Book  Google Scholar 

  12. Loveland, D.W., Stickel, M.E.: A hole in goal trees: some guidance from resolution theory. In: 3rd IJCAI, pp. 153-161 (1973). Also in: IEEE Trans. Computers C-25(4), 335–341 (1976)

  13. Nilsson, N.J.: Problem solving methods in artificial intelligence. McGraw-Hill, New York (1971)

    Google Scholar 

  14. Siekmann, J.H.: Universal Unification. In: Shostak, R.E. (ed.) CADE-7, LNCS, vol. 170, pp. 1–42. Springer, Heidelberg (1984)

  15. Slagle, J.R.: Artificial intelligence: the heuristic programming approach. McGraw-Hill, New York (1971)

    Google Scholar 

  16. Slagle, J.R.: Automated Theorem-Proving with Built-In Theories Including Equality, Partial Ordering and Sets. J. ACM 19, 120–135 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  17. Stickel, M.E.: A Complete Unification Algorithm for Associative-Commutative Functions. In: 4th IJCAI, Tbilisi, U.S.S.R., pp. 71–76 (1975)

  18. Stickel, M.E.: Mechanical theorem proving and artificial intelligence languages. Ph.D. Thesis, Carnegie-Mellon University, Pittsburgh, Pennsylvania (1977)

  19. Stickel. M.F.: Fuzzy four-valued logic for inconsistency and uncertainty. In: International Symposium on Multivalued Logic, pp. 91–94, IEEE Computer Society Press (1978)

  20. Stickel, M.E.: A unification algorithm for associative commutative functions. J. ACM 28(3), 423–434 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  21. Stickel, M.E.: A prolog technology theorem prover: implementation by an extended prolog compiler. J. Auto. Reasoning 4(4), 353–380 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  22. Stickel, M.E.: A prolog technology theorem prover: a new exposition and implementation in prolog. Theor. Comp. Sci. 104, 109–128 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  23. Zadeh, L.A.: Fuzzy sets. Inf. Control 8, 338–353 (1965)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Duke University, Durham, NC, 27708, USA

    Donald W. Loveland

Authors
  1. Donald W. Loveland
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Donald W. Loveland.

Additional information

This paper is dedicated to the memory of Mark, a wonderful friend and a major contributor to the field of automated reasoning.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Loveland, D.W. Mark Stickel: His Earliest Work. J Autom Reasoning 56, 99–112 (2016). https://doi.org/10.1007/s10817-015-9342-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-015-9342-4

Keywords

Search

Navigation