In the last decades, qualitative approaches to probabilistic uncertainty are receiving wider and wider attention. We propose a new characterization of some of the most adopted partial preference orders by providing an uniform axiomatic treatment of a variety of qualitative uncertainty notions. To this aim we prove a representation result that connects qualitative notions of partial uncertainty to their numerical counterparts. We describe an executable speci¯cation, in the declarative frame-work of Answer Set Programming, that constitutes the core engine for qualitative management of uncertainty. Some basic reasoning tasks are also identified.
Qualitative uncertainty orderings revised
CAPOTORTI, Andrea;FORMISANO, Andrea;
2006
Abstract
In the last decades, qualitative approaches to probabilistic uncertainty are receiving wider and wider attention. We propose a new characterization of some of the most adopted partial preference orders by providing an uniform axiomatic treatment of a variety of qualitative uncertainty notions. To this aim we prove a representation result that connects qualitative notions of partial uncertainty to their numerical counterparts. We describe an executable speci¯cation, in the declarative frame-work of Answer Set Programming, that constitutes the core engine for qualitative management of uncertainty. Some basic reasoning tasks are also identified.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
