Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Semantics for possibilistic answer set programs: Uncertain rules versus rules with uncertain conclusions

Bauters, Kim, Schockaert, Steven, De Cock, Martine and Vermeir, Dirk 2014. Semantics for possibilistic answer set programs: Uncertain rules versus rules with uncertain conclusions. International Journal of Approximate Reasoning 55 (2) , pp. 739-761. 10.1016/j.ijar.2013.09.006

Full text not available from this repository.

Abstract

Although Answer Set Programming (ASP) is a powerful framework for declarative problem solving, it cannot in an intuitive way handle situations in which some rules are uncertain, or in which it is more important to satisfy some constraints than others. Possibilistic ASP (PASP) is a natural extension of ASP in which certainty weights are associated with each rule. In this paper we contrast two different views on interpreting the weights attached to rules. Under the first view, weights reflect the certainty with which we can conclude the head of a rule when its body is satisfied. Under the second view, weights reflect the certainty that a given rule restricts the considered epistemic states of an agent in a valid way, i.e. it is the certainty that the rule itself is correct. The first view gives rise to a set of weighted answer sets, whereas the second view gives rise to a weighted set of classical answer sets.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: Elsevier
ISSN: 0888-613X
Last Modified: 21 Feb 2019 13:43
URI: http://orca.cf.ac.uk/id/eprint/59676

Citation Data

Cited 2 times in Google Scholar. View in Google Scholar

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

Actions (repository staff only)

Edit Item Edit Item