Ordered choice logic programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This complete absence of negation does not weaken the language as both forms (classsical and as-failure) can be intuitively simulated in the language for users less familiar with logic programming. The semantics of the language is based on the preference between alternatives, vielding both a skeptical and a credulous approach. In this paper we demostrate how OCLPs can be translated to semi-negative logic programs such that, depending on the transformation. the answer sets of latter correspond with the skeptical/credulous answer sets of the former. By providing such a mapping, we have a mechanism for implementingOCLP using answer set solvers like smodels or dlv. We end with a discussion of the complexity of our system and the reasoning taks it can perform