Logo des Repositoriums
 

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

dc.contributor.authorBeierle, Christoph
dc.contributor.authorKern-Isberner, Gabriele
dc.contributor.editorHeiß, Hans-Ulrich
dc.contributor.editorPepper, Peter
dc.contributor.editorSchlingloff, Holger
dc.contributor.editorSchneider, Jörg
dc.date.accessioned2018-11-27T09:59:06Z
dc.date.available2018-11-27T09:59:06Z
dc.date.issued2011
dc.description.abstractQualitative 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).en
dc.identifier.isbn978-88579-286-4
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/18615
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofINFORMATIK 2011 – Informatik schafft Communities
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-192
dc.titleOn the computation of ranking functions for default rules – a challenge for constraint programmingen
dc.typeText/Conference Paper
gi.citation.endPage249
gi.citation.publisherPlaceBonn
gi.citation.startPage249
gi.conference.date4.-7. Oktober 2011
gi.conference.locationBerlin
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
249.pdf
Größe:
27.33 KB
Format:
Adobe Portable Document Format