Gesellschaft für Informatik e.V.

Lecture Notes in Informatics

INFORMATIK 2012 P-208, 205-224 (2012).

Gesellschaft für Informatik, Bonn

Copyright © Gesellschaft für Informatik, Bonn


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

Christoph Beierle , Gabriele Kern-Isberner and Karl Södler


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

Gesellschaft für Informatik, Bonn
ISBN 978-3-88579-602-2

Last changed 20.02.2014 12:57:59