Fuzzy Answer Set Programming with Literal Preferences

Jeroen Janssen, Steven Schockaert, Dirk Vermeir, Martine De Cock

Research output: Chapter in Book/Report/Conference proceedingConference paper

1 Citation (Scopus)

Abstract

In the current approaches to fuzzy answer set programming
(FASP) one can state preferences amongst rules to denote
their relative importance. However, in many situations we need more
complex preferences such as those in the answer set optimization
framework proposed by Brewka for crisp answer set programming.
Unfortunately, these complex preferences do not readily fit into the
current FASP approaches. In this paper we propose a language to
state such preferences and show that programs with these preferences
can be translated into equivalent general fuzzy answer set programming
(gFASP) programs. This not only provides an implementation
method, but also shows that this extension can be added as syntactic
sugar on top of general fuzzy answer set programming solvers
Original languageEnglish
Title of host publicationProceedings of the Joint 2009 International Fuzzy Systems Association World Congress and 2009 European Society of Fuzzy Logic and Technology Conference,
EditorsJ. P. Carvalho, D. Dubois, U. Kaymak, J. M. C. Sousa
Pages1347-1352
Number of pages6
Publication statusPublished - 20 Jul 2009
EventUnknown -
Duration: 20 Jul 2009 → …

Publication series

NameProceedings of the Joint 2009 International Fuzzy Systems Association World Congress and 2009 European Society of Fuzzy Logic and Technology Conference,

Conference

ConferenceUnknown
Period20/07/09 → …

Bibliographical note

J. P. Carvalho, D. Dubois, U. Kaymak, J. M. C. Sousa

Keywords

  • Logic Programming, Fuzzy Logic, Answer Set Program

Fingerprint

Dive into the research topics of 'Fuzzy Answer Set Programming with Literal Preferences'. Together they form a unique fingerprint.

Cite this