Weight constraints with preferences in ASP

Authors:
Stefania Costantini;Andrea Formisano
Affiliations:
Università di L'Aquila, Italy;Università di Perugia, Italy
Venue:
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Year:
2011

Citing 4
Cited 4

Extending and implementing the stable model semantics

Artificial Intelligence
Preferred answer sets for ordered logic programs

Theory and Practice of Logic Programming
Comparative uncertainty: Theory and automation

Mathematical Structures in Computer Science
Extending and Implementing RASP

Fundamenta Informaticae - On the Italian Conference on Computational Logic: CILC 2009

Nested Preferences in Answer Set Programming

Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
Dealing with explicit preferences and uncertainty in answer set programming

Annals of Mathematics and Artificial Intelligence
Complex reactivity with preferences in rule-based agents

RuleML'12 Proceedings of the 6th international conference on Rules on the Web: research and applications
Nested Weight Constraints in ASP

Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

Weight and cardinality constraints constitute a very useful programming construct widely adopted in Answer Set Programming (ASP). In recent work we have proposed RASP, an extension to plain ASP where complex forms of preferences can be flexibly expressed. In this paper, we illustrate an application of these preferences within weight/cardinality constraints.We emphasize, mainly by simple examples, the usefulness of the proposed extension. We also show how the semantics for ASP with weight constraints can be suitably extended so as to encompass RASP-like preferences, without affecting complexity.