In recent years symbolic computation algorithms have been proven to be powerful tools for solving longstanding open problems in combinatorics, such as George Andrews' and David Robbins' $q$-TSPP-conjecture and Ira Gessel's lattice path conjecture. In this talk, I will present some combinatorial relations via symbolic approach, including some identities in enumerative combinatorics, some congruences in combinatorial number theory, and some inequalities in analytic combinatorics.