2026-04-14T06:26:57Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/879692025-07-17T05:45:45Zcom_2072_1033col_2072_452950

Logic programs with possibilistic ordered disjunction Confalonieri, Roberto Nieves, Juan Carlos Vázquez Salceda, Javier Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics Universitat Politècnica de Catalunya. KEMLG - Grup d'Enginyeria del Coneixement i Aprenentatge Automàtic Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial Non-monotonic reasoning Answer set programming Ordered disjunction 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. Postprint (published version) 2009-05 External research report Confalonieri, R., Nieves, J.C., Vázquez, J. "Logic programs with possibilistic ordered disjunction". 2009. https://hdl.handle.net/2117/87969 eng LSI-09-19-R Open Access 18 p. application/pdf