Published online by Cambridge University Press: 01 February 2008
In recent decades, qualitative approaches to probabilistic uncertainty have received more and more attention. We propose a characterisation of partial preference orders through a uniform axiomatic treatment of a variety of qualitative uncertainty notions. To this end, we prove a representation result that connects qualitative notions of partial uncertainty to their numerical counterparts. We describe an executable specification, in the declarative framework of Answer Set Programming, that constitutes the core engine for qualitative management of uncertainty. Some basic reasoning tasks are also identified.
Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.
* Views captured on Cambridge Core between September 2016 - 26th February 2021. This data will be updated every 24 hours.