We introduce a simple and practically efficient method for repairing inconsistent database. The idea is to properly represent the underlying problem, and then use off-the shelf applications for efficiently computing the corresponding solutions. Given a possibly inconsistent database, we represent the possible ways to restore is consistency in terms of signed formulae. Then we show how the signed theory that is obtained can be usesd by a variety of computational models for processing quantified boolean formulae, or by constraint logic program solvers, in order to rapidly and efficiently compute desired solutions, i.e, consistents repairs of the database.