< Terug naar vorige pagina

Publicatie

Complexity of fuzzy answer set programming under Lukasiewicz semantics: First results

Boekbijdrage - Boekhoofdstuk Conferentiebijdrage

Fuzzy answer set programming (FASP) has recently been proposed as a generalization of answer set programming in which propositions are allowed to be graded. Little is known about its computational complexity. In this paper we present some results and reveal a connection to an open problem about integer equations, suggesting that characterizing the complexity of FASP may not be straightforward.
Boek: Scalable Uncertainty Management - 5th International Conference, SUM 2011, Dayton, OH, USA, October 10-13, 2011. Proceedings.
Pagina's: 7-12
Aantal pagina's: 6
Jaar van publicatie:2011
Trefwoorden:Fuzzy Answer Set Programming, Lukasiewicz logic, Complexity