| dc.contributor.author | Beierle, Christoph | |
| dc.contributor.author | Kern-Isberner, Gabriele | |
| dc.contributor.author | Södler, Karl | |
| dc.contributor.editor | Goltz, Ursula | |
| dc.contributor.editor | Magnor, Marcus | |
| dc.contributor.editor | Appelrath, Hans-Jürgen | |
| dc.contributor.editor | Matthies, Herbert K. | |
| dc.contributor.editor | Balke, Wolf-Tilo | |
| dc.contributor.editor | Wolf, Lars | |
| dc.date.accessioned | 2018-11-06T10:57:55Z | |
| dc.date.available | 2018-11-06T10:57:55Z | |
| dc.date.issued | 2012 | |
| dc.identifier.isbn | 978-3-88579-602-2 | |
| dc.identifier.issn | 1617-5468 | |
| dc.identifier.uri | http://dl.gi.de/handle/20.500.12116/17817 | |
| dc.description.abstract | Ordinal 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.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | INFORMATIK 2012 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-208 | |
| dc.title | Stepwise optimization of a constraint logic program for the computation of ranking functions | en |
| dc.type | Text/Conference Paper | |
| dc.pubPlace | Bonn | |
| mci.reference.pages | 207-224 | |
| mci.conference.sessiontitle | Regular Research Papers | |
| mci.conference.location | Braunschweig | |
| mci.conference.date | 16.-21. September 2012 | |
