Logo des Repositoriums
 

Stepwise optimization of a constraint logic program for the computation of ranking functions

dc.contributor.authorBeierle, Christoph
dc.contributor.authorKern-Isberner, Gabriele
dc.contributor.authorSödler, Karl
dc.contributor.editorGoltz, Ursula
dc.contributor.editorMagnor, Marcus
dc.contributor.editorAppelrath, Hans-Jürgen
dc.contributor.editorMatthies, Herbert K.
dc.contributor.editorBalke, Wolf-Tilo
dc.contributor.editorWolf, Lars
dc.date.accessioned2018-11-06T10:57:55Z
dc.date.available2018-11-06T10:57:55Z
dc.date.issued2012
dc.description.abstractOrdinal conditional functions (OCFs) can be used for assigning a semantics to qualitative conditionals of the form if A then (normally) B. The set of OCFs accepting all conditionals in a knowledge base R can be specified as the solutions of a constraint satisfaction problem CR(R). In this paper, we present three optimizations of a high-level, declarative CLP program solving CR(R) and illustrate the benefits of these optimizations by various examples.en
dc.identifier.isbn978-3-88579-602-2
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/17817
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofINFORMATIK 2012
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-208
dc.titleStepwise optimization of a constraint logic program for the computation of ranking functionsen
dc.typeText/Conference Paper
gi.citation.endPage224
gi.citation.publisherPlaceBonn
gi.citation.startPage207
gi.conference.date16.-21. September 2012
gi.conference.locationBraunschweig
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
207.pdf
Größe:
387.91 KB
Format:
Adobe Portable Document Format