International Journal of Approximate Reasoning最新文献_第3页

Chain graph structure learning based on minimal c-separation trees 基于最小 C 分离树的链图结构学习

IF 3.2 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-09-20 DOI: 10.1016/j.ijar.2024.109298

Luyao Tan , Yi Sun , Yu Du

引用次数: 0

Three-way conceptual knowledge updating in incomplete contexts 不完整语境中的三向概念知识更新

IF 3.2 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-09-17 DOI: 10.1016/j.ijar.2024.109299

Ruisi Ren , Ling Wei , Jianjun Qi , Xiaosong Wei

{"title":"Three-way conceptual knowledge updating in incomplete contexts","authors":"Ruisi Ren , Ling Wei , Jianjun Qi , Xiaosong Wei","doi":"10.1016/j.ijar.2024.109299","DOIUrl":"10.1016/j.ijar.2024.109299","url":null,"abstract":"<div><div>We usually encounter incomplete data in daily life due to the uncertainty of data and limitation of data acquisition technology. In formal concept analysis, the incomplete formal context is used to reflect uncertain relation between objects and attributes caused by missing data. The conceptual knowledge of the incomplete formal context is presented by a kind of three-way concept called partially-known formal concept. As time passes and technology matures, some initially missing data becomes obtainable, the incomplete formal context is updated accordingly, and the corresponding concepts change as well. However, obtaining partially-known concepts from the updated context based on definition is time-consuming and does not fully utilize the conceptual knowledge implicit in the original context. In order to make full use of existing conceptual knowledge and acquire new concepts quickly and efficiently, we discuss how to obtain new partially-known formal concepts by updating original partially-known formal concepts, and design corresponding concept updating algorithms. Finally, through data experiments, we validate that our proposed concept update algorithm can significantly improve the efficiency of concept acquisition, especially when the updating rate is small.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"175 ","pages":"Article 109299"},"PeriodicalIF":3.2,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142310870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Approximations of system W for inference from strongly and weakly consistent belief bases 从强一致和弱一致信念基础进行推理的系统 W 近似值

IF 3.2 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-09-13 DOI: 10.1016/j.ijar.2024.109295

Jonas Haldimann, Christoph Beierle

{"title":"Approximations of system W for inference from strongly and weakly consistent belief bases","authors":"Jonas Haldimann, Christoph Beierle","doi":"10.1016/j.ijar.2024.109295","DOIUrl":"10.1016/j.ijar.2024.109295","url":null,"abstract":"<div><p>In this article, we investigate approximations of the inductive inference operator system W that has been shown to exhibit desirable inference properties and to extend both system Z, and thus rational closure, and c-inference. For versions of these inference operators that are extended to also cover inference from belief bases that are only weakly consistent, we first show that extended system Z and extended c-inference are captured by extended system W. Then we introduce general functions for generating inductive inference operators: the combination of two inductive inference operators by union, and the completion of an inductive inference operator by an arbitrary set of axioms. We construct the least inductive inference operator extending system Z and c-inference that is closed under system P and show that it is still strictly extended by extended system W. Furthermore, we introduce an inductive inference operator that strictly extends extended system W and that is strictly extended by lexicographic inference. This leads to a comprehensive map of inference relations between rational closure and extended c-inference on the one side and lexicographic inference on the other side with extended system W and its approximations at its centre, where all relationships also hold for the unextended versions.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"175 ","pages":"Article 109295"},"PeriodicalIF":3.2,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0888613X24001828/pdfft?md5=aea167416445f5cb415a0340cf6d3109&pid=1-s2.0-S0888613X24001828-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142240009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Fuzzy implications-based transformation approaches from semi-three-way decision spaces to three-way decision spaces and their applications 从半三元决策空间到三元决策空间的基于模糊含义的转换方法及其应用

IF 3.2 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-09-13 DOI: 10.1016/j.ijar.2024.109296

Yiding Wang , Junsheng Qiao , Tengbiao Li

{"title":"Fuzzy implications-based transformation approaches from semi-three-way decision spaces to three-way decision spaces and their applications","authors":"Yiding Wang , Junsheng Qiao , Tengbiao Li","doi":"10.1016/j.ijar.2024.109296","DOIUrl":"10.1016/j.ijar.2024.109296","url":null,"abstract":"<div><p>Three-way decision spaces, as an important component of three-way decisions, greatly enrich their theoretical development and application prospects. Meanwhile, fuzzy implications, as a vital class of fuzzy logic connectives, have made great contributions to the solution of practical problems, especially complex decision-making problems. This paper considers the collaborative effect of the two, which inject new vitality into the theoretical development and application prospects of fuzzy implications and three-way decision spaces. As a vital component of three-way decision spaces, (semi-)decision evaluation functions have been widely studied based on fuzzy logic connectives and become a research hotspot. Specifically, this paper focuses on fuzzy implications-based transformation approaches from semi-three-way decision spaces to three-way decision spaces and their applications. Firstly, we present some novel fuzzy implications-based transformation approaches from semi-decision evaluation functions to decision evaluation functions, and construction approaches of semi-decision evaluation functions involving the existing semi-decision evaluation functions, fuzzy sets, interval-valued fuzzy sets and fuzzy relations. Secondly, we discuss the relationship between our approaches and the known construction approaches of three-way decision spaces. Notably, our approaches cover all existing approaches except the uninorms-based approaches. Finally, by the experiment results, we obtain our approaches are feasible, effective, superior to the known three-way decision spaces approaches and have good anti-noise ability. And, the parameter <em>ρ</em> of our approaches is also effective and stable.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"175 ","pages":"Article 109296"},"PeriodicalIF":3.2,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142240010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On permutations dependent operators 关于排列依存算子

IF 3.2 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-09-10 DOI: 10.1016/j.ijar.2024.109294

Stanislav Basarik, Lenka Halčinová

引用次数: 0

Three-way concept lattice based on Boolean formal context 基于布尔形式语境的三向概念网格

IF 3.2 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-09-07 DOI: 10.1016/j.ijar.2024.109286

Dong-Yun Niu , Ju-Sheng Mi

引用次数: 0

An implementation of nonmonotonic reasoning with c-representations using an SMT solver 使用 SMT 求解器实现 c-representations 非单调推理

IF 3.2 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-09-05 DOI: 10.1016/j.ijar.2024.109285

Martin von Berg, Arthur Sanin, Christoph Beierle

{"title":"An implementation of nonmonotonic reasoning with c-representations using an SMT solver","authors":"Martin von Berg, Arthur Sanin, Christoph Beierle","doi":"10.1016/j.ijar.2024.109285","DOIUrl":"10.1016/j.ijar.2024.109285","url":null,"abstract":"<div><p>A qualitative conditional “If A then usually B” establishes a plausible connection between the antecedent A and the consequent B. As a semantics for conditional knowledge bases containing such conditionals, ranking functions order possible worlds by mapping them to a degree of plausibility. c-Representations are special ranking functions that are obtained by assigning individual integer impacts to the conditionals in a knowledge base <span><math><mi>R</mi></math></span> and by defining the rank of each possible world as the sum of these impacts of falsified conditionals. c-Inference is the nonmonotonic inference relation taking all c-representations of a given knowledge base <span><math><mi>R</mi></math></span> into account. In this paper, we show how c-inference can be realized as a satisfiability modulo theories problem (SMT), which allows an implementation by an appropriate SMT solver. Moreover, we show that this leads to the first implementation fully realizing c-inference because it does not require a predefined upper limit for the impacts assigned to the conditionals. We develop a transformation of the constraint satisfaction problem characterizing c-inference into a solvable-equivalent SMT problem, prove its correctness, and illustrate it by a running example. Furthermore, we provide a corresponding implementation using the SMT solver Z3. We develop and implement a randomized generation scheme for knowledge bases and queries, and evaluate our SMT-based implementation of c-inference with respect to such randomly generated knowledge bases. Our evaluation demonstrates the feasibility of our approach as well as the superiority in comparison to former implementations of c-inference.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"175 ","pages":"Article 109285"},"PeriodicalIF":3.2,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0888613X24001725/pdfft?md5=e3a30005031d13d2a253154186187e64&pid=1-s2.0-S0888613X24001725-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142164298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Logical syllogisms with “Almost all, Most, Many, A few” and “Several” 带有 "几乎所有、大多数、许多、少数 "和 "若干 "的逻辑三段论

IF 3.2 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-09-03 DOI: 10.1016/j.ijar.2024.109284

Petra Murinová, Vilém Novák

引用次数: 0

Grounded semantics and principle-based analysis for incomplete argumentation frameworks 不完整论证框架的基础语义学和基于原则的分析

IF 3.2 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-09-02 DOI: 10.1016/j.ijar.2024.109282

Jean-Guy Mailly

{"title":"Grounded semantics and principle-based analysis for incomplete argumentation frameworks","authors":"Jean-Guy Mailly","doi":"10.1016/j.ijar.2024.109282","DOIUrl":"10.1016/j.ijar.2024.109282","url":null,"abstract":"<div><p>Incomplete Argumentation Frameworks (IAFs) enrich classical abstract argumentation with arguments and attacks whose actual existence is questionable. The usual reasoning approaches rely on the notion of completion, <em>i.e.</em> standard AFs representing “possible worlds” compatible with the uncertain information encoded in the IAF. Recently, extension-based semantics for IAFs that do not rely on the notion of completion have been defined, using instead new versions of conflict-freeness and defense that take into account the (certain or uncertain) nature of arguments and attacks. In this paper, we give new insights on both the “completion-based” and the “direct” reasoning approaches. First, we adapt the well-known grounded semantics to this framework in two different versions that do not rely on completions. After determining that our new semantics are polynomially computable, we provide a principle-based analysis of these semantics, as well as the “direct” semantics previously defined in the literature, namely the complete, preferred and stable semantics. Finally, we also provide new results regarding the satisfaction of principles by the classical “completion-based” semantics.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"175 ","pages":"Article 109282"},"PeriodicalIF":3.2,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0888613X24001695/pdfft?md5=a67ae311f4886d4fd78eaed11ac33dc3&pid=1-s2.0-S0888613X24001695-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142148515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Robust support function machines for set-valued data classification 用于集值数据分类的稳健支持函数机

IF 3.2 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-08-30 DOI: 10.1016/j.ijar.2024.109281

Zhizheng Liang , Yuhan Min

{"title":"Robust support function machines for set-valued data classification","authors":"Zhizheng Liang , Yuhan Min","doi":"10.1016/j.ijar.2024.109281","DOIUrl":"10.1016/j.ijar.2024.109281","url":null,"abstract":"<div><p>Support function machines (SFMs) have been proposed to handle set-valued data, but they are sensitive to outliers and unstable for re-sampling due to the use of the hinge loss function. To address these problems, we propose a robust SFM model with proximity functions. We first define a family of proximity functions that are used to convert set-valued data into continuous functions in a Banach space, and then we use the margin maximization in a Banach space to construct the pinball SFMs (PinSFMs). We study some properties of the proposed model, and it is interesting to observe that the optimal measure of the proposed model has a specific representation under the total variation norm. Using the representation of the optimal measure, we convert an infinite-dimensional optimization problem into a finite-dimensional optimization problem. Unlike SFMs, we employ a sampling strategy to tackle the finite-dimensional optimization problem. We theoretically show that the sparse solution determines the sparsity of the sampling points though the sampling strategy causes uncertainty for the sampling points. In addition, we achieve kernel versions of proximity functions, and the attractive property of this kernelization is that the proposed model is convex even if indefinite kernels are employed. Experiments on a series of data sets are performed to demonstrate that the proposed model is superior to some existing models in the presence of outliers.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"174 ","pages":"Article 109281"},"PeriodicalIF":3.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142122681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0