\title{Implementing OCLP as a front-end for Answer Set Solvers: From Theory to Practise} \author{Martin Brain and Marina De Vos\thanks{This work was partially funded by the Information Society Technologies programme of the European Commission, Future and Emerging technologies under the IST-2001-37004 WASP project.}} Ordered Choice Logic Programming (OCLP) allows for preference-based decision-making with multiple alternatives without the burden of any form of negation. This complete absence of negation does not weaken the language as both forms (classical and as-failure) can be intuitively simulated in the language. The semantics of the language is based on the preference between alternatives, yielding both a skeptically and a credulous approach. In this paper we discuss the theoretical basis for the implementation of a software product that can compute both semantics in an efficient manner. Both the basic algorithm as the proposed optimisations can be used in general and are not tailored to-wards any particular answer set solver.