nomore: a system for computing preferred answer sets

Authors:
Susanne Grell;Kathrin Konczak;Torsten Schaub
Affiliations:
Institut für Informatik, Universität Potsdam, Potsdam;Institut für Informatik, Universität Potsdam, Potsdam;Institut für Informatik, Universität Potsdam, Potsdam
Venue:
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Year:
2005

Citing 6
Cited 3

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Preferred answer sets for extended logic programs

Artificial Intelligence
Graphs and colorings for answer set programming with preferences

Fundamenta Informaticae
Computing preferred answer sets by meta-interpretation in Answer Set Programming

Theory and Practice of Logic Programming
A semantic framework for preference handling in answer set programming

Theory and Practice of Logic Programming
A framework for compiling preferences in logic programs

Theory and Practice of Logic Programming

Translating Preferred Answer Set Programs to Propositional Logic

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
On the semantics of logic programs with preferences

Journal of Artificial Intelligence Research
On the semantics of logic programs with preferences

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The integration of preferences into Answer Set Programming (ASP) constitutes an important practical device for distinguishing certain preferred answer sets from non-preferred ones. Up to now, the preference semantics we are considering in this system description were incorporated into answer set solvers either by meta-interpretation [3] or by pre-compilation front-ends [2]; therefore, such kinds of preferences were never integrated into the core existing ASP solvers.