Nested Preferences in Answer Set Programming

Authors:
Roberto Confalonieri;Juan Carlos Nieves
Affiliations:
(Correspd.) Universitat Politècnica de Catalunya, Dept. Llenguatges i Sistemes Informàtics, Spain. confalonieri@lsi.upc.edu;Universitat Politècnica de Catalunya, Dept. Llenguatges i Sistemes Informàtics, Spain. jcnieves@lsi.upc.edu
Venue:
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
Year:
2011

Citing 18
Cited 1

Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Nested expressions in logic programs

Annals of Mathematics and Artificial Intelligence
Towards a Possibilistic Logic Handling of Preferences

Applied Intelligence
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
On the Effect of Default Negation on the Expressiveness of Disjunctive Rules

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Qualitative choice logic

Artificial Intelligence - Special issue on nonmonotonic reasoning
PDL with Preferences

POLICY '05 Proceedings of the Sixth IEEE International Workshop on Policies for Distributed Systems and Networks
Modeling preferences and conditional preferences on resource consumption and production in ASP

Journal of Algorithms
Extending CP-nets with stronger conditional preference statements

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
Answer set optimization

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Preferences in AI: An overview

Artificial Intelligence
A logical characterisation of ordered disjunction

AI Communications - Answer Set Programming
Weight constraints with preferences in ASP

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Working with Preferences: Less Is More

Working with Preferences: Less Is More
Answer set programming for computing decisions under uncertainty

ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Handling exceptions in logic programming without negation as failure

ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Possibilistic semantics for logic programs with ordered disjunction

FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems

Dealing with explicit preferences and uncertainty in answer set programming

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we define a class of nested logic programs, called Nested Logic Programs with Ordered Disjunction (LPODs +), which makes it possible to specify conditional (qualitative) preferences by means of nested preference statements. To this end, we augment 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 LPODs showing how our approach generalizes the LPODs framework in a proper way. We also show how the LPODs + semantics can be computed in terms of a translation procedure that maps a nested ordered disjunction program (OD +-program) into a disjunctive logic program.