Implementing Ordered Choice Logic Programming Using Answer Set Solvers

Abstract

Abstract. 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 (classical and as-failure) can be intuitively simulated in the language and eliminated using a simple pre-processor, making it also an easy language for users less familiar with logic programming. 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/credulous answer sets of the former. By providing such a mapping, we have a mechanism for implementing OCLP using answer set solvers like Smodels or dlv. We end with a discussion of the complexity of our system and the reasoning tasks it can perform.

Logic programming with social features

“…Laima (De Vos et al, 2005) agents are represented as ordered choice logic programs (OCLP) (De Vos, 2003) for modeling their knowledge and reasoning capabilities. Communication between the agents is regulated by unidirectional channels transporting information based on their answer sets.…”

Extending Answer Sets for Logic Programming Agents

“…By demonstrating that extended logic programs can be represented in OCLP, we obtain a lower complexity bound for OCLP. Current research [8] involves mapping OCLP to logic programs, thus showing that the complexity of OCLP equals that of logic programming. Having such a result implies that one could use dlv [16] and/or smodels [20] to supply an implementation for OCLP and, consequently, LPAS.…”