Towards the Automatic Programming of NEPs

  • Emilio del Rosal
  • Marina de la Cruz
  • Alfonso Ortega de la Puente
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6686)


This paper shows the platform with which we implement a general methodology to automatically design NEPs to solve specific problems. We use CGE/AGE (a new genetic programming algorithm) and jNEP (a Java NEP simulator), two applications we have previously developed. This work is just a proof of viability. We are interested on linking all the modules and generating the initial population. Building this platform is relevant, because our methodology includes several non trivial steps, such as designing a grammar, and implementing and using a simulator. For this first proof we have choosen a well known problem that other authors have solved by means of NEPs.


Context Free Grammar Automatic Program Semantic Constraint High Level Programming Natural Computer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Castellanos, J., Martin-Vide, C., Mitrana, V., Sempere, J.M.: Networks of evolutionary processors. Acta Informatica 39(6-7), 517–529 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J.M.: Solving NP-complete problems with networks of evolutionary processors. In: Mira, J., Prieto, A.G. (eds.) IWANN 2001. LNCS, vol. 2084, p. 621. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Christiansen, H.: A survey of adaptable grammars. SIGPLAN Notices 25(11), 35–44 (1990)CrossRefGoogle Scholar
  4. 4.
    Csuhaj-Varju, E., Martin-Vide, C., Mitrana, V.: Hybrid networks of evolutionary processors are computationally complete. Acta Informatica 41(4-5), 257–272 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    de la Cruz Echeandía, M., de la Puente, A.O., Alfonseca, M.: Attribute grammar evolution. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 182–191. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    del Rosal, E., Nun̈ez, R., Castan̈da, C., Ortega, A.: Simulating neps in a cluster with jnep. In: Proceedings of International Conference on Computers, Communications and Control, ICCCC 2008 (2008)Google Scholar
  7. 7.
    Knuth, D.E.: Semantics of Context-Free Languages. Mathematical Systems Theory 2(2), 127–145 (1968)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Manea, F., Martín-Vide, C., Mitrana, V.: Solving 3CNF-SAT and HPP in linear time using WWW. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 269–280. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Martin-Vide, C., Mitrana, V., Perez-Jimenez, M.J., Sancho-Caparrini, F.: Hybrid networks of evolutionary processors. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 401–412. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    ONeill, M., Conor, R.: Grammatical Evolution, evolutionary automatic programming in an arbitrary language. Kluwer Academic Publishers, Dordrecht (2003)Google Scholar
  11. 11.
    Ortega, A., de la Cruz, M., Alfonseca, M.: Christiansen grammar evolution: Grammatical evolution with semantics. IEEE Transactions on Evolutionary Computation 11(1), 77–90 (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Emilio del Rosal
    • 1
  • Marina de la Cruz
    • 1
  • Alfonso Ortega de la Puente
    • 1
  1. 1.Departamento de Ingeniería Informática, Escuela Politécnica SuperiorUniversidad Autónoma de MadridSpain

Personalised recommendations