Nested logic programs with ordered disjunction
Document typeConference report
PublisherCEUR Workshop Proceedings
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
In this paper we define a class of nested logic programs, nested logic programs with ordered disjunction (LPODs+), which allows to specify qualitative preferences by means of nested preference expressions. For doing this we extend the syntax of logic programs with ordered disjunction (LPODs) to capture more general expressions. We define the LPODs+ semantics in a simple way and we extend most of the results of logic programs with ordered disjunction showing how our approach effectively is a proper generalisation of LPODs.
CitationConfalonieri, R.; NIEVES, J. C. Nested logic programs with ordered disjunction. A: Latin American Workshop on Non-Monotonic Reasoning. "6th Latin American Workshop on Non-Monotonic Reasoning 2010". Puebla: CEUR Workshop Proceedings, 2010, p. 55-66.