Skip to main content
SpringerLink
Log in
Book cover

Mechanizing Mathematical Reasoning pp 154–168Cite as

Decidable Variants of Higher-Order Unification

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2605))

Abstract

Though higher-order unification is in general undecidable, there are expressive and decidable variants. Several interesting special cases and variants stem from restricting algorithms to search only unifiers where the number of bound variables is restricted. The intention of this paper is to summarize results in this area and to shed some light on the connections between context unification, decidable variants of higher-order, second order unification and string unification. Since this paper is intended to appear in a volume in celebrating Jörg Siekmann’s 60th birthday, we will take the opportunity to give hints on how the motivating power of Jörg Siekmann has contributed to and put forward the research in unification.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, P.: An introduction to mathematical logic and type theory: to truth through proof. Academic Press, London (1986)

    MATH  Google Scholar 

  2. Andrews, P.: Classical type theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 15, vol. 2, pp. 965–1007. North-Holland, Amsterdam (2001)

    Chapter  Google Scholar 

  3. Barendregt, H.P.: The Lambda Calculus. Its Syntax and Semantics. North-Holland, Amsterdam (1984)

    MATH  Google Scholar 

  4. Barendregt, H.P.: Functional programming and lambda calculus. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Formal Models and Semantics, ch. 7, vol. B, pp. 321–363. Elsevier, Amsterdam (1990)

    Google Scholar 

  5. Bird, R.: Introduction to Functional Programming using Haskell. Prentice Hall, Englewood Cliffs (1998)

    Google Scholar 

  6. Burstall, R., MacQueen, D., Sanella, D.T.: Hope: an experimental applicative language. In: Proc. LISP Conference, pp. 136–143 (1980)

    Google Scholar 

  7. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  8. Baader, F., Siekmann, J.: Unification theory. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, pp. 41–125. Oxford University Press, Oxford (1994)

    Google Scholar 

  9. Clark, J., DeRose, S. (eds.): XML Path Language (XPath) Version 1.0. W3C, November 16 (1999), http://www.w3.org/TR/1999/REC-xpath-19991116

  10. Comon, H., Jurski, Y.: Higher-order matching and tree automata. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 157–176. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  11. Comon, H.: Completion of rewrite systems with membership constraints. Part I: Deduction rules. J. of Symbolic Computation 25(4), 397–419 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Comon, H.: Completion of rewrite systems with membership constraints. Part II: Constraint solving. J. of Symbolic Computation 25(4), 421–453 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Contejean, E.: Unification under distributivity, Unification workshop, Dagstuhl, Germany (1992)

    Google Scholar 

  14. Contejean, E.: Solving *-problems modulo distributivity by a reduction to AC1-unification. J. of Symbolic Computation 16, 493–521 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. de Groote, P.: Linear higher-order matching is NP-complete. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol. 1833, pp. 127–140. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  16. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Formal Models and Semantics, ch. 6, vol. B, pp. 243–320. Elsevier, Amsterdam (1990)

    Google Scholar 

  17. Dowek, G.: Third order matching is decidable. In: Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, pp. 2–10 (1992)

    Google Scholar 

  18. Dowek, G.: Higher-order unification and matching. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 16, vol. 2, pp. 1009–1062. North-Holland, Amsterdam (2001)

    Chapter  Google Scholar 

  19. Erk, K., Niehren, J.: Parallelism constraints. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol. 1833, pp. 110–126. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  20. Farmer, W.A.: A unification algorithm for second order monadic terms. Annals of Pure and Applied Logic 39, 131–174 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  21. Farmer, W.A.: Simple second-order languages for which unification is un-decidable. J. Theoretical Computer Science 87, 173–214 (1991)

    MathSciNet  Google Scholar 

  22. Goubault-Larrecq, J., Mackie, I.: Proof Theory and Automated Deduction. Applied Logic Series, vol. 6. Kluwer, Dordrecht (1997) ISBN 0-7923-4593-2

    MATH  Google Scholar 

  23. Goldfarb, W.D.: The undecidability of the second-order unification problem. Theoretical Computer Science 13, 225–230 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  24. Gutierrez, C.: Satisfiability of word equations with constants is in exponential space. In: Proceedings FOCS 1998, Palo Alto, California, pp. 112–119. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  25. Hanus, M., Kuchen, H., Moreno-Navarro, J.J.: Curry: A truly functional logic language. In: Proc. ILPS 1995 Workshop on Visions for the Future of Logic Programming, pp. 95–107 (1995)

    Google Scholar 

  26. Huet, G., Lang, B.: Proving and applying program transformations expressed with second-order patterns. Acta Informatica 11, 31–55 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  27. Huet, G.: Undecidability of unification in third-order logic. Information and Control 22, 257–267 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  28. Huet, G.: A unification algorithm for typed λ-calculus. Theoretical Computer Science 1, 27–57 (1975)

    Article  MathSciNet  Google Scholar 

  29. Huet, G.: Résolution d’équations dans des langages d’ordre 1,2,. w. Thèse de doctorat d‘etat, Université Paris VII (1976) (in French)

    Google Scholar 

  30. Hirata, K., Yamada, K., Harao, M.: Tractable and intractable second-order matching problems. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 432–441. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  31. Jensen, D., Pietrzykowski, T.: Meachanizing ω-order type theory through unification. Theoretical Computer Science 3(2), 123–171 (1976)

    Article  MathSciNet  Google Scholar 

  32. Klop, J.W.: Term rewriting systems. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 2, pp. 2–116. Oxford University Press, Oxford (1992)

    Google Scholar 

  33. Kościelski, A., Pacholski, L.: Complexity of Makanin’s algorithms. Journal of the Association for Computing Machinery 43, 670–684 (1996)

    MATH  Google Scholar 

  34. Levy, J.: Linear second order unification. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 332–346. Springer, Heidelberg (1996)

    Google Scholar 

  35. Levy, J.: Decidable and undecidable second order unification problems. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 47–60. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  36. Loader, R.: Higher-order β matching is undecidable (2001) draft

    Google Scholar 

  37. Levy, J., Veanes, M.: On the undecidability of second-order unification. Information and Computation 159, 125–150 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  38. Makanin, G.S.: The problem of solvability of equations in a free semigroup. Math. USSR Sbornik 32(2), 129–198 (1977)

    Article  MATH  Google Scholar 

  39. Miller, D.: A logic programming language with lambda-abstraction, function variables and simple unification. J. of Logic and Computation 1(4), 497–536 (1991)

    Article  MATH  Google Scholar 

  40. Martelli, A., Montanari, U.: An efficient unification algorithm. ACM TOPLAS 4(2), 258–282 (1979)

    Article  Google Scholar 

  41. Narendran, P.: Some remarks on second order unification. Technical report, Inst. of Programming and Logics, Department of Computer Science, Univ. of NY at Albany (1990)

    Google Scholar 

  42. Nipkow, T.: Higher-order critical pairs. In: Proc. 6th IEEE Symp. LICS, pp. 342–349 (1991)

    Google Scholar 

  43. Niehren, J., Pinkal, M., Ruhrberg, P.: On equality up-to constraints over finite trees, context unification, and one-step rewriting. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 34–48. Springer, Heidelberg (1997)

    Google Scholar 

  44. Niehren, J., Pinkal, M., Ruhrberg, P.: A uniform approach to underspecification and parallelism. In: Proceedings of the 35th Annual Meeting of the Association of Computational Linguistics (ACL), Madrid, Spain, pp. 410–417 (1997)

    Google Scholar 

  45. Niehren, J., Tison, S., Treinen, R.: On rewrite constraints and context unification. Information Processing Letters 74, 35–40 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  46. Padovani, V.: Decidability of all minimal models. In: Berardi, S., Coppo, M. (eds.) TYPES 1995. LNCS, vol. 1158. Springer, Heidelberg (1996)

    Google Scholar 

  47. Padovani, V.: Decidability of fourth-order matching. Mathematical Structures in Computer Science 10(3), 361–372 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  48. Paulson, L.C.: ML for the working programmer. Cambridge University Press, Cambridge (1991)

    Google Scholar 

  49. Paulson, L.C.: Isabelle. LNCS, vol. 828. Springer, Heidelberg (1994)

    Book  MATH  Google Scholar 

  50. Pfenning, F.: Logical frameworks. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 17, vol. 2, pp. 1063–1147. North-Holland, Amsterdam (2001)

    Chapter  Google Scholar 

  51. Pietrzykowski, T.: A complete mechanization of second-order type theory. J. ACM 20, 333–364 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  52. Plandowski, W.: Testing equivalence of morphisms in context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 460–470. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  53. Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. In: FOCS 1999, pp. 495–500 (1999)

    Google Scholar 

  54. Plotkin, G.: Building in equational theories. Machine Intelligence 7, 73–90 (1972)

    MATH  MathSciNet  Google Scholar 

  55. Prehofer, C.: Solving Higher-order Equations: From Logic to Programming. Ph.D. thesis, Technische Universitat Munchen (1995) (in German)

    Google Scholar 

  56. Paterson, M.S., Wegman, M.N.: Linear unification. JCSS 16(2), 158–167 (1978)

    MATH  MathSciNet  Google Scholar 

  57. Robinson, J.A.: A machine oriented logic based on the resolution principle. J. of the ACM 12(1), 23–41 (1965)

    Article  MATH  Google Scholar 

  58. Siekmann, J.H.: String-unification. internal report Memo CSM-7, Essex university (1975)

    Google Scholar 

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

    Chapter  Google Scholar 

  60. Siekmann, J.H.: Unification theory: A survey. J. Symbolic Computation 7(3,4), 207–274 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  61. Schmidt-Schauß, M.: Some results for unification in distributive equational theories. Internal Report 7/92, Fachbereich Informatik, J.W. Goethe-Universität Frankfurt, Frankfurt, Germany (1992)

    Google Scholar 

  62. Schmidt-Schauß, M.: An algorithm for distributive unification. Internal Report 13/94, Fachbereich Informatik, J.W. Goethe-Universität Frankfurt, Frankfurt, Germany (1994)

    Google Scholar 

  63. Schmidt-Schauß, M.: An algorithm for distributive unification. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 287–301. Springer, Heidelberg (1996)

    Google Scholar 

  64. Schmidt-Schauß, M.: A decision algorithm for distributive unification. Theoretical Computer Science 208, 111–148 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  65. Schmidt-Schauß, M.: Decidability of bounded second order unification. Technical Report Frank-report-11, FB Informatik, J.W. Goethe-Universität Frankfurt am Main (1999)

    Google Scholar 

  66. Schmidt-Schauß, M.: Decidability of bounded second order unification (2001) (submitted for publication)

    Google Scholar 

  67. Schmidt-Schauß, M.: A decision algorithm for stratified context unification. Journal of Logic and Computation (2001) (accepted for publication)

    Google Scholar 

  68. Schmidt-Schauß, M.: Stratified context unification is in PSPACE. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, p. 498. Springer, Heidelberg (2001) (to appear)

    Chapter  Google Scholar 

  69. Schmidt-Schauß, M., Schulz, K.U.: On the exponent of periodicity of minimal solutions of context equations. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 61–75. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  70. Schmidt-Schauß, M., Schulz, K.U.: Solvability of context equations with two context variables is decidable. Journal of Symbolic Computation (2000) (accepted for publication)

    Google Scholar 

  71. Schmidt-Schauß, M., Schulz, K.U.: Decidability of bounded higher order unification. Frank report 15, Institut für Informatik (2001)

    Google Scholar 

  72. Schmidt-Schauß, M., Stuber, J.: On the complexity of linear and stratified context matching problems. Frank-Report 14, Fachbere-ich Informatik, J.W. Goethe-Universität Frankfurt, Frankfurt, Germany (2001), available at http://www.ki.informatik.uni-frankfurt.de/papers/articles.html

  73. Statman, R.: The typed λ-calculus is not elementary recursive. Theoretical Computer Science 9, 73–81 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  74. Szabó, P.: Unifikationstheorie Erster Ordnung. Ph.D. thesis, Universität Karlsruhe (1982) (in German)

    Google Scholar 

  75. Turner, D.A.: Miranda: A non-strict functional language with polymorphic types. In: Jouannaud, J.-P. (ed.) FPCA 1985. LNCS, vol. 201, pp. 1–16. Springer, Heidelberg (1985)

    Google Scholar 

  76. Vorobyov, S.: ∀ ∃  ∗ -equational theory of context unification is \(\Pi_1^0\)-hard. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 597–606. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  77. Wierzbicki, T.: Complexity of the higher-order matching. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 82–96. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  78. Wolfram, D.A.: The clausal theories of types. Cambridge tracts in theoretical computer science, vol. 21. Cambridge University Press, Cambridge (1993)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Biologie und Informatik, Institut für Informatik, Johann Wolfgang Goethe-Universität, Postfach 11 19 32, D-60054, Frankfurt, Germany

    Manfred Schmidt-Schauß

Authors
  1. Manfred Schmidt-Schauß
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DFKI, Stuhlsatzenhausweg 3, D-66123, Saarbrücken, Germany

    Dieter Hutter

  2. German Research Center for Artificial Intelligence, DFKI GmbH,  

    Werner Stephan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Schmidt-Schauß, M. (2005). Decidable Variants of Higher-Order Unification. In: Hutter, D., Stephan, W. (eds) Mechanizing Mathematical Reasoning. Lecture Notes in Computer Science(), vol 2605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32254-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32254-2_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25051-7

  • Online ISBN: 978-3-540-32254-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation