This paper addresses the problem of characterizing consistent query answers in relational databases that may violate integrity constraints. The authors propose a method to compute consistent answers to queries and prove its soundness and completeness for certain classes of constraints and queries. The method involves an iterative procedure that generates a new query, denoted as \( T_{\omega}(Q) \), which returns the set of consistent answers to the original query \( Q \) in any database, whether consistent or inconsistent. The paper discusses the application of this method in data warehousing, database integration, and active and reactive databases, highlighting its potential to prevent data loss during cleaning and to handle inconsistencies in integrated databases. The authors also provide examples and detailed proofs to support their theoretical results.This paper addresses the problem of characterizing consistent query answers in relational databases that may violate integrity constraints. The authors propose a method to compute consistent answers to queries and prove its soundness and completeness for certain classes of constraints and queries. The method involves an iterative procedure that generates a new query, denoted as \( T_{\omega}(Q) \), which returns the set of consistent answers to the original query \( Q \) in any database, whether consistent or inconsistent. The paper discusses the application of this method in data warehousing, database integration, and active and reactive databases, highlighting its potential to prevent data loss during cleaning and to handle inconsistencies in integrated databases. The authors also provide examples and detailed proofs to support their theoretical results.