Show simple item record

dc.contributor.authorRomero, Javier
dc.contributor.editorMitschang, Bernhard
dc.contributor.editorNicklas, Daniela
dc.contributor.editorLeymann, Frank
dc.contributor.editorSchöning, Harald
dc.contributor.editorHerschel, Melanie
dc.contributor.editorTeubner, Jens
dc.contributor.editorHärder, Theo
dc.contributor.editorKopp, Oliver
dc.contributor.editorWieland, Matthias
dc.date.accessioned2017-06-21T11:24:37Z
dc.date.available2017-06-21T11:24:37Z
dc.date.issued2017
dc.identifier.isbn978-3-88579-660-2
dc.identifier.issn1617-5468
dc.description.abstractAnswer Set Programming (ASP) is a well established approach to declarative problem solving, combining a rich yet simple modeling language with high-performance solving capacities. In this talk we present asprin, a general, flexible and extensible framework for preferences in ASP. asprin is general and captures many of the existing approaches to preferences. It is flexible, because it allows for the combination of different types of preferences. It is also extensible, allowing for an easy implementation of new approaches to preferences. Since it is straightforward to capture propositional theories and constraint satisfaction problems in ASP, the framework is also relevant to optimization in Satisfiability Testing and Constraint Processing.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofDatenbanksysteme für Business, Technologie und Web (BTW 2017) - Workshopband
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-266
dc.subjectPreference
dc.subjectOptimization
dc.subjectAnswer Set Programming
dc.titleasprin: Answer Set Programming with Preferencesen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages159-162
mci.conference.sessiontitleWorkshop Präferenzen und Personalisierung in der Informatik (PPI17)
mci.conference.locationStuttgart
mci.conference.date6.-10. März 2017


Files in this item

Thumbnail

Show simple item record