Samenvatting
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.
| Originele taal-2 | English |
|---|---|
| Titel | Scalable Uncertainty Management - 5th International Conference, SUM 2011, Dayton, OH, USA, October 10-13, 2011. Proceedings. |
| Pagina's | 7-12 |
| Aantal pagina's | 6 |
| Status | Published - 10 okt 2011 |
| Evenement | Unknown - Duur: 10 okt 2011 → … |
Conference
| Conference | Unknown |
|---|---|
| Periode | 10/10/11 → … |