Implementing ordered choice logic programming using answer set solvers

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

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.
Original languageEnglish
Title of host publicationFoundations of Information and Knowledge Systems, Proceedings
Pages59-77
Number of pages19
Volume2942
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science

    Fingerprint

Cite this

De Vos, M. (2004). Implementing ordered choice logic programming using answer set solvers. In Foundations of Information and Knowledge Systems, Proceedings (Vol. 2942, pp. 59-77). (Lecture Notes in Computer Science).