Fuzzy Answer Set Programming (FASP) combines the non-monotonic reasoning typical of Answer Set Programming with the capability of Fuzzy Logic to deal with imprecise information and paraconsistent reasoning. In the context of paraconsistent reasoning, the fundamental principle of minimal undefinedness states that truth degrees close to 0 and 1 should be preferred to those close to 0.5, to minimize the ambiguity of the scenario. The aim of this paper is to enforce such a principle in FASP through the minimization of a measure of undefinedness. Algorithms that minimize undefinedness of fuzzy answer sets are presented, and implemented.
|Title of host publication||Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA.|
|Number of pages||7|
|Publication status||Published - 9 Feb 2017|
|Event||Thirty-First AAAI Conference on Artificial Intelligence - San Francisco, United States|
Duration: 4 Feb 2017 → 9 Feb 2017
|Conference||Thirty-First AAAI Conference on Artificial Intelligence|
|Period||4/02/17 → 9/02/17|