Imperial College London
Portrait Picture

ProfessorAlessandraRusso

Faculty of Engineering, Department of Computing

Professor in Applied Computational Logic
 
 
 
//

Contact

 

+44 (0)20 7594 8312a.russo Website

 
 
//

Location

 

560Huxley BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Tuckey:2022,
author = {Tuckey, D and Broda, K and Russo, A},
pages = {1--14},
publisher = {CEUR Workshop Proceedings},
title = {A semantics for probabilistic answer set programs with incomplete stochastic knowledge},
url = {https://ceur-ws.org/Vol-3193/paper4ASPOCP.pdf},
year = {2022}
}
Download

RIS format (EndNote, RefMan)

TY  - CPAPER
AB  - Some probabilistic answer set programs (PASP) semantics assign probabilities to sets of answer sets and implicitly assume these answer sets to be equiprobable. While this is a common choice in probability theory, it leads to unnatural behaviours with PASPs. We argue that the user should have a level of control over what assumption is used to obtain a probability distribution when the stochastic knowledge is incomplete. To this end, we introduce the Incomplete Knowledge Semantics (IKS) for probabilistic answer set programs. We take inspiration from the field of decision making under ignorance. Given a cost function, represented by a user-defined ordering over answer sets through weak constraints, we use the notion of Ordered Weighted Averaging (OWA) operator to distribute the probability over a set of answer sets accordingly to the user’s level of optimism. The more optimistic (or pessimistic) a user is, the more (or less) probability is assigned to the more optimal answer sets. We present an implementation and showcase the behaviour of this semantics on simple examples. We also highlight the impact that different OWA operators have on weight learning, showing that the equiprobability assumption is not always the best option.
AU  - Tuckey,D
AU  - Broda,K
AU  - Russo,A
EP  - 14
PB  - CEUR Workshop Proceedings
PY  - 2022///
SN  - 1613-0073
SP  - 1
TI  - A semantics for probabilistic answer set programs with incomplete stochastic knowledge
UR  - https://ceur-ws.org/Vol-3193/paper4ASPOCP.pdf
UR  - http://hdl.handle.net/10044/1/101612
ER  -
Download