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

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.
  • Vollständige Referenz
  • BibTeX
Beierle, C., Kern-Isberner, G. & Södler, K., (2012). Stepwise optimization of a constraint logic program for the computation of ranking functions. In: Goltz, U., Magnor, M., Appelrath, H.-J., Matthies, H. K., Balke, W.-T. & Wolf, L. (Hrsg.), INFORMATIK 2012. Bonn: Gesellschaft für Informatik e.V.. (S. 207-224).
@inproceedings{mci/Beierle2012,
author = {Beierle, Christoph AND Kern-Isberner, Gabriele AND Södler, Karl},
title = {Stepwise optimization of a constraint logic program for the computation of ranking functions},
booktitle = {INFORMATIK 2012},
year = {2012},
editor = {Goltz, Ursula AND Magnor, Marcus AND Appelrath, Hans-Jürgen AND Matthies, Herbert K. AND Balke, Wolf-Tilo AND Wolf, Lars} ,
pages = { 207-224 },
publisher = {Gesellschaft für Informatik e.V.},
address = {Bonn}
}
DateienGroesseFormatAnzeige
207.pdf387.9Kb PDF Öffnen

Haben Sie fehlerhafte Angaben entdeckt? Sagen Sie uns Bescheid: Feedback abschicken

Mehr Information

ISBN: 978-3-88579-602-2
ISSN: 1617-5468
Datum: 2012
Sprache: en (en)
Typ: Text/Conference Paper
Sammlungen

Zur Langanzeige