发布求助
文献互助 智能选刊 最新文献

Comma最新文献

筛选
英文 中文
Interpretable Machine Learning with Gradual Argumentation Frameworks 渐进论证框架下的可解释机器学习
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220179
J. Spieler, Nico Potyka, Steffen Staab
{"title":"Interpretable Machine Learning with Gradual Argumentation Frameworks","authors":"J. Spieler, Nico Potyka, Steffen Staab","doi":"10.3233/FAIA220179","DOIUrl":"https://doi.org/10.3233/FAIA220179","url":null,"abstract":"","PeriodicalId":36616,"journal":{"name":"Comma","volume":"47 1","pages":"373-374"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85691795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
ACH-Nav: Argument Navigation Using Techniques for Intelligence Analysis ACH-Nav:使用智能分析技术的论证导航
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220181
Dimitra Zografistou, J. Visser, John Lawrence, C. Reed
{"title":"ACH-Nav: Argument Navigation Using Techniques for Intelligence Analysis","authors":"Dimitra Zografistou, J. Visser, John Lawrence, C. Reed","doi":"10.3233/FAIA220181","DOIUrl":"https://doi.org/10.3233/FAIA220181","url":null,"abstract":"","PeriodicalId":36616,"journal":{"name":"Comma","volume":"114 1","pages":"377-378"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89309051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Explainable Logic-Based Argumentation 可解释的逻辑论证
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220139
O. Arieli, A. Borg, Matthis Hesse, Christian Straßer
{"title":"Explainable Logic-Based Argumentation","authors":"O. Arieli, A. Borg, Matthis Hesse, Christian Straßer","doi":"10.3233/FAIA220139","DOIUrl":"https://doi.org/10.3233/FAIA220139","url":null,"abstract":". Explainable artificial intelligence (XAI) has gained increasing interest in recent years in the argumentation community. In this paper we consider this topic in the context of logic-based argumentation, showing that the latter is a particularly promising paradigm for facilitating explainable AI. In particular, we provide two representations of abductive reasoning by sequent-based argumentation frameworks and show that such frameworks successfully cope with related challenges, such as the handling of synonyms, justifications, and logical equivalences.","PeriodicalId":36616,"journal":{"name":"Comma","volume":"65 1","pages":"32-43"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74005708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Reasoning With and About Norms in Logical Argumentation 逻辑论证中规范与规范的推理
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220164
Kees van Berkel, Christian Straßer
{"title":"Reasoning With and About Norms in Logical Argumentation","authors":"Kees van Berkel, Christian Straßer","doi":"10.3233/FAIA220164","DOIUrl":"https://doi.org/10.3233/FAIA220164","url":null,"abstract":". Normative reasoning is inherently defeasible. Formal argumentation has proven to be a unifying framework for representing nonmonotonic logics. In this work, we provide an argumentative characterization of a large class of Input/Output logics, a prominent defeasible formalism for normative reasoning. In many normative reasoning contexts, one is not merely interested in knowing whether a spe- cific obligation holds, but also in why it holds despite other norms to the contrary. We propose sequent-style argumentation systems called Deontic Argument Calculi ( DAC ), which serve transparency and bring meta-reasoning about the inapplicability of norms to the object language level. We prove soundness and completeness be- tween DAC -instantiated argumentation frameworks and constrained Input/Output logics. We illustrate our approach in view of two deontic paradoxes.","PeriodicalId":36616,"journal":{"name":"Comma","volume":"3 1","pages":"332-343"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79000454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Non-Admissibility in Abstract Argumentation 抽象论证中的不可采信性
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220147
W. Dvořák, Tjitze Rienstra, L. V. D. Torre, S. Woltran
{"title":"Non-Admissibility in Abstract Argumentation","authors":"W. Dvořák, Tjitze Rienstra, L. V. D. Torre, S. Woltran","doi":"10.3233/FAIA220147","DOIUrl":"https://doi.org/10.3233/FAIA220147","url":null,"abstract":"","PeriodicalId":36616,"journal":{"name":"Comma","volume":"34 1","pages":"128-139"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88527552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Serialisable Semantics for Abstract Argumentation 用于抽象论证的可序列化语义
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220143
Lars Bengel, Matthias Thimm
{"title":"Serialisable Semantics for Abstract Argumentation","authors":"Lars Bengel, Matthias Thimm","doi":"10.3233/FAIA220143","DOIUrl":"https://doi.org/10.3233/FAIA220143","url":null,"abstract":". We investigate the recently proposed notion of serialisability of seman- tics for abstract argumentation frameworks. This notion describes semantics where the construction of extensions can be serialised through iterative addition of min- imal non-empty admissible sets. We investigate general relationships between serialisability and other principles from the literature. We also investigate the novel unchallenged semantics as a new instance of a serialisable semantics and, in particular, analyse it in terms of satisfied principles and computational complexity.","PeriodicalId":36616,"journal":{"name":"Comma","volume":"93 1","pages":"80-91"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85848773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Algorithms for Reasoning in a Default Logic Instantiation of Assumption-Based Argumentation 基于假设的论证的默认逻辑实例中的推理算法
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220156
Tuomo Lehtonen, J. Wallner, M. Järvisalo
{"title":"Algorithms for Reasoning in a Default Logic Instantiation of Assumption-Based Argumentation","authors":"Tuomo Lehtonen, J. Wallner, M. Järvisalo","doi":"10.3233/FAIA220156","DOIUrl":"https://doi.org/10.3233/FAIA220156","url":null,"abstract":". Assumption-based argumentation (ABA) is one of the most-studied formalisms for structured argumentation. While ABA is a general formalism that can be instantiated with various different logics, most attention from the computational perspective has been focused on the logic programming (LP) instantiation of ABA. Going beyond the LP-instantiation, we develop an algorithmic approach to reasoning in the propositional default logic (DL) instantiation of ABA. Our approach is based on iterative applications of Boolean satisfiability (SAT) solvers as a natu-ral choice for implementing derivations as entailment checks in DL. We instantiate the approach for deciding acceptance and for assumption-set enumeration in the DL-instantiation of ABA under several central argumentation semantics, and empirically evaluate an implementation of the approach.","PeriodicalId":36616,"journal":{"name":"Comma","volume":"26 1","pages":"236-247"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83945867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Ranking Semantics for Abstract Argumentation Based on Serialisability 基于可序列化性的抽象论证排序语义
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220145
Lydia Blümel, Matthias Thimm
{"title":"A Ranking Semantics for Abstract Argumentation Based on Serialisability","authors":"Lydia Blümel, Matthias Thimm","doi":"10.3233/FAIA220145","DOIUrl":"https://doi.org/10.3233/FAIA220145","url":null,"abstract":". We revisit the foundations of ranking semantics for abstract argumenta- tion frameworks by observing that most existing approaches are incompatible with classical extension-based semantics. In particular, most ranking semantics violate the principle of admissibility, meaning that admissible arguments are not necessarily better ranked than inadmissible arguments. We propose new postulates for capturing said compatibility with classical extension-based semantics and present a new ranking semantics that complies with these postulates. This ranking semantics is based on the recently proposed notion of serialisability that allows to rank arguments according to the number of conflicts needed to be solved in order to include that argument in an admissible set.","PeriodicalId":36616,"journal":{"name":"Comma","volume":"53 1","pages":"104-115"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86053473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Stability and Relevance in Incomplete Argumentation Frameworks 不完全论证框架中的稳定性和相关性
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220159
D. Odekerken, A. Borg, Floris Bex
{"title":"Stability and Relevance in Incomplete Argumentation Frameworks","authors":"D. Odekerken, A. Borg, Floris Bex","doi":"10.3233/FAIA220159","DOIUrl":"https://doi.org/10.3233/FAIA220159","url":null,"abstract":". We explore the computational complexity of stability and relevance in incomplete argumentation frameworks (IAFs), abstract argumentation frameworks that encode qualitative uncertainty by distinguishing between certain and uncertain arguments and attacks. IAFs can be specified by, e.g., making uncertain arguments or attacks certain; the justification status of arguments in an IAF is determined on the basis of the certain arguments and attacks. An argument is stable if its justification status is the same in all specifications of the IAF. For arguments that are not stable in an IAF, the relevance problem is of interest: which uncertain arguments or attacks should be investigated for the argument to become stable? We redefine stability and define relevance for IAFs and study their complexity.","PeriodicalId":36616,"journal":{"name":"Comma","volume":"26 1","pages":"272-283"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79065330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Ordinal Conditional Functions for Abstract Argumentation 抽象论证的有序条件函数
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220162
K. Skiba, Matthias Thimm
{"title":"Ordinal Conditional Functions for Abstract Argumentation","authors":"K. Skiba, Matthias Thimm","doi":"10.3233/FAIA220162","DOIUrl":"https://doi.org/10.3233/FAIA220162","url":null,"abstract":"","PeriodicalId":36616,"journal":{"name":"Comma","volume":"84 1","pages":"308-319"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76182021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信