Konferenzbeitrag
Stepwise optimization of a constraint logic program for the computation of ranking functions
Lade...
Volltext URI
Dokumententyp
Text/Conference Paper
Dateien
Zusatzinformation
Datum
2012
Autor:innen
Zeitschriftentitel
ISSN der Zeitschrift
Bandtitel
Quelle
Verlag
Gesellschaft für Informatik e.V.
Zusammenfassung
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.