Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-08T08:32:57.716Z Has data issue: false hasContentIssue false

Comparative uncertainty: theory and automation

Published online by Cambridge University Press:  01 February 2008

ANDREA CAPOTORTI
Affiliation:
Dipartimento di Matematica e Informatica, Università di Perugia, Via Vanvitelli 1, I-06123 Perugia, Italy Email: capotorti@dipmat.unipg.it; formis@dipmat.unipg.it
ANDREA FORMISANO
Affiliation:
Dipartimento di Matematica e Informatica, Università di Perugia, Via Vanvitelli 1, I-06123 Perugia, Italy Email: capotorti@dipmat.unipg.it; formis@dipmat.unipg.it Dipartimento di Informatica, Università di L'Aquila, Via Vetoio, I-67010 L'Aquila, Italy
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press2008