发布求助
文献互助 智能选刊 最新文献

Annals of Mathematics and Artificial Intelligence最新文献

筛选
英文 中文
The future starts now 未来从现在开始
IF 1.2 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2025-02-05 DOI: 10.1007/s10472-025-09970-0
Jürgen Dix, Michael Fisher
{"title":"The future starts now","authors":"Jürgen Dix, Michael Fisher","doi":"10.1007/s10472-025-09970-0","DOIUrl":"10.1007/s10472-025-09970-0","url":null,"abstract":"","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 1","pages":"5 - 6"},"PeriodicalIF":1.2,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-025-09970-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143716627","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
Filters-based revision Filters-based修订
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,&nbsp;Theofanis Aravanis,&nbsp;James P. Delgrande,&nbsp;Panagis Karazeris,&nbsp;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
{"title":"Can’t you answer while you wait?","authors":"Luís Cruz-Filipe,&nbsp;Graça Gaspar,&nbsp;Isabel Nunes","doi":"10.1007/s10472-025-09968-8","DOIUrl":"10.1007/s10472-025-09968-8","url":null,"abstract":"<div><p>Many modern-day systems rely on information that is constantly arriving, and they need to make decisions based on it – a problem known as <i>continuous query answering</i>. In many situations, these systems can benefit from identifying possible outcomes that are consistent with the data available so far. Such scenarios are called <i>hypothetical answers</i>, and previous work has defined them precisely and shown how they can be updated in step with the arrival of additional input. Most existing formalisms assume that data always arrives instantaneously, which is not realistic. In this work, we relax this problem by allowing data to arrive later, and potentially out of order. By revisiting the underlying intuitions in previous work, we develop a more general framework that supports communication delays. The interaction between communication delays and negation poses some challenging problems, which we address using fixpoint theory. We show that the relevant fixpoints can be computed in finite time by a carefully designed algorithm.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 5","pages":"727 - 758"},"PeriodicalIF":1.0,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-025-09968-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145449595","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
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,&nbsp;Kiyoshi Nitta,&nbsp;Riste Skrekovski,&nbsp;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
Energy disaggregation via Bayesian non-negative matrix factorization with sum-to-k constraint 基于sum-to-k约束的贝叶斯非负矩阵分解能量分解
IF 1.6 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2025-01-16 DOI: 10.1007/s10472-025-09966-w
Oumayma Dalhoumi, Manar Amayri, Nizar Bouguila
{"title":"Energy disaggregation via Bayesian non-negative matrix factorization with sum-to-k constraint","authors":"Oumayma Dalhoumi,&nbsp;Manar Amayri,&nbsp;Nizar Bouguila","doi":"10.1007/s10472-025-09966-w","DOIUrl":"10.1007/s10472-025-09966-w","url":null,"abstract":"<div><p>Non-Intrusive Load Monitoring (NILM), also referred to as energy disaggregation, is the task of estimating a device level energy consumption using the aggregated energy consumption of different devices at one single measurement point without installing meters on each individual device. NILM can be formulated as a source separation problem where the aggregated signal is expressed as linear combination of basis vectors in a matrix factorization framework. In this paper, we propose a novel Bayesian Non Negative Matrix Factorization for energy disaggregation. The model achieves superior performance by imposing sparcity on the activation matrix using Dirichlet priors. To estimate the parameters of the model, variational Bayesian inference is used. A lower bound approximation for the objective function is used to find an analytically tractable solution for the model. We evaluate the model and show its merits with three data sets: REDD, AMPds and IRISE, and with multiple experimental setups.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 3","pages":"329 - 344"},"PeriodicalIF":1.6,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148613043","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
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
{"title":"Guest editorial: Revised selected papers from the LION 16 conference","authors":"Ilias S. Kotsireas,&nbsp;Panos M. Pardalos","doi":"10.1007/s10472-024-09958-2","DOIUrl":"10.1007/s10472-024-09958-2","url":null,"abstract":"","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 1","pages":"19 - 20"},"PeriodicalIF":1.2,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143716634","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
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
{"title":"A formal approach to attack graphs","authors":"Davide Catta,&nbsp;Jean Leneutre,&nbsp;Vadim Malvone,&nbsp;Aniello Murano","doi":"10.1007/s10472-024-09959-1","DOIUrl":"10.1007/s10472-024-09959-1","url":null,"abstract":"<div><p>An attack graph is a concise portrayal of the various paths within an open system that enable an attacker to reach a prohibited state (such as gaining access to a restricted resource), despite the system’s preventive measures. The assessment of system vulnerability involves examining the presence of such paths. In this work, we analyze attack graphs using a game-theoretic approach. Specifically, we introduce a well-suited game model that represents the dynamics between the system and the attacker, and propose an automata-based solution to demonstrate the absence of vulnerability.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 4","pages":"589 - 610"},"PeriodicalIF":1.0,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145161074","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
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
{"title":"Preface to the special issue on analogies: from mathematical foundations to applications and interactions with ML and AI","authors":"Miguel Couceiro,&nbsp;Esteban Marquer,&nbsp;Pierre Monnin,&nbsp;Pierre-Alexandre Murena","doi":"10.1007/s10472-024-09961-7","DOIUrl":"10.1007/s10472-024-09961-7","url":null,"abstract":"","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 2","pages":"233 - 235"},"PeriodicalIF":1.0,"publicationDate":"2024-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145141849","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
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
{"title":"On automated completion of geometry statements and proofs with GeoGebra Discovery","authors":"Zoltán Kovács,&nbsp;Tomás Recio,&nbsp;M. Pilar Vélez","doi":"10.1007/s10472-024-09964-4","DOIUrl":"10.1007/s10472-024-09964-4","url":null,"abstract":"<div><p>At the ADG 2023 a protocol, implemented on an extension of Larus automated theorem prover, to automatically complete statements and proofs in Euclidean geometry, was presented by S. T. Gonzalez, P. Janičić, and J. Narboux. The approach is logic-based, in contrast to algebraic methods, and its performance was tested on five high-school level geometry problems. In our contribution we address the same five issues with the automated reasoning, algebraic-based, tools of GeoGebra Discovery. The results allow us to reflect on the pros and cons of these two diverse approaches, showing, in particular, the opportunities that GeoGebra Discovery brings to improve human reasoning in geometry.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 6","pages":"995 - 1009"},"PeriodicalIF":1.0,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886979","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
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
{"title":"Design of optimal quasi-developable surface via simulated annealing based shape-parameter-search algorithm","authors":"Vahide Bulut","doi":"10.1007/s10472-024-09962-6","DOIUrl":"10.1007/s10472-024-09962-6","url":null,"abstract":"<div><p>In this paper, a novel method is presented to increase the developability of the quasi-developable Bézier surface from two design curves using the Simulated Annealing-based Shape Parameter Search (SASPS) algorithm based on the shape parameters of the cubic Bézier design curves. In addition, another new method for determining the number of sampling points is given to increase the developability degree. It allows perturbing the design curves within the limits allowed by the user based on the shape parameters. We also defined a multi-objective function for the optimal quasi-developable Bézier surface. Example models show that the proposed method is efficient and effective in achieving optimal developability.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 5","pages":"611 - 631"},"PeriodicalIF":1.0,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145449625","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书