Logic programs with possibilistic ordered disjunction
Roberto Confalonieri, Juan Carlos Nieves, Javier Vázquez-Salceda · UPCommons institutional repository (Universitat Politècnica de Catalunya) · 2009
Logic programs with ordered disjunction have shown to be a flexible specification language able to model common user preferences in a natural way. However, in some realistic scenarios the preferences should be linked to the evidence of the information when trying to reach a single preferred solution. In this paper, we extend the syntax and the semantics of logic programs with ordered disjunction in order to cope with uncertain information. In particular, we define a possibilistic semantics for capturing possibilistic ordered disjunction programs. We use a simple example to explain the approach and outline an application scenario showing the benefits of possibilistic ordered disjunction.