Drawing graphs is a discipline in graph theory, dealing with the optimal representation of graphs. An important class of graphs are the planar graphs, which can be drawn without any intersecting edges. Such graphs are superior in terms of human readability. Radial level graphs are a specific class of graphs that only have edges between vertices of different levels, which are arranged in concentric circles. The knowledge about the planarity of a graph enables the use of more efficient algorithms to display good representations. In this book, several approaches are discussed to describe the problem of radial level planarity in a propositional logic framework. A model is introduced that describes the problem as a SAT problem and for some types of graphs even as a 2-SAT problem, which is solvable in linear time. The truth assignment of the variables describes the non-intersecting embedding. Additionally, the model is capable of introducing vertices-grouping, enabling the modelling of semantic rules. This book is aiming for scientists that do research in the fields of graph drawing and/or propositional networks and theoretical informatics as well as for interested students.