Logic and proofs constitute key factors in increas- ing the user trust towards the Semantic Web. Defeasi- ble reasoning is a useful tool towards the development of the Logic layer of the Semantic Web architecture. However, having a solid mathematical notation, it may be confusing to end users, who often need graphical trace and explanation mechanisms for the derived con- clusions. In a previous work of ours, we outlined a methodology for representing defeasible logic rules, utilizing directed graphs that feature distinct node and connection types. However, visualizing a defeasible logic rule base also involves the placement of the mul- tiple graph elements in an intuitive way, a non-trivial task that aims at improving user comprehensibility. This paper presents a stratification algorithm for visu- alizing defeasible logic rule bases that query and rea- son about RDF data as well as a tool that applies this algorithm.