在抽象论证中减少对基于标签的语义的满足

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2024-05-31 DOI:10.1016/j.ipl.2024.106514

Lixing Tan , Zhaohui Zhu , Jinjin Zhang

{"title":"在抽象论证中减少对基于标签的语义的满足","authors":"Lixing Tan , Zhaohui Zhu , Jinjin Zhang","doi":"10.1016/j.ipl.2024.106514","DOIUrl":null,"url":null,"abstract":"<div><p>The labelling-based approach of <em>abstract argumentation frameworks</em> (AAFs) is beneficial for various applications requiring different levels of decisiveness. For labelling-based semantics, this paper provides an operator so-called reduced meet modulo an ultrafilter, which is inspired by its counterpart over extensions. All criteria involved in the definitions of fundamental labelling-based semantics in AAFs are shown to be closed under this operator. Based on this fact, this paper develops a simple and uniform way for exploring common properties of labelling-based semantics in AAFs, including the compactness of extensibility, the Dcpo and Lindenbaum properties, etc.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106514"},"PeriodicalIF":0.7000,"publicationDate":"2024-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reduced meet over labelling-based semantics in abstract argumentation\",\"authors\":\"Lixing Tan , Zhaohui Zhu , Jinjin Zhang\",\"doi\":\"10.1016/j.ipl.2024.106514\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The labelling-based approach of <em>abstract argumentation frameworks</em> (AAFs) is beneficial for various applications requiring different levels of decisiveness. For labelling-based semantics, this paper provides an operator so-called reduced meet modulo an ultrafilter, which is inspired by its counterpart over extensions. All criteria involved in the definitions of fundamental labelling-based semantics in AAFs are shown to be closed under this operator. Based on this fact, this paper develops a simple and uniform way for exploring common properties of labelling-based semantics in AAFs, including the compactness of extensibility, the Dcpo and Lindenbaum properties, etc.</p></div>\",\"PeriodicalId\":56290,\"journal\":{\"name\":\"Information Processing Letters\",\"volume\":\"187 \",\"pages\":\"Article 106514\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-05-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020019024000449\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019024000449","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

基于标签的抽象论证框架（AAFs）方法有利于各种需要不同程度决定性的应用。对于基于标注的语义，本文提供了一种运算符，即所谓的简化满足模数（reduced meet modulo an ultrafilter），这种运算符的灵感来自其在扩展上的对应运算符。在 AAF 中，基于基本标签的语义定义所涉及的所有标准都被证明在这个算子下是封闭的。基于这一事实，本文开发了一种简单而统一的方法，用于探索 AAF 中基于标记的语义的常见属性，包括可扩展性的紧凑性、Dcpo 和 Lindenbaum 属性等。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Reduced meet over labelling-based semantics in abstract argumentation

The labelling-based approach of abstract argumentation frameworks (AAFs) is beneficial for various applications requiring different levels of decisiveness. For labelling-based semantics, this paper provides an operator so-called reduced meet modulo an ultrafilter, which is inspired by its counterpart over extensions. All criteria involved in the definitions of fundamental labelling-based semantics in AAFs are shown to be closed under this operator. Based on this fact, this paper develops a simple and uniform way for exploring common properties of labelling-based semantics in AAFs, including the compactness of extensibility, the Dcpo and Lindenbaum properties, etc.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.