Annals of Mathematics and Artificial Intelligence最新文献_第3页

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-01-24 DOI: 10.1007/s10472-024-09963-5

Maria Andrikopoulou, Theofanis Aravanis, James P. Delgrande, Panagis Karazeris, Pavlos Peppas

{"title":"Filters-based revision","authors":"Maria Andrikopoulou, Theofanis Aravanis, James P. Delgrande, Panagis Karazeris, Pavlos Peppas","doi":"10.1007/s10472-024-09963-5","DOIUrl":"10.1007/s10472-024-09963-5","url":null,"abstract":"<div><p>The AGM paradigm, introduced by Alchourrón, Gärdenfors and Makinson, is a well-established formal framework that identifies the postulates (principles) governing any rational revision operator on belief sets. A central pillar in the study of belief revision is Katsuno and Mendelzon’s representation result, which, based on previous work by Grove, ties together the class of revision operators defined within the AGM paradigm and a special type of total preorder over consistent complete theories (commonly called possible worlds or models). In this article, we lift Katsuno and Mendelzon’s representation result into the realm of the mathematical notion of filters, which are special subsets of partially ordered sets. In particular, we develop a framework for filters revision, by formulating a collection of postulates that constrain the behaviour of revision operators on filters, and establishing a representation result that connects the proposed postulates and a certain type of total preorder over ultrafilters. Overall, we show that AGM-style revision of filters can be obtained with extremely weak assumptions; in fact, significantly weaker than those of the AGM paradigm. This outcome, together with the broad applicability and interdisciplinarity of filters, lends a high level of abstraction to the introduced filters-based framework, which, as we demonstrate, generalizes the AGM paradigm.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 5","pages":"633 - 659"},"PeriodicalIF":1.0,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145449419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Can’t you answer while you wait? 你不能一边等一边回答吗？

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-01-17 DOI: 10.1007/s10472-025-09968-8

Luís Cruz-Filipe, Graça Gaspar, Isabel Nunes

引用次数: 0

Type-based computation of knowledge graph statistics 基于类型的知识图统计计算

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-01-17 DOI: 10.1007/s10472-024-09965-3

Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski, Nikolaus Augsten

{"title":"Type-based computation of knowledge graph statistics","authors":"Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski, Nikolaus Augsten","doi":"10.1007/s10472-024-09965-3","DOIUrl":"10.1007/s10472-024-09965-3","url":null,"abstract":"<div><p>We propose a formal model of a knowledge graph (abbr. KG) that classifies the ground triples into sets that correspond to the triple types. The triple types are partially ordered by the sub-type relation. Consequently, the sets of ground triples that are the interpretations of triple types are partially ordered by the subsumption relation. The types of triple patterns restrict the sets of ground triples, which need to be addressed in the evaluation of triple patterns, to the interpretation of the types of triple patterns. Therefore, a <i>schema graph</i> of a KG should include all triple types that are likely to be determined as the types of triple patterns. The stored schema graph consists of the selected triple types that are stored in a KG and the complete schema graph includes all valid triple types of KG. We propose choosing the schema graph, which consists of the triple types from a strip around the stored schema graph, i.e., the triple types from the stored schema graph and some adjacent levels of triple types with respect to the sub-type relation. Given a selected schema graph, the statistics are updated for each ground triple <i>t</i> from a KG. First, we determine the set of triple types <i>stt</i> from the schema graph that are affected by adding a triple <i>t</i> to an RDF store. Finally, the statistics of triple types from the set <i>stt</i> are updated.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 5","pages":"787 - 815"},"PeriodicalIF":1.0,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-024-09965-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145449594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Guest editorial: Revised selected papers from the LION 16 conference 客座编辑：修订了LION 16会议的部分论文

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-01-06 DOI: 10.1007/s10472-024-09958-2

Ilias S. Kotsireas, Panos M. Pardalos

引用次数: 0

A formal approach to attack graphs 攻击图的正式方法

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-01-02 DOI: 10.1007/s10472-024-09959-1

Davide Catta, Jean Leneutre, Vadim Malvone, Aniello Murano

引用次数: 0

Preface to the special issue on analogies: from mathematical foundations to applications and interactions with ML and AI 关于类比的特刊前言：从数学基础到应用以及与ML和AI的交互

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2024-12-28 DOI: 10.1007/s10472-024-09961-7

Miguel Couceiro, Esteban Marquer, Pierre Monnin, Pierre-Alexandre Murena

引用次数: 0

On automated completion of geometry statements and proofs with GeoGebra Discovery 用GeoGebra Discovery自动完成几何命题和证明

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2024-12-27 DOI: 10.1007/s10472-024-09964-4

Zoltán Kovács, Tomás Recio, M. Pilar Vélez

引用次数: 0

Design of optimal quasi-developable surface via simulated annealing based shape-parameter-search algorithm 基于模拟退火的形状参数搜索算法设计最优拟可展曲面

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2024-12-19 DOI: 10.1007/s10472-024-09962-6

Vahide Bulut

引用次数: 0

On domain generators for the evaluation of action reversibility in STRIPS 条带中动作可逆性评价的域生成器

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2024-11-29 DOI: 10.1007/s10472-024-09960-8

Tobias Schwartz, Jan H. Boockmann, Leon Martin

{"title":"On domain generators for the evaluation of action reversibility in STRIPS","authors":"Tobias Schwartz, Jan H. Boockmann, Leon Martin","doi":"10.1007/s10472-024-09960-8","DOIUrl":"10.1007/s10472-024-09960-8","url":null,"abstract":"<div><p>Robustness is a crucial requirement for the deployment of AI systems in real-world scenarios. In the context of AI planning, the concept of action reversibility, i.e., the ability to undo the effects of an action using a reverse plan, is a promising direction for achieving robust plans. Plans composed exclusively of reversible actions exhibit resilience against goal changes during the execution of the plan. However, the evaluation of action reversibility systems in STRIPS planning presents a challenge, given that standard planning benchmarks are often not suitable. Early experiments using a naive implementation of an action reversibility algorithm show that the available domain generation approach is susceptible to bias. Building on this existing domain generator, we introduce two slight variations that exhibit entirely different search space characteristics. We assess these domain generators using the naive action reversibility implementation and existing ASP implementations, and demonstrate that different generators indeed favor different implementations. As a follow-up to this line of research, we present a generalized domain generator facilitating the creation of domains with diverse search space characteristics. To finally reduce the utilization of contrived generation patterns, we propose another domain generator based on the Barabási-Albert model yielding less rigid domains. Our experiments demonstrate that these new domain generators can produce a variety of domains with diverse search space characteristics, enabling a less biased evaluation of action reversibility systems.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 5","pages":"699 - 726"},"PeriodicalIF":1.0,"publicationDate":"2024-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-024-09960-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145449727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A multi-algorithm pathfinding method: Exploiting performance variations for enhanced efficiency 一种多算法寻路方法：利用性能变化来提高效率

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2024-11-14 DOI: 10.1007/s10472-024-09957-3

Aya Kherrour, Marco Robol, Marco Roveri, Paolo Giorgini

{"title":"A multi-algorithm pathfinding method: Exploiting performance variations for enhanced efficiency","authors":"Aya Kherrour, Marco Robol, Marco Roveri, Paolo Giorgini","doi":"10.1007/s10472-024-09957-3","DOIUrl":"10.1007/s10472-024-09957-3","url":null,"abstract":"<div><p>This paper presents a performance evaluation of several heuristic search algorithms in the context of pathfinding. Our objective is to assess the performance of these algorithms in various grid-based environments to present how specific domain features influence their efficiency. Additionally, we extend our experiments by incorporating Multi-Agent Path Finding (MAPF) benchmarks, using handcrafted features and features extracted with Convolutional Neural Network (CNN) to characterize the maps. The results of our evaluation were later used to train machine learning models capable of predicting the efficient algorithm for a given pathfinding task based on performance criteria. This multi-algorithm pathfinding method enhances the selection of the best algorithm for different pathfinding problems. Furthermore, we revealed the most important features that impact the selection of the efficient algorithm. We identify the most important characteristics of the grid that affect the selection and performance of the algorithms.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 4","pages":"569 - 588"},"PeriodicalIF":1.0,"publicationDate":"2024-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-024-09957-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145164952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0