sm ProbLog: Stable Model Semantics in ProbLog for Probabilistic Argumentation

Argumentation problems are concerned with determining the acceptability of a set of arguments from their relational structure. When the available information is uncertain, probabilistic argumentation frameworks provide modeling tools to account for it. The first contribution of this paper is a novel...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 23; no. 6; pp. 1198 - 1247
Main Authors: TOTIS, PIETRO, DE RAEDT, LUC, KIMMIG, ANGELIKA
Format: Journal Article
Language:English
Published: 01.11.2023
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Argumentation problems are concerned with determining the acceptability of a set of arguments from their relational structure. When the available information is uncertain, probabilistic argumentation frameworks provide modeling tools to account for it. The first contribution of this paper is a novel interpretation of probabilistic argumentation frameworks as probabilistic logic programs. Probabilistic logic programs are logic programs in which some of the facts are annotated with probabilities. We show that the programs representing probabilistic argumentation frameworks do not satisfy a common assumption in probabilistic logic programming (PLP) semantics, which is, that probabilistic facts fully capture the uncertainty in the domain under investigation. The second contribution of this paper is then a novel PLP semantics for programs where a choice of probabilistic facts does not uniquely determine the truth assignment of the logical atoms. The third contribution of this paper is the implementation of a PLP system supporting this semantics: sm ProbLog. sm ProbLog is a novel PLP framework based on the PLP language ProbLog. sm ProbLog supports many inference and learning tasks typical of PLP, which, together with our first contribution, provide novel reasoning tools for probabilistic argumentation. We evaluate our approach with experiments analyzing the computational cost of the proposed algorithms and their application to a dataset of argumentation problems.
ISSN:1471-0684
1475-3081
DOI:10.1017/S147106842300008X