Most recently, Answer Set Programming (ASP) has been attractinginterest as a new paradigm for problem solving. An important aspect,for which several approaches have been presented, is the handling ofpreferences between rules. In this paper, we consider the problem ofimplementing preference handling approaches by means ofmeta-interpreters in Answer Set Programming. In particular, weconsider the preferred answer set approaches by Brewka and Eiter, byDelgrande, Schaub and Tompits, and by Wang, Zhou and Lin. We presentsuitable meta-interpreters for these semantics using DLV, which isan efficient engine for ASP. Moreover, we also present ameta-interpreter for the weakly preferred answer set approach byBrewka and Eiter, which uses the weak constraint feature of DLV as atool for expressing and solving an underlying optimization problem.We also consider advanced meta-interpreters, which make use ofgraph-based characterizations and often allow for more efficientcomputations. Our approach shows the suitability of ASP in generaland of DLV in particular for fast prototyping. This can befruitfully exploited for experimenting with new languages andknowledge-representation formalisms.