This paper revisits the problem of repairing and querying inconsistent databases with universal constraints. We adopt symmetric difference repair, which utilizes both fact deletions and additions to restore consistency, and use priority relations to specify preferred repair operations. We extend the existing concept of optimal repair to richer environments and study the data complexity of repair verification and inconsistency-tolerant query response. Finally, we clarify the relationship between optimal repair in priority databases and the repair concept introduced in the active integrity constraint framework, and specifically show that the Pareto-optimal repair in this paper corresponds to active integrity constraints. This study provides valuable insights into the behavior of active integrity constraints.