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

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

Decision with belief functions and generalized independence: Two impossibility theorems1 具有信念函数和广义独立性的决策：两个不可能性定理1

IF 3.2 3区计算机科学

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

Helene Fargier , Romain Guillaume

引用次数: 0

Neighborhood margin rough set: Self-tuning neighborhood threshold 邻域边际粗糙集自调整邻域阈值

IF 3.2 3区计算机科学

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

Mingjie Cai , Haichao Wang , Feng Xu , Qingguo Li

{"title":"Neighborhood margin rough set: Self-tuning neighborhood threshold","authors":"Mingjie Cai , Haichao Wang , Feng Xu , Qingguo Li","doi":"10.1016/j.ijar.2024.109271","DOIUrl":"10.1016/j.ijar.2024.109271","url":null,"abstract":"<div><p>The neighborhood threshold in the neighborhood rough set has a significant impact on the neighborhood relation. When the neighborhood threshold of an object exceeds the critical value, the labels of objects in the neighborhood are not completely consistent, and the critical value of each object often differs. Most existing neighborhood rough set models cannot adaptively regulate the neighborhood threshold. In this paper, we introduce a novel neighborhood rough set model that incorporates a self-tuning mechanism for the neighborhood threshold, taking into account the distribution of objects across different areas. The neighborhood margin is a measure proposed to assess the condition of neighborhoods, and it is calculated by subtracting the neighborhood threshold from the closest distance between heterogeneous elements. The neighborhood margin accurately represents the local state of the neighborhood, taking into account decision information. The margin neighborhood is proposed with a self-tuning the neighborhood threshold. Finally, we introduce the margin neighborhood rough set model and margin neighborhood-based attribute reduction algorithm, and explore the relationship between the proposed model and the neighborhood rough set model. The experiment examines the performance of reducts under various measures, and demonstrates that the neighborhood margin rough set reduces the uncertainty of neighborhood granules effectively, leading to excellent classification performance compared to other neighborhood-based SOTA models.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"174 ","pages":"Article 109271"},"PeriodicalIF":3.2,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142076906","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

Formal and cognitive reasoning 形式推理和认知推理

IF 3.2 3区计算机科学

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

Christoph Beierle , Marco Ragni , Kai Sauerwald , Frieder Stolzenburg , Matthias Thimm

引用次数: 0

Three-way concept lattice from adjunctive positive and negative concepts 来自正反概念的三向概念网格

IF 3.2 3区计算机科学

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

Binghan Long , Tingquan Deng , Yiyu Yao , Weihua Xu

{"title":"Three-way concept lattice from adjunctive positive and negative concepts","authors":"Binghan Long , Tingquan Deng , Yiyu Yao , Weihua Xu","doi":"10.1016/j.ijar.2024.109272","DOIUrl":"10.1016/j.ijar.2024.109272","url":null,"abstract":"<div><p>Three-way concept lattices (TCLs) have been widely explored due to their clear hierarchical structures, concise visual description and good interpretability. In contrast to classic formal contexts, lattice-valued fuzzy contexts exhibit great capability in describing and representing concepts with uncertainty. Different from conventional approaches to research of TCLs, this paper focuses on investigating the algebraic structure and properties of three-way concept lattice (TCL) stemmed from the positive concept lattice and negative concept lattice in a lattice-valued formal context. Several associated concept lattices such as the Cartesian product of positive concept lattice and negative lattice (i.e., pos-neg lattice), lattices induced from the partition of the pos-neg lattice, and their relationship are explored. Specifically, the isomorphism, embedding and order-preserving mappings between them are built. The quotient set of pos-neg lattice when being defined a specific equivalence relation on it is a complete lattice and each equivalence class is a lower semi-lattice. It is further declared that the structure of TCL is intrinsically and determined wholly by the pos-neg lattice. A practical application of the built theory of TCL is provided to sort alternatives in multi-criteria decision making.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"174 ","pages":"Article 109272"},"PeriodicalIF":3.2,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142084199","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