To access the full text documents, please follow this link: http://hdl.handle.net/2117/87969

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
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.
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
Non-monotonic reasoning
Answer set programming
Ordered disjunction
info:eu-repo/semantics/publishedVersion
Report
         

Show full item record

Related documents

Other documents of the same author

Tolchinsky Landsmann, Francisco; Cortés García, Claudio Ulises; Nieves, Juan Carlos; Vázquez Salceda, Javier
Confalonieri, Roberto; Nieves Sánchez, Juan Carlos; Vázquez Salceda, Javier
Lopes, João Sousa; Álvarez Napagao, Sergio; Confalonieri, Roberto; Vázquez Salceda, Javier
Confalonieri, Roberto; Álvarez Napagao, Sergio; Panagiotidi, Sofia; Vázquez Salceda, Javier; Willmott, Steven Nicolás
Confalonieri, Roberto; Nieves Sánchez, Juan Carlos; Vázquez Salceda, Javier
 

Coordination

 

Supporters