Skip to main content

Symbolic Regression of Boolean Functions by Genetic Programming

  • Chapter
  • 5812 Accesses

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 38))

Abstract

An evolutionary metaphor of genetic programming for a symbolic regression of Boolean functions, which represent logic circuits, is studied. These functions are coded by acyclic oriented graphs with vertices corresponding to elementary Boolean operations, e. g. negation, conjunction, disjunction (both inclusive and exclusive), and their negations. The used acyclic oriented graphs are represented by the so-called column tables. Basic “genetic” operations of mutation and crossover are performed over these column tables. Preliminary results indicate that the proposed version of genetic programming with column tables is an effective evolutionary tool for a construction of optimized Boolean functions that are specified by tables of functional values for all possible combinations of arguments.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.): EuroGP 2000. LNCS, vol. 1802. Springer, Heidelberg (2000)

    Google Scholar 

  2. Crama, Y., Hammer, P.: Boolean Functions: Theory, Algorithms, and Applications. Encyclopedia of Mathematics and its Applications. Cambridge University Press, New York (2011)

    Google Scholar 

  3. Handley, S.: On the Use of a Directed Acyclic Graph to Represent a Population of Computer Programs. In: Proceedings of the 1994 IEEE World Congress on Computational Intelligence, June 27-29, vol. 1, pp. 154–159. IEEE Press, Orlando (1994)

    Google Scholar 

  4. Harrary, F.: Graph Theory. Addison-Wesley, Reading (1969)

    Google Scholar 

  5. Koza, J.: On the Programming of Computers by Means of Natural Selection. A Bradford book. MIT Press, Cambridge (1992)

    Google Scholar 

  6. Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. Complex adaptive systems. MIT Press, Cambridge (1994)

    Google Scholar 

  7. Koza, J.: Genetic Programming III: Darwinian Invention and Problem Solving. Complex adaptive systems. Morgan Kaufmann, Waltham (1999)

    Google Scholar 

  8. Koza, J., Keane, M., Streeter, M., Mydlowec, W., Yu, J., Lanza, G.: Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer, Dordrecht (2003)

    Google Scholar 

  9. Kvasnicka, V., Pospichal, J.: Simple Implementation of Genetic Programming by Column Tables. In: Chawdhry, P.K., Roy, R., Pant, R.K. (eds.) Soft Computing in Engineering Design and Manufacturing, pp. 48–56. Springer, Berlin (1998)

    Google Scholar 

  10. Kvasnicka, V., Pospichal, J.: Simple Implementation of Genetic Programming by Column Tables. In: Mendel 1997, pp. 71–76. PC-DIR Brno (1997)

    Google Scholar 

  11. Sekanina, L.: Evolvable Components: From Theory to Hardware Implementations. Natural computing series. Springer, Berlin (2004)

    Google Scholar 

  12. Sekanina, L.: Evolutionary Hardware. Academia, Prague (2009) (in Czech)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiří Pospíchal .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Pospíchal, J., Varga, Ľ., Kvasnička, V. (2013). Symbolic Regression of Boolean Functions by Genetic Programming. In: Zelinka, I., Snášel, V., Abraham, A. (eds) Handbook of Optimization. Intelligent Systems Reference Library, vol 38. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30504-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30504-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30503-0

  • Online ISBN: 978-3-642-30504-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics