Possible and necessary answer sets of possibilistic answer set programs

Bauters, Kim, Schockaert, Steven ORCID: https://orcid.org/0000-0002-9256-2881, De Cock, Martine and Vermeir, Dirk 2012. Possible and necessary answer sets of possibilistic answer set programs. 2012 IEEE 24TH International Conference on Tools with Artificial Intelligence (ICTAI 2012), vol. 1 , pp. 836-843. 10.1109/ICTAI.2012.117

Full text not available from this repository.

Abstract

Answer set programming (ASP) and possibility theory can be combined to form possibilistic answer set programming (PASP), a framework for non-monotonic reasoning under uncertainty. Existing proposals view answer sets of PASP programs as weighted epistemic states, in which the strength by which different literals are believed to hold may vary. In contrast, in this paper we propose an approach in which epistemic states remain Boolean, but some epistemic states may be considered more plausible than others. A PASP program is then a representation of an incomplete description of these epistemic states where certainties are associated with each rule which is interpreted in terms of a necessity measure. The main contribution of this paper is the introduction of a new semantics for PASP as well as a study of the resulting complexity.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Publisher:	IEEE
ISSN:	1082-3409
Last Modified:	25 Oct 2022 09:42
URI:	https://orca.cardiff.ac.uk/id/eprint/59686

Citation Data

Cited 11 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item