This extended abstract presents our investigation of practical algorithms for inconsistency-tolerant query answering over prioritized knowledge bases. We introduce SAT encodings for Pareto-and completion-optimal repairs w.r.t. general priority relations over the knowledge base facts and propose several ways of computing answers under (optimal) repair-based semantics by exploiting different reasoning modes of SAT solvers.