Skip to Main content Skip to Navigation
Conference papers

Hybridation de l’Answer Set Programming et de la théorie de Dempster Shafer

Abstract : In practical situations it is useful to be able to reason about uncertain knowledge within a non-monotonic logic. This is, the case of expertise processes which finds all possible solutions of a cause. We propose for this purpose an approach that aims at combining the theory of belief functions and Answer Set Programming (ASP) by allowing decisionmaking with the generalized ordered weighted average.
Complete list of metadata

https://hal-emse.ccsd.cnrs.fr/emse-03260636
Contributor : Florent Breuil Connect in order to contact the contributor
Submitted on : Tuesday, June 15, 2021 - 10:10:07 AM
Last modification on : Tuesday, July 6, 2021 - 10:07:47 AM
Long-term archiving on: : Thursday, September 16, 2021 - 6:18:05 PM

File

actes_IC_CH_PFIA2021_98-104.pd...
Files produced by the author(s)

Identifiers

  • HAL Id : emse-03260636, version 1

Collections

Citation

Serge Sounchio, Laurent Geneste, Bernard Kamsu Foguem. Hybridation de l’Answer Set Programming et de la théorie de Dempster Shafer. Journées Francophones d'Ingénierie des Connaissances (IC) Plate-Forme Intelligence Artificielle (PFIA'21), Jun 2021, Bordeaux, France. pp 98-104. ⟨emse-03260636⟩

Share

Metrics

Record views

32

Files downloads

31