Set-of-support strategy for higher-order logic

  • Wenchang Fang
  • Jung-Hong Kao
Applications to Logic Programming, Normalization Strategies and Unification
Part of the Lecture Notes in Computer Science book series (LNCS, volume 656)


We have proven in this paper that set-of-support strategy is complete in higher-order system \(\mathcal{L}\). The situation may not apply to other strategies. For example, hyper-resolution which resolve one nuclear clause with several satellite clauses at one time may not be used in system \(\mathcal{L}\). Because \(\mathcal{L}\) does not contain any inference rules similar to hyper-resolution.

Set-of-support strategy has been worked fine in first-order theorem-proving problem. Though complete in system \(\mathcal{L}\), we have not try in too many examples. We have no idea that how the performance is. More experiments need to be done. Of course, other first-order strategy may also work in system \(\mathcal{L}\), which need more future research. Finally, find a total new, pure strategy for higher-order logic is one other direction.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Church A. A formulation of the simple theory of types. Journal of symbolic logic, 5:56–68, 1940.Google Scholar
  2. [2]
    Peter B. Andrews. Resolution in type theory. Journal of Symbolic logic, 36(3):414–432, sept 1971.Google Scholar
  3. [3]
    Peter B. Andrews, D. Miller, E. Cohen, and F. Pfenning. Automating higher-order logic. In Conlemptary Mathematics 29, pages 169–192, 1984.Google Scholar
  4. [4]
    J. L. Darlington. A partial mechanization of second-order logic. In B. Meltser and D Michie, editors, Machine Intelligence 6, pages 91–100. American Elsevier Publishing Co., 1971.Google Scholar
  5. [5]
    Wenchang Fang and Lawrence Ilenschen. Some heuristics for higher-order logic. In Golden West International Conference on Intelligent System, 1992.Google Scholar
  6. [6]
    Lawrence J. Ilenschen. A resolution style proof procedure for higher-order logic. PhD thesis, University of Illinois at Urbana-Champaign, 1971.Google Scholar
  7. [7]
    G. P. Huet. Constrained Resolution: A Complete Method For Higher order Logic. PhD thesis, Case Western reserve University, 1972.Google Scholar
  8. [8]
    G. P. Huet. A mechanization of type theory. In Proceedings of the third IJCAI, pages 139–146, 1973.Google Scholar
  9. [9]
    G. P. Huet. A unification algorithm for typed lambda-calculus. Theoretical Computer Science, pages 27–57, 1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Wenchang Fang
    • 1
  • Jung-Hong Kao
    • 1
  1. 1.Department of Electrical Engineering and Computer ScienceNorthwestern UniversityEvanston

Personalised recommendations