Log canonical singularities form the largest class of “bounded” singularities if we choose to measure how singular they are using an invariant called the discrepancy. Therefore, they are the hardest to classify, which would be very useful, as log canonical class is also the natural class in which we run the Minimal Model Program for pairs. In this talk, I will define what it means to be log canonical and present a couple of tools which are helpful in classifying the (A^3, D) pairs. Finally, I will show one of the cases that I’ve found.