Sciweavers

Share
AGP
2003
IEEE

An Ordered Choice Logic Programming Front-End for Answer Set Solvers

9 years 3 months ago
An Ordered Choice Logic Programming Front-End for Answer Set Solvers
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased 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 skeptical and a credulous approach. In this paper we demonstrate how OCLPs can be translated to semi-negative logic programs such that, depending on the transformation, the answer sets of the latter correspond with the skeptical or credulous answer sets of the former. By providing such a mapping, we have a mechanism for implementing OCLP using an answer set solver like smodels or dlv.
Marina De Vos
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where AGP
Authors Marina De Vos
Comments (0)
books