Article ID Journal Published Year Pages File Type
397125 International Journal of Approximate Reasoning 2012 33 Pages PDF
Abstract

A number of different Fuzzy Answer Set Programming (FASP) formalisms have been proposed in the last years, which all differ in the language extensions they support. In this paper we investigate the expressivity of these frameworks. Specifically we show how a variety of constructs in these languages can be implemented using a considerably simpler core language. These simulations are important as a compact and simple language is easier to implement and to reason about, while an expressive language offers more options when modeling problems.

► We present a core language for fuzzy answer set programming (FASP). ► We show that many common extensions for FASP can be simulated in this core language. ► A core language is important for theorists as the theory gets easier to reason about, while retaining generality. ► A core language is important for implementers as FASP solvers can focus on the core language in the backend.

Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence
Authors
, , , ,