Abstract

Since it is a relatively new concept, little is known about the computational complexity of fuzzy answer set programming (FASP) and almost no techniques are available to compute answer sets of FASP programs. Furthermore, the connections of FASP to other paradigms of nonmonotonic reasoning with continuous values are largely unexplored. In our dissertation, we contribute to the ongoing research on FASP on two different levels: complexity and connections to fuzzy modal logics.

Abstract

Towards a Deeper Understanding of Nonmonotonic Reasoning with Degrees / 3205 Marjon Blondeel, Steven Schockaert, Dirk Vermeir, Martine De Cock Since it is a relatively new concept, little is known about the computational complexity of fuzzy answer set programming (FASP) and almost no techniques are available to compute answer sets of FASP programs. Furthermore, the connections of FASP to other paradigms of nonmonotonic reasoning with continuous values are largely unexplored. In our dissertation, we contribute to the ongoing research on FASP on two different levels: complexity and connections to fuzzy modal logics.