Comma最新文献

筛选
英文 中文
The Skeptic Web Service: Utilising Argument Technologies for Reason-Checking 怀疑论网络服务:利用论证技术进行推理检查
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220180
J. Visser, John Lawrence
{"title":"The Skeptic Web Service: Utilising Argument Technologies for Reason-Checking","authors":"J. Visser, John Lawrence","doi":"10.3233/FAIA220180","DOIUrl":"https://doi.org/10.3233/FAIA220180","url":null,"abstract":"","PeriodicalId":36616,"journal":{"name":"Comma","volume":"46 1","pages":"375-376"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76212531","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
Strongly Accepting Subframeworks: Connecting Abstract and Structured Argumentation 强接受子框架:连接抽象和结构化论证
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220163
Markus Ulbricht, J. Wallner
{"title":"Strongly Accepting Subframeworks: Connecting Abstract and Structured Argumentation","authors":"Markus Ulbricht, J. Wallner","doi":"10.3233/FAIA220163","DOIUrl":"https://doi.org/10.3233/FAIA220163","url":null,"abstract":"","PeriodicalId":36616,"journal":{"name":"Comma","volume":"78 1","pages":"320-331"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86225260","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
Rule-PSAT: Relaxing Rule Constraints in Probabilistic Assumption-Based Argumentation 规则- psat:在基于概率假设的论证中放松规则约束
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220149
Xiuyi Fan
{"title":"Rule-PSAT: Relaxing Rule Constraints in Probabilistic Assumption-Based Argumentation","authors":"Xiuyi Fan","doi":"10.3233/FAIA220149","DOIUrl":"https://doi.org/10.3233/FAIA220149","url":null,"abstract":"","PeriodicalId":36616,"journal":{"name":"Comma","volume":"7 1","pages":"152-163"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88478724","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
Argument Schemes for Factor Ascription 因子归因的论证方案
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220142
Trevor J. M. Bench-Capon, Katie Atkinson
{"title":"Argument Schemes for Factor Ascription","authors":"Trevor J. M. Bench-Capon, Katie Atkinson","doi":"10.3233/FAIA220142","DOIUrl":"https://doi.org/10.3233/FAIA220142","url":null,"abstract":". Reasoning with legal cases by balancing factors (reasons to decide for and against the disputing parties) is a two stage process: first the factors must be ascribed and then these reasons for and against weighed to reach a decision. While the task of determining which set of reasons is stronger has received much attention, the task of factor ascription has not. Here we present a set of argument schemes for factor ascription, illustrated with a detailed example.","PeriodicalId":36616,"journal":{"name":"Comma","volume":"42 1","pages":"68-79"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75683859","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
Attractor - A Java Library for Gradual Bipolar Argumentation 一个用于渐进双极性论证的Java库
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220177
Nico Potyka
{"title":"Attractor - A Java Library for Gradual Bipolar Argumentation","authors":"Nico Potyka","doi":"10.3233/FAIA220177","DOIUrl":"https://doi.org/10.3233/FAIA220177","url":null,"abstract":"","PeriodicalId":36616,"journal":{"name":"Comma","volume":"148 1","pages":"369-370"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73472695","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
Gorgias Cloud: On-line Explainable Argumentation Gorgias Cloud:在线可解释论证
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220178
Nikolaos I. Spanoudakis, Georgios Gligoris, A. Kakas, A. Koumi
{"title":"Gorgias Cloud: On-line Explainable Argumentation","authors":"Nikolaos I. Spanoudakis, Georgios Gligoris, A. Kakas, A. Koumi","doi":"10.3233/FAIA220178","DOIUrl":"https://doi.org/10.3233/FAIA220178","url":null,"abstract":"","PeriodicalId":36616,"journal":{"name":"Comma","volume":"68 1","pages":"371-372"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72805888","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
Arguing About the Existence of Conflicts 争论冲突的存在
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220160
Giuseppe Pisano, Roberta Calegari, H. Prakken, G. Sartor
{"title":"Arguing About the Existence of Conflicts","authors":"Giuseppe Pisano, Roberta Calegari, H. Prakken, G. Sartor","doi":"10.3233/FAIA220160","DOIUrl":"https://doi.org/10.3233/FAIA220160","url":null,"abstract":". In this paper we formalise a meta-argumentation framework as an ASPIC + extension which enables reasoning about conflicts between formulae of the argumentation language. The result is a standard abstract argumentation framework that can be evaluated via grounded semantics.","PeriodicalId":36616,"journal":{"name":"Comma","volume":"7 1","pages":"284-295"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76097056","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
Detect - Debunk - Communicate: Combating Misinformation with More Realistic NLP 检测-揭穿-沟通:用更现实的NLP对抗错误信息
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220135
Iryna Gurevych
{"title":"Detect - Debunk - Communicate: Combating Misinformation with More Realistic NLP","authors":"Iryna Gurevych","doi":"10.3233/FAIA220135","DOIUrl":"https://doi.org/10.3233/FAIA220135","url":null,"abstract":"","PeriodicalId":36616,"journal":{"name":"Comma","volume":"37 1","pages":"15"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79382008","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
EGNN: A Deep Reinforcement Learning Architecture for Enforcement Heuristics EGNN:用于执行启发式的深度强化学习架构
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220169
Dennis Craandijk, Floris Bex
{"title":"EGNN: A Deep Reinforcement Learning Architecture for Enforcement Heuristics","authors":"Dennis Craandijk, Floris Bex","doi":"10.3233/FAIA220169","DOIUrl":"https://doi.org/10.3233/FAIA220169","url":null,"abstract":"An increasing amount of research is being directed towards neuro-symbolic computing, combining learning in neural networks with reasoning and explainability via symbolic representations [4]. One subfield of AI where neuro-symbolic methods are a promising alternative for existing symbolic methods is computational argumentation. Much of the theory of computational argumentation is based on the seminal work by Dung [6], in which he introduces abstract argumentation frameworks (AFs) of arguments and attacks, and several acceptability semantics that define which sets of arguments (extensions) can be reasonably accepted. Core computational problems in abstract argumentation are typically solved with handcrafted symbolic methods [1]. However, recently we demonstrated the potential of a deep learning approach by showing that a graph neural network is able to learn to determine almost perfectly which arguments are (part of) an extension [2]. When considering dynamic argumentation a growing research area where the knowledge about attacks between arguments can be incomplete or evolving other types of computational problems arise where neuro-sybmolic methods are still unexplored. In [3] we propose our enforcement graph neural network (EGNN), a learning-based approach to the dynamic argumentation problem of enforcement: given sets of arguments that we (do not) want to accept, how to modify the argumentation framework in such a way that these arguments are (not) accepted, while minimizing the number of changes [5]. Here we demonstrate our implementation of an EGNN.","PeriodicalId":36616,"journal":{"name":"Comma","volume":"60 1","pages":"353-354"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77467703","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
An Argumentative Explanation of Machine Learning Outcomes 机器学习结果的论证性解释
Comma Pub Date : 2022-01-01 DOI: 10.3233/FAIA220166
Stefano Bistarelli, Alessio Mancinelli, Francesco Santini, Carlo Taticchi
{"title":"An Argumentative Explanation of Machine Learning Outcomes","authors":"Stefano Bistarelli, Alessio Mancinelli, Francesco Santini, Carlo Taticchi","doi":"10.3233/FAIA220166","DOIUrl":"https://doi.org/10.3233/FAIA220166","url":null,"abstract":"","PeriodicalId":36616,"journal":{"name":"Comma","volume":"26 1","pages":"347-348"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86984552","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
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学术文献互助群
群 号:481959085
Book学术官方微信