You are presented with multiple paper abstracts, alongside the associated literature review and chapter titles. Given the provided information, you are going to do a literature review. Please generate a coherent literature review that synthesizes the content, draws connections between different works, highlights major findings, and identifies any gaps in the existing research.

Literature Review Title: GENETIC PROGRAMMING WITH LINEAR REPRESENTATION -- A SURVEY 
Chapter Title:  Cartesian Genetic Programming 
1. Abstract of Cited Paper (BIB001):  Parallel Distributed Genetic Programming (PDGP) is a new form of genetic programming suitable for the development of parallel programs in which symbolic and neural processing elements can be combined in a free and natural way. This paper describes the representation for programs and the genetic operators on which PDGP is based. Experimental results on the XOR problem axe also reported. 
2. Abstract of Cited Paper (BIB002):  Cartesian Genetic Programming is a form of genetic programming. It is increasing in popularity. It was developed by Julian Miller with Peter Thomson in 1997. In its classic form it uses a very simple integer based genetic representation of a program in the form of a directed graph. In a number of studies, it has been shown to be efficient in comparison with other GP techniques. ::: Since then, the classical form of CGP has been enhanced in various ways by including automatically defined functions. ::: Most recently, it has been developed by Julian Miller. Wolfgang Banzhaf and Simon Harding to include self-modification operators. This again has increased its efficiency. ::: The tutorial will cover the basic technique, advanced developments and applications to a variety of problem domains.

Literature Review:
Cartesian Genetic Programming (CGP) 8 is a GP technique that encodes chromosomes in graph structures rather than trees like standard GP. The motivation for this representation is that the graphs are more general than the tree structures, thus allowing the construction of more complex computer programs BIB003 . Cartesian GP used a graph representation very similar to Poli's parallel distributed GP (PDGP)  BIB001 BIB002   .