Datalog has enriched the Database community by introducing recursive queries and views, which have since become part of the SQL standard. Database consistency and repairs leverage many features of Datalog but have not yet been considered for recursive data and constraints. In this paper we will explore the problem of constraints and inconsistent data pertaining to recursive views over database tuples. Using Datalog rules, existing notions of database repair can be extended and applied to this new class of constraints. We will see through examples how inconsistency can be found in recursive views and how it can be repaired.