Skip to main content
SpringerLink
Log in

Unranked Second-Order Anti-Unification

  • Conference paper
Logic, Language, Information, and Computation (WoLLIC 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8652))

Abstract

In this work we study anti-unification for unranked hedges, permitting context and hedge variables. Hedges are sequences of unranked terms. The anti-unification problem of two hedges \(\tilde{s} \) and \(\tilde{q}\) is concerned with finding their generalization, a hedge \(\tilde{g}\) such that both \(\tilde{s} \) and \(\tilde{q}\) are substitution instances of \(\tilde{g}\). Second-order power is gained by using context variables to generalize vertical differences at the input hedges. Hedge variables are used to generalize horizontal differences. An anti-unification algorithm is presented, which computes a generalization of input hedges and records all the differences. The computed generalizations are least general among a certain class of generalizations.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alpuente, M., Escobar, S., Meseguer, J., Ojeda, P.: A modular equational generalization algorithm. In: Hanus, M. (ed.) LOPSTR 2008. LNCS, vol. 5438, pp. 24–39. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Alpuente, M., Escobar, S., Meseguer, J., Ojeda, P.: Order-sorted generalization. Electr. Notes Theor. Comput. Sci. 246, 27–38 (2009)

    Article  Google Scholar 

  3. Amir, A., Hartman, T., Kapah, O., Shalom, B.R., Tsur, D.: Generalized LCS. Theor. Comput. Sci. 409(3), 438–449 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  4. Armengol, E., Plaza, E.: Bottom-up induction of feature terms. Machine Learning 41(3), 259–294 (2000)

    Article  MATH  Google Scholar 

  5. Baader, F.: Unification, weak unification, upper bound, lower bound, and generalization problems. In: Book, R.V. (ed.) RTA 1991. LNCS, vol. 488, pp. 86–97. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  6. Baumgartner, A., Kutsia, T.: Unranked Second-Order Anti-Unification. Technical report no. 14-05, RISC, JKU Linz (March 2014), http://www.risc.jku.at/publications/download/risc_4966/Baumgartner_Kutsia_2014.pdf

  7. Baumgartner, A., Kutsia, T., Levy, J., Villaret, M.: A variant of higher-order anti-unification. In: van Raamsdonk, F. (ed.) RTA. LIPIcs, vol. 21, pp. 113–127. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)

    Google Scholar 

  8. Boley, H.: Finite domains and exclusions as first-class citizens. In: Dyckhoff, R. (ed.) ELP 1993. LNCS, vol. 798, pp. 37–61. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  9. Bulychev, P.E., Kostylev, E.V., Zakharov, V.A.: Anti-unification algorithms and their applications in program analysis. In: Pnueli, A., Virbitskaite, I., Voronkov, A. (eds.) PSI 2009. LNCS, vol. 5947, pp. 413–423. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Burghardt, J.: E-generalization using grammars. Artif. Intell. 165(1), 1–35 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Delcher, A.L., Kasif, S.: Efficient parallel term matching and anti-unification. J. Autom. Reasoning 9(3), 391–406 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  12. Hasker, R.W.: The Replay of Program Derivations. PhD thesis, University of Illionois at Urbana-Champaign (1995)

    Google Scholar 

  13. Huet, G.: Résolution d’équations dans des langages d’ordre 1,2,…,ω. PhD thesis, Université Paris VII (September 1976)

    Google Scholar 

  14. Kao, M.-Y., Lam, T.W., Sung, W.-K., Ting, H.-F.: An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings. J. Algorithms 40(2), 212–233 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  15. Krumnack, U., Schwering, A., Gust, H., Kühnberger, K.-U.: Restricted higher-order anti-unification for analogy making. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), vol. 4830, pp. 273–282. Springer, Heidelberg (2007)

    Google Scholar 

  16. Kutsia, T., Levy, J., Villaret, M.: Anti-unification for unranked terms and hedges. J. Autom. Reasoning 52(2), 155–190 (2014)

    Article  MathSciNet  Google Scholar 

  17. Li, H., Thompson, S.: Similar code detection and elimination for Erlang programs. In: Carro, M., Peña, R. (eds.) PADL 2010. LNCS, vol. 5937, pp. 104–118. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  18. Lu, J., Mylopoulos, J., Harao, M., Hagiya, M.: Higher order generalization and its application in program verification. Ann. Math. Artif. Intell. 28(1-4), 107–126 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  19. Pfenning, F.: Unification and anti-unification in the calculus of constructions. In: LICS, pp. 74–85. IEEE Computer Society (1991)

    Google Scholar 

  20. Plotkin, G.D.: A note on inductive generalization. Machine Intel. 5(1), 153–163 (1970)

    Google Scholar 

  21. Reynolds, J.C.: Transformational systems and the algebraic structure of atomic formulas. Machine Intel. 5(1), 135–151 (1970)

    Google Scholar 

  22. Schmid, U.: Inductive Synthesis of Functional Programs. LNCS (LNAI), vol. 2654. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  23. Yamamoto, A., Ito, K., Ishino, A., Arimura, H.: Modelling semi-structured documents with hedges for deduction and induction. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, pp. 240–247. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  24. Zhang, K.: Algorithms for the constrained editing problem between ordered labeled trees and related problems. Pattern Recognition 28, 463–474 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Symbolic Computation, Johannes Kepler University Linz, Austria

    Alexander Baumgartner & Temur Kutsia

Authors
  1. Alexander Baumgartner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Temur Kutsia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Mathematik, TU Darmstadt, Schlossgartenstrasse 7, 64289, Darmstadt, Germany

    Ulrich Kohlenbach

  2. Department of Computer Science, Universidad de Chile, Avenida Blanco Encalada 2120, Oficina 316, Tercer Piso, Santiago, Chile

    Pablo Barceló

  3. Centro de Informática, Universidade Federal de Pernambuco (UFPE), Av. Jornalista Anibal Fernandes, s/n, Cidade Universitária, 50., 740-560, Recife, PE, Brazil

    Ruy de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baumgartner, A., Kutsia, T. (2014). Unranked Second-Order Anti-Unification. In: Kohlenbach, U., Barceló, P., de Queiroz, R. (eds) Logic, Language, Information, and Computation. WoLLIC 2014. Lecture Notes in Computer Science, vol 8652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44145-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44145-9_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44144-2

  • Online ISBN: 978-3-662-44145-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation