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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theory and practice of logic programming Ročník 23; číslo 6; s. 1198 - 1247
Hlavní autori: TOTIS, PIETRO, DE RAEDT, LUC, KIMMIG, ANGELIKA
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: 01.11.2023
ISSN:1471-0684, 1475-3081
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract 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.
AbstractList 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.
Author DE RAEDT, LUC
TOTIS, PIETRO
KIMMIG, ANGELIKA
Author_xml – sequence: 1
  givenname: PIETRO
  orcidid: 0000-0001-5845-6914
  surname: TOTIS
  fullname: TOTIS, PIETRO
– sequence: 2
  givenname: LUC
  surname: DE RAEDT
  fullname: DE RAEDT, LUC
– sequence: 3
  givenname: ANGELIKA
  surname: KIMMIG
  fullname: KIMMIG, ANGELIKA
BookMark eNplUM1KxDAYDLKCu6sP4C0vUP2-JE0Tb8viH3RRqIK3kqTpUmkbSerBt7e76sm5zDAzzGFWZDGG0RNyiXCFgMV1haJAkEowDjPU2wlZzlaecVC4OGrMDvkZWaX0DoCSM7EkuzTQ5xhsGfY3tJqM7T3dhcb3tPKDGafOJdqNfxXahnjUxnZ9l-aUbuL-c_DjZKYujOfktDV98he_vCavd7cv24esfLp_3G7KzCGyKUOmVANgHSjjmWAClPWt5rlzrWjzvLAajGLAnBS64VxLq3OrLUrdSCULvib4s-tiSCn6tv6I3WDiV41QH_6o__3BvwG051Pd
Cites_doi 10.1007/978-3-319-11433-0_23
10.1017/S0269888910000275
10.1016/0004-3702(94)00041-X
10.1613/jair.5482
10.1007/978-3-642-23780-5_47
10.1016/j.ijar.2012.08.003
10.1017/S1471068420000253
10.1007/978-3-540-78652-8_8
10.1007/978-3-031-15707-3_4
10.1007/s11225-009-9210-5
10.1016/j.ijar.2014.12.004
10.1007/978-3-540-78652-8
10.4064/fm-17-1-298-329
10.1023/A:1010924021315
10.1007/978-3-319-67582-4_16
10.1145/298514.298572
10.24963/ijcai.2017/9
10.1016/j.ijar.2020.07.004
10.1007/978-94-009-3049-0_2
10.1007/BF03037169
10.1109/ISMVL.2012.26
10.1016/j.ijar.2018.11.019
10.1007/978-3-642-39091-3_11
10.1016/j.artint.2020.103236
10.1016/j.ijar.2019.12.006
10.3233/AAC-190476
10.1007/978-3-642-30353-1_36
10.1017/S1471068408003645
10.1038/nrd1927
10.24963/kr.2022/31
10.1007/978-3-540-78652-8_5
10.1613/jair.1411
10.1016/S1574-6526(07)03007-6
10.1007/978-3-642-29184-5_1
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1017/S147106842300008X
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1475-3081
EndPage 1247
ExternalDocumentID 10_1017_S147106842300008X
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYXX
ABBXD
ABGDZ
ABITZ
ABJNI
ABKKG
ABMWE
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABVKB
ABVZP
ABXHF
ABZCX
ACAJB
ACBMC
ACDLN
ACGFS
ACIMK
ACNCT
ACUIJ
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADKIL
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AFFHD
AFFUJ
AFKQG
AFKRA
AFLOS
AFLVW
AFUTZ
AFZFC
AGABE
AGBYD
AGJUD
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
AKMAY
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AQJOH
ARABE
ARAPS
ATUCA
AUXHV
AZQEC
BBLKV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
BPHCQ
C0O
CAG
CBIIA
CCPQU
CCQAD
CCTKK
CFAFE
CHEAL
CITATION
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EJD
GNUQQ
HCIFZ
HG-
HST
HZ~
I.6
IH6
IOEEP
IPYYG
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
NIKVX
O9-
OYBOY
P2P
P62
PHGZM
PHGZT
PQGLB
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WYP
ZYDXJ
ID FETCH-LOGICAL-c112t-1288d00bc08ae242408bef935ccf4f557b90a8202c649d3396b95b9b169d68673
ISSN 1471-0684
IngestDate Sat Nov 29 04:58:37 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c112t-1288d00bc08ae242408bef935ccf4f557b90a8202c649d3396b95b9b169d68673
ORCID 0000-0001-5845-6914
PageCount 50
ParticipantIDs crossref_primary_10_1017_S147106842300008X
PublicationCentury 2000
PublicationDate 2023-11-00
PublicationDateYYYYMMDD 2023-11-01
PublicationDate_xml – month: 11
  year: 2023
  text: 2023-11-00
PublicationDecade 2020
PublicationTitle Theory and practice of logic programming
PublicationYear 2023
References Charniak (S147106842300008X_ref14) 1991; 12
S147106842300008X_ref57
S147106842300008X_ref13
S147106842300008X_ref12
S147106842300008X_ref15
S147106842300008X_ref59
S147106842300008X_ref17
S147106842300008X_ref16
S147106842300008X_ref19
S147106842300008X_ref18
S147106842300008X_ref51
S147106842300008X_ref50
S147106842300008X_ref53
S147106842300008X_ref52
S147106842300008X_ref55
S147106842300008X_ref10
S147106842300008X_ref54
Vennekens (S147106842300008X_ref58) 2009; 9
Muggleton (S147106842300008X_ref44) 1996; 32
Hunter (S147106842300008X_ref34) 2021; 2
S147106842300008X_ref46
S147106842300008X_ref45
S147106842300008X_ref48
Cadoli (S147106842300008X_ref11) 1997; 10
S147106842300008X_ref49
S147106842300008X_ref40
S147106842300008X_ref42
S147106842300008X_ref41
S147106842300008X_ref43
Gelder (S147106842300008X_ref27) 1991; 38
S147106842300008X_ref9
Dries (S147106842300008X_ref24) 2015
S147106842300008X_ref7
S147106842300008X_ref8
S147106842300008X_ref35
S147106842300008X_ref1
S147106842300008X_ref2
S147106842300008X_ref37
S147106842300008X_ref36
S147106842300008X_ref39
S147106842300008X_ref5
S147106842300008X_ref38
S147106842300008X_ref6
S147106842300008X_ref3
S147106842300008X_ref4
S147106842300008X_ref31
S147106842300008X_ref30
S147106842300008X_ref33
S147106842300008X_ref32
Stede (S147106842300008X_ref56) 2016
Nilsson (S147106842300008X_ref47) 2014
S147106842300008X_ref23
S147106842300008X_ref26
S147106842300008X_ref25
S147106842300008X_ref28
S147106842300008X_ref29
S147106842300008X_ref20
S147106842300008X_ref22
S147106842300008X_ref21
References_xml – ident: S147106842300008X_ref20
– ident: S147106842300008X_ref43
  doi: 10.1007/978-3-319-11433-0_23
– ident: S147106842300008X_ref38
  doi: 10.1017/S0269888910000275
– ident: S147106842300008X_ref25
  doi: 10.1016/0004-3702(94)00041-X
– volume: 2
  start-page: 397
  year: 2021
  ident: S147106842300008X_ref34
  article-title: Probabilistic argumentation: A survey
  publication-title: Handbook of Formal Argumentation
– ident: S147106842300008X_ref17
  doi: 10.1613/jair.5482
– volume-title: Proceedings of the Tenth International Conference on Language Resources and Evaluation LREC 2016, Portorož, Slovenia
  year: 2016
  ident: S147106842300008X_ref56
– ident: S147106842300008X_ref10
– ident: S147106842300008X_ref31
  doi: 10.1007/978-3-642-23780-5_47
– ident: S147106842300008X_ref33
  doi: 10.1016/j.ijar.2012.08.003
– ident: S147106842300008X_ref57
– ident: S147106842300008X_ref1
  doi: 10.1017/S1471068420000253
– ident: S147106842300008X_ref50
  doi: 10.1007/978-3-540-78652-8_8
– ident: S147106842300008X_ref5
  doi: 10.1007/978-3-031-15707-3_4
– ident: S147106842300008X_ref59
  doi: 10.1007/s11225-009-9210-5
– ident: S147106842300008X_ref12
  doi: 10.1016/j.ijar.2014.12.004
– ident: S147106842300008X_ref22
  doi: 10.1007/978-3-540-78652-8
– volume: 10
  start-page: 137
  year: 1997
  ident: S147106842300008X_ref11
  article-title: A survey on knowledge compilation
  publication-title: AI Communications
– ident: S147106842300008X_ref21
  doi: 10.4064/fm-17-1-298-329
– ident: S147106842300008X_ref19
  doi: 10.1023/A:1010924021315
– ident: S147106842300008X_ref49
  doi: 10.1007/978-3-319-67582-4_16
– ident: S147106842300008X_ref54
– ident: S147106842300008X_ref53
  doi: 10.1145/298514.298572
– ident: S147106842300008X_ref48
– ident: S147106842300008X_ref2
  doi: 10.24963/ijcai.2017/9
– ident: S147106842300008X_ref18
  doi: 10.1016/j.ijar.2020.07.004
– ident: S147106842300008X_ref37
  doi: 10.1007/978-94-009-3049-0_2
– ident: S147106842300008X_ref23
– ident: S147106842300008X_ref30
  doi: 10.1007/BF03037169
– ident: S147106842300008X_ref32
  doi: 10.1109/ISMVL.2012.26
– volume: 12,
  start-page: 50
  year: 1991
  ident: S147106842300008X_ref14
  article-title: Bayesian networks without tears
  publication-title: AI Magazine
– ident: S147106842300008X_ref7
  doi: 10.1016/j.ijar.2018.11.019
– volume: 38
  start-page: 620
  year: 1991
  ident: S147106842300008X_ref27
  article-title: The well-founded semantics for general logic programs
  publication-title: J. ACM
– ident: S147106842300008X_ref15
  doi: 10.1007/978-3-642-39091-3_11
– ident: S147106842300008X_ref39
– ident: S147106842300008X_ref36
  doi: 10.1016/j.artint.2020.103236
– ident: S147106842300008X_ref35
– ident: S147106842300008X_ref16
– ident: S147106842300008X_ref51
– ident: S147106842300008X_ref42
  doi: 10.1016/j.ijar.2019.12.006
– ident: S147106842300008X_ref9
  doi: 10.3233/AAC-190476
– ident: S147106842300008X_ref45
  doi: 10.1007/978-3-642-30353-1_36
– ident: S147106842300008X_ref6
  doi: 10.1017/S1471068408003645
– volume: 32
  start-page: 254
  year: 1996
  ident: S147106842300008X_ref44
  article-title: Stochastic logic programs
  publication-title: Advances in inductive logic programming
– ident: S147106842300008X_ref3
– ident: S147106842300008X_ref41
– ident: S147106842300008X_ref26
– ident: S147106842300008X_ref8
  doi: 10.1038/nrd1927
– ident: S147106842300008X_ref52
  doi: 10.24963/kr.2022/31
– volume-title: The MIT Press Essential Knowledge Series
  year: 2014
  ident: S147106842300008X_ref47
– ident: S147106842300008X_ref55
  doi: 10.1007/978-3-540-78652-8_5
– ident: S147106842300008X_ref13
  doi: 10.1613/jair.1411
– ident: S147106842300008X_ref28
  doi: 10.1016/S1574-6526(07)03007-6
– ident: S147106842300008X_ref29
– volume: 9
  start-page: 245
  year: 2009
  ident: S147106842300008X_ref58
  article-title: CP-logic: A language of causal probabilistic events and its relation to logic programming
  publication-title: TPLP
– ident: S147106842300008X_ref4
– year: 2015
  ident: S147106842300008X_ref24
– ident: S147106842300008X_ref46
– ident: S147106842300008X_ref40
  doi: 10.1007/978-3-642-29184-5_1
SSID ssj0016324
Score 2.4148266
Snippet Argumentation problems are concerned with determining the acceptability of a set of arguments from their relational structure. When the available information...
SourceID crossref
SourceType Index Database
StartPage 1198
Title sm ProbLog: Stable Model Semantics in ProbLog for Probabilistic Argumentation
Volume 23
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: P5Z
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database (ProQuest)
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: K7-
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEBbbtIde-i59o0NPDQZ7ZctWb6Z1W5PdzRKcsvSyWLYcFmIn7G5C_kb_cWf08DppC82hF2OELGPPMPNpNN8MIe-lKBWvg8pLQtibhGxceoJXCnatfpNUWMJbly_-Polns2SxEPPR6Kfjwlyexl2XXF2J8_8qahgDYSN19hbi7heFAbgHocMVxA7XfxL8psXsfzk500RmAJPIjcKWZ6dgGFr4kViXedW5STrPEO91qV2s2ryfrk8uWstJ6obo1RD5bW0Bw65CsKnNp8v0ap0vxHDAYZHr1MB5nhVHhz1ozvaP0uxzoWMCx32Y9iCfTnPNoEpnX7NJfpAOQxJjZrl5OysKHg-72ZhIgXJjkcd805_FmV5DNbYqNrSjQWB6U1ufDCAk_qO9t0Wi8IX4PthPIahZ7JybO9C_4fP6TEST5BYvf1viDrk7jiOBhnIe_egPprC6vSas2S90B-VYhfzmEgOoM8AsxSPywG42aGqU5DEZqe4JeegaeVBr15-S6aalVh0-UqMxVGsM7TWGrjo3hYLG0GsaQ69pzDNy_CUrPn3zbJ8NrwK0vfUAoiS178vKT0qFdCE_kaoRLKqqJmyiKJbCLwEpjiseipoxwaWIpJABFzVPeMyek73urFMvCAW8KxvOABgKHtaMS8Vl2ahAlLKEp-RL8sH9kuW5Kaey_KsIXt1m8mtyf6eKb8jedn2h3pJ71eV2tVm_00L8BRuLZCc
linkProvider ProQuest
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=sm+ProbLog%3A+Stable+Model+Semantics+in+ProbLog+for+Probabilistic+Argumentation&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=TOTIS%2C+PIETRO&rft.au=DE+RAEDT%2C+LUC&rft.au=KIMMIG%2C+ANGELIKA&rft.date=2023-11-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=23&rft.issue=6&rft.spage=1198&rft.epage=1247&rft_id=info:doi/10.1017%2FS147106842300008X&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S147106842300008X
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon