Beierle, ChristophKern-Isberner, GabrieleSödler, KarlGoltz, UrsulaMagnor, MarcusAppelrath, Hans-JürgenMatthies, Herbert K.Balke, Wolf-TiloWolf, Lars2018-11-062018-11-062012978-3-88579-602-2https://dl.gi.de/handle/20.500.12116/17817Ordinal 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.enText/Conference Paper1617-5468