Skip to main content
Springer Nature Link
Log in

Some Experimental Results with Tree Adjunct Grammar Guided Genetic Programming

  • Conference paper
  • First Online:
Genetic Programming (EuroGP 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2278))

Included in the following conference series:

  • 789 Accesses

Abstract

Tree-adjunct grammar guided genetic programming (TAG3P) [5] is a grammar guided genetic programming system that uses context-free grammars along with tree-adjunct grammars as means to set language bias for the genetic programming system. In this paper, we show the experimental results of TAG3P on two problems: symbolic regression and trigonometric identity discovery. The results show that TAG3P works well on those problems.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming: An Introduction. Morgan Kaufmann Pub, USA (1998).

    MATH  Google Scholar 

  2. Gruau, F.: On Using Syntactic Constraints with Genetic Programming. In: Angeline, P. J., Kinnear, K.E. Jr. (eds): Advances in Genetic Programming. The MIT Press, USA (1996) 377–394.

    Google Scholar 

  3. Hoai, N.X.: Solving The Symbolic Regression Problem with Tree-Adjunct Grammar Guided Genetic Programming: The Preliminary Results. (To appear in the Proceedings of The 5th Autraliasia-Japan Co-Joint Workshop on Evolutionary Computation, Nov 2001, Ontago New Zealand).

    Google Scholar 

  4. Hoai, N.X.: Solving Trigonometric Identities with Tree Adjunct Grammar Guided Genetic Programming. (To appear in the Proceedings of The First International Workshop on Hybrid Intelligent Systems (HIS’01), Dec 2001, Adelaide, Australia).

    Google Scholar 

  5. Hoai N.X., McKay, R.I.: A Framework for Tree Adjunct Grammar Guided Genetic Programming. In: Abbass, H.A., Barlow. M. (eds): Proceedings of the Post-graduate ADFA Conference on Computer Science (PACCS’01) (2001) 93–99.

    Google Scholar 

  6. Joshi, A.K., Levy, L.S., Takahashi, M.: Tree Adjunct Grammars. Journal of Computer and System Sciences, 10(1) (1975) 136–163.

    Article  MATH  MathSciNet  Google Scholar 

  7. Joshi, A.K., Schabes, Y.: Tree Adjoining Grammars. In: Rozenberg G, Saloma A (eds) Handbook of Formal Languages. Springer-Verlag, NY, USA, vol 3 (1997) 69–123.

    Google Scholar 

  8. Koza, J.: Genetic Programming. The MIT Press, USA (1992).

    MATH  Google Scholar 

  9. O’Neill, M.: Automatic Programming with Grammatical Evolution. In: Proceedings of the Genetic and Evolutionary Computation Conference Workshop Program, July 13–17, Orlando, Florida USA (1999).

    Google Scholar 

  10. O’Neil, M., Collin, J.J.: Grammar Evolution: Solving Trigonometric Identities. In: Proceedings of Mendel’ 98, (1998) 111–119.

    Google Scholar 

  11. O’Neill, M., Ryan, C.: Grammatical Evolution: A Steady State Approach. In: Proceedings of the Second International Workshop on Frontiers in Evolutionary Algorithms 1998, (1998) 419–423.

    Google Scholar 

  12. O’Neil, M., Ryan, C.: Under the Hood of Grammatical Evolution. In: Banzhaf, W.,.Daida, J., Eiben, A.E., Garzon, M.H., Hovana, V., Jakiela, M., Smith, R.E. (eds): GECCO-99, Morgan Kaufmann Pub, USA (1999).

    Google Scholar 

  13. O’Neill, M., Ryan, C.: Genetic Code Degeneracy: Implication for Grammatical Evolution and Beyond. In: Proceedings of the European Conference on Artificial Life (1999).

    Google Scholar 

  14. Ratle, A., Sebag, M.: Genetic Programming and Domain Knowledge: Beyond the Limitations of Grammar-Guided Machine Discovery. Ecole Polytechnique, France (2000). (Available at: http://www.researchindex.com. Accessed: 30, May, 2001).

  15. Rosca, J.P. and Ballard, D.H.: Genetic Programming with Adaptive Representations. Technical Report 489, The University of Rochester, Feb 1994.

    Google Scholar 

  16. Ryan, C., Collin, J.J., O’Neill, M.: Grammatical Evolution: Evolving Programs for an Arbitrary Language. In: Lecture Note in Computer Science 1391, Proceedings of the First European Workshop on Genetic Programming, Springer-Verlag (1998) 83–95.

    Google Scholar 

  17. Whigham, P.: Grammatically-based Genetic Programming. In: Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, Morgan Kaufmann Pub (1995) 33–41.

    Google Scholar 

  18. Whigham, P.: Search Bias, Language Bias and Genetic Programming. In Genetic Programming 1996, The MIT Press, USA, (1996) 230–237.

    Google Scholar 

  19. Wong, M.L., Leung, K.S.: Evolving Recursive Functions for Even-Parity Problem Using Genetic Programming. In: Angeline, P.J., Kinnear, K.E. Jr. (eds): Advances in Genetic Programming, The MIT Press, USA (1996) 221–240.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of New South Wales, ADFA campus, 2600, Canberra, ACT, Australia

    Nguyen Xuan Hoai, R. I. McKay & D. Essam

Authors
  1. Nguyen Xuan Hoai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. I. McKay
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Essam
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Idaho, 83844-1010, Moscow, ID, USA

    James A. Foster

  2. INRIA Rocquencourt, B.P. 105, 78153, Le Chesnay Cedex, France

    Evelyne Lutton

  3. School of Computer Science, University of Birmingham, B15 2TT, Birmingham, UK

    Julian Miller

  4. Department of Computer Science and Information Systems, University of Limerick, Schuman Building, Limerick, Ireland

    Conor Ryan

  5. Dip. Tecnologie dell’Informazione, Università degli Studi di Milano, Via Bramante 65, 26013, Crema, Italy

    Andrea Tettamanzi

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hoai, N.X., McKay, R.I., Essam, D. (2002). Some Experimental Results with Tree Adjunct Grammar Guided Genetic Programming. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A. (eds) Genetic Programming. EuroGP 2002. Lecture Notes in Computer Science, vol 2278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45984-7_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45984-7_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43378-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics