Qualitative Constraint Enforcement in Advanced Policy Specification

Authors:
Alessandra Mileo;Torsten Schaub
Affiliations:
Dipartimento di Informatica e Comunicazione, Universitá degli Studi di Milano-Bicocca - Lab. Nomadis, Milano, I-20126;Institut für Informatik, Universität Potsdam, Potsdam, D-14439
Venue:
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2007

Citing 7
Cited 1

Extending and implementing the stable model semantics

Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Conflict Resolution Using Logic Programming

IEEE Transactions on Knowledge and Data Engineering
Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Logic programming with ordered disjunction

Eighteenth national conference on Artificial intelligence
PDL with Preferences

POLICY '05 Proceedings of the Sixth IEEE International Workshop on Policies for Distributed Systems and Networks
Properties of programs with monotone and convex constraints

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2

Answer set programming

A 25-year perspective on logic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider advanced policy description specifications in the context of Answer Set Programming (ASP). Motivated by our application scenario, we further extend an existing policy description language, so that it allows for expressing preferences among sets of objects. This is done by extending the concept of ordered disjunctions to cardinality constraints. We demonstrate that this extension is obtained by combining existing ASP techniques and show how it allows for handling advanced policy description specifications.