Possibilistic semantics for logic programs with ordered disjunction

  • Authors:

  • Roberto Confalonieri;Juan Carlos Nieves;Mauricio Osorio;Javier Vázquez-Salceda

  • Affiliations:

  • Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona;Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona;CENTIA, Universidad de las Américas, Puebla, México;Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona

  • Venue:
  • FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Logic programs with ordered disjunction (or LPODs) have shown to be a flexible specification language able to model and reason about preferences in a natural way. However, in some realistic applications which use user preferences in the reasoning, information can be pervaded with vagueness and a preference-aware reasoning process that can handle uncertainty is required. In this paper we address these issues, and we propose a framework which combines LPODs and possibilistic logic to be able to deal with a reasoning process that is preference-aware, non-monotonic, and uncertain. We define a possibilistic semantics for capturing logic programs with possibilistic ordered disjunction (or LPPODs) which is a generalization of the original semantics. Moreover, we present several transformation rules which can be used to optimize LPODs and LPPODs code and we show how the semantics of LPODs and the possibilistic semantics of LPPODs are invariant w.r.t. these transformations.