Stepwise optimization of a constraint logic program for the computation of ranking functions
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.
Full Text: PDF