Ordered Choice Logic Programming (OCLP) allows for preference-based decision-making with multiple alternatives and 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 skeptical and a credulous approach. In this paper we discuss the theoretical basis for the implementation of an OCLP front-end for answer set solvers that can compute both semantics in an efficient manner. Both the basic algorithm and the proposed optimizations can be used in general and are not tailored towards any particular answer set solver.
|Number of pages||15|
|Publication status||Published - 2003|
|Event||2nd International Workshop on Answer Set Programming Advances in Theory and Implementation, ASP 2003 - Messina, Italy|
Duration: 26 Sep 2003 → 28 Sep 2003
|Conference||2nd International Workshop on Answer Set Programming Advances in Theory and Implementation, ASP 2003|
|Period||26/09/03 → 28/09/03|