We propose an approach to approximate classical reasoning via well-known theorem-proving techniques. Unlike other approaches, our approach takes into acconnt the interplay of knowledge bases and queries and thus allows for query-sensitive approximate reasoning. We demonstrate that our approach deals extremely well with the examples found in the literature. This reveals that conventional theorem-proving techniques can account for approximate reasoning.