Logo des Repositoriums
 
Konferenzbeitrag

On the computation of ranking functions for default rules – a challenge for constraint programming

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Text/Conference Paper

Zusatzinformation

Datum

2011

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Verlag

Gesellschaft für Informatik e.V.

Zusammenfassung

Qualitative conditionals of the form If A then normally B can be viewed as default rules, and they require a semantical treatment going beyond the models used in classical logic. Ranking functions assigning degrees of plausibility to each possible world have been proposed as an appropriate semantic formalism. In this paper, we discuss the computation of c-representations corresponding to particular ranking functions for a set R of qualitative conditionals. As a challenge for constraint programming, we formulate a constraint satisfaction problem CR(R) as a declarative specification of all c-representations for R, and we argue that employing constraint programming techniques will be advantageous for computing all minimal solutions of CR(R).

Beschreibung

Beierle, Christoph; Kern-Isberner, Gabriele (2011): On the computation of ranking functions for default rules – a challenge for constraint programming. INFORMATIK 2011 – Informatik schafft Communities. Bonn: Gesellschaft für Informatik e.V.. PISSN: 1617-5468. ISBN: 978-88579-286-4. pp. 249-249. Regular Research Papers. Berlin. 4.-7. Oktober 2011

Schlagwörter

Zitierform

DOI

Tags