Entity resolution (ER) is about identifying and merging records in a database\nthat represent the same real-world entity. Matching dependencies (MDs) have\nbeen introduced and investigated as declarative rules that specify ER policies.\nAn ER process induced by MDs over a dirty instance leads to multiple clean\ninstances, in general. General "answer sets programs" have been proposed to\nspecify the MD-based cleaning task and its results. In this work, we extend MDs\nto "relational MDs", which capture more application semantics, and identify\nclasses of relational MDs for which the general ASP can be automatically\nrewritten into a stratified Datalog program, with the single clean instance as\nits standard model.\n