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

Annals of Mathematics and Artificial Intelligence最新文献

筛选
英文 中文
Automated generation of illustrated proofs in geometry and beyond 自动生成几何及其他领域的图解证明
IF 1.2 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-03 DOI: 10.1007/s10472-023-09857-y
Predrag Janičić, Julien Narboux
{"title":"Automated generation of illustrated proofs in geometry and beyond","authors":"Predrag Janičić,&nbsp;Julien Narboux","doi":"10.1007/s10472-023-09857-y","DOIUrl":"10.1007/s10472-023-09857-y","url":null,"abstract":"<div><p>Illustrations are only rarely formal components of mathematical proofs, however they are often very important for understanding proofs. Illustrations are almost unavoidable in geometry, and in many other fields illustrations are helpful for carrying ideas in a more suitable way than via words or formulas. The question is: if we want to automate theorem proving, can we automate creation of corresponding illustrations too? We report on a new, generic, simple, and flexible approach for automated generation of illustrated proofs. The proofs are generated using Larus, an automated prover for coherent logic, and corresponding illustrations are generated in the GCLC language. Animated illustrations are also supported.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 6","pages":"797 - 820"},"PeriodicalIF":1.2,"publicationDate":"2023-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49093940","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
Search algorithms for automated negotiation in large domains 大型领域自动协商的搜索算法
IF 1.2 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-02 DOI: 10.1007/s10472-023-09859-w
Thimjo Koça, Dave de Jonge, Tim Baarslag
{"title":"Search algorithms for automated negotiation in large domains","authors":"Thimjo Koça,&nbsp;Dave de Jonge,&nbsp;Tim Baarslag","doi":"10.1007/s10472-023-09859-w","DOIUrl":"10.1007/s10472-023-09859-w","url":null,"abstract":"<div><p>This work presents several new and efficient algorithms that can be used by negotiating agents to explore very large outcome spaces. The proposed algorithms can search for bids close to a utility target or above a utility threshold, and for win-win outcomes. While doing so, these algorithms strike a careful balance between being rapid, accurate, diverse, and scalable, allowing agents to explore spaces with as many as <span>(10^{250})</span> possible outcomes on very run-of-the-mill hardware. We show that our methods can be used to respond to the most common search queries employed by <span>(87%)</span> of all agents from the Automated Negotiating Agents Competition between 2010 and 2021. Furthermore, we integrate our techniques into negotiation platform GeniusWeb in order to enable existing state-of-the-art agents (and future agents) to handle very large outcome spaces.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 4","pages":"903 - 924"},"PeriodicalIF":1.2,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43853476","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
Single MCMC chain parallelisation on decision trees 决策树上的单MCMC链并行化
IF 1.2 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-02 DOI: 10.1007/s10472-023-09876-9
Efthyvoulos Drousiotis, Paul Spirakis
{"title":"Single MCMC chain parallelisation on decision trees","authors":"Efthyvoulos Drousiotis, Paul Spirakis","doi":"10.1007/s10472-023-09876-9","DOIUrl":"https://doi.org/10.1007/s10472-023-09876-9","url":null,"abstract":"<p>Decision trees (DT) are highly famous in machine learning and usually acquire state-of-the-art performance. Despite that, well-known variants like CART, ID3, random forest, and boosted trees miss a probabilistic version that encodes prior assumptions about tree structures and shares statistical strength between node parameters. Existing work on Bayesian DT depends on Markov Chain Monte Carlo (MCMC), which can be computationally slow, especially on high dimensional data and expensive proposals. In this study, we propose a method to parallelise a single MCMC DT chain on an average laptop or personal computer that enables us to reduce its run-time through multi-core processing while the results are statistically identical to conventional sequential implementation. We also calculate the theoretical and practical reduction in run time, which can be obtained utilising our method on multi-processor architectures. Experiments showed that we could achieve 18 times faster running time provided that the serial and the parallel implementation are statistically identical.</p>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"84 2","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138520482","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 Novel Method for Solving Universum Twin Bounded Support Vector Machine in the Primal Space 一种求解原始空间中普遍双界支持向量机的新方法
IF 1.2 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-01 DOI: 10.1007/s10472-023-09871-0
H. Moosaei, Saeed Khosravi, F. Bazikar, M. Hladík, Mario Rosario Guarracino
{"title":"A Novel Method for Solving Universum Twin Bounded Support Vector Machine in the Primal Space","authors":"H. Moosaei, Saeed Khosravi, F. Bazikar, M. Hladík, Mario Rosario Guarracino","doi":"10.1007/s10472-023-09871-0","DOIUrl":"https://doi.org/10.1007/s10472-023-09871-0","url":null,"abstract":"","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":" ","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42604435","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 hybrid simulated annealing and variable neighborhood search algorithm for the close-open electric vehicle routing problem 一种求解闭-开电动车路径问题的混合模拟退火和变邻域搜索算法
IF 1.2 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2023-06-18 DOI: 10.1007/s10472-023-09858-x
Themistoklis Stamadianos, N. Kyriakakis, M. Marinaki, Y. Marinakis
{"title":"A hybrid simulated annealing and variable neighborhood search algorithm for the close-open electric vehicle routing problem","authors":"Themistoklis Stamadianos, N. Kyriakakis, M. Marinaki, Y. Marinakis","doi":"10.1007/s10472-023-09858-x","DOIUrl":"https://doi.org/10.1007/s10472-023-09858-x","url":null,"abstract":"","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":" ","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48225944","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
Lattice point of view for argumentation framework 格点观点的论证框架
IF 1.2 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2023-06-17 DOI: 10.1007/s10472-023-09873-y
Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef
{"title":"Lattice point of view for argumentation framework","authors":"Mohammed Elaroussi,&nbsp;Lhouari Nourine,&nbsp;Mohammed Said Radjef","doi":"10.1007/s10472-023-09873-y","DOIUrl":"10.1007/s10472-023-09873-y","url":null,"abstract":"<div><p>The main purpose of this article is to develop a lattice point of view for the study of argumentation framework extensions. We first characterize self-defending sets of an argumentation framework by the closed sets of an implicational system that can be computed in polynomial time from the argumentation framework. On the other hand, for any implicational system <span>(Sigma )</span> over the set of arguments, we associate an argumentation framework whose admissible sets are in bijection with closed sets of <span>(Sigma )</span>. Second, we propose conflict-closed sets reduction rules, based on implicational system, to find out minimal subsets of vertex cover closed while maintaining all potential admissible extensions as well as preferred extensions. This leads to a polynomial delay and space algorithm to enumerate admissible sets of argumentation frameworks without even cycles. Finally, based on the implicational system, a new decomposition of the argumentation framework is defined and leads to a polynomial delay and space algorithm to enumerate admissible sets for a bipartite argumentation framework. The proposed algorithm improves the exponential space complexity of previous algorithms.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 5","pages":"691 - 711"},"PeriodicalIF":1.2,"publicationDate":"2023-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43172549","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}
引用次数: 4
Automated triangle constructions in hyperbolic geometry 双曲几何中的自动三角形构造
IF 1.2 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2023-06-12 DOI: 10.1007/s10472-023-09850-5
Vesna Marinković, Tijana Šukilović, Filip Marić
{"title":"Automated triangle constructions in hyperbolic geometry","authors":"Vesna Marinković,&nbsp;Tijana Šukilović,&nbsp;Filip Marić","doi":"10.1007/s10472-023-09850-5","DOIUrl":"10.1007/s10472-023-09850-5","url":null,"abstract":"<div><p>We describe a system for automated ruler and compass triangle constructions in hyperbolic geometry. We discuss key differences between constructions in Euclidean and hyperbolic setting, compile a list of primitive constructions and lemmas used for constructions in hyperbolic geometry, build an automated system for solving construction problems, and test it on a corpus of triangle-construction problems. We extend the list of primitive constructions for hyperbolic geometry by several constructions that cannot be done by ruler and compass, but can be done by using algebraic calculations and show that such extended system solves more problems. We also use a dynamic geometry library to build an online compendium containing construction descriptions, illustrations, and step-by-step animations.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 6","pages":"821 - 849"},"PeriodicalIF":1.2,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47611316","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 Bayesian reinforcement learning approach in markov games for computing near-optimal policies 计算近似最优策略的马尔可夫对策中的贝叶斯强化学习方法
IF 1.2 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2023-06-10 DOI: 10.1007/s10472-023-09860-3
Julio B. Clempner
{"title":"A Bayesian reinforcement learning approach in markov games for computing near-optimal policies","authors":"Julio B. Clempner","doi":"10.1007/s10472-023-09860-3","DOIUrl":"10.1007/s10472-023-09860-3","url":null,"abstract":"<div><p>Bayesian Learning is an inference method designed to tackle exploration-exploitation trade-off as a function of the uncertainty of a given probability model from observations within the Reinforcement Learning (RL) paradigm. It allows the incorporation of prior knowledge, as probabilistic distributions, into the algorithms. Finding the resulting Bayes-optimal policies is notorious problem. We focus our attention on RL of a special kind of ergodic and controllable Markov games. We propose a new framework for computing the near-optimal policies for each agent, where it is assumed that the Markov chains are regular and the inverse of the behavior strategy is well defined. A fundamental result of this paper is the development of a theoretical method that, based on the formulation of a non-linear problem, computes the near-optimal adaptive-behavior strategies and policies of the game under some restrictions that maximize the expected reward. We prove that such behavior strategies and the policies satisfy the Bayesian-Nash equilibrium. Another important result is that the RL process learn a model through the interaction of the agents with the environment, and shows how the proposed method can finitely approximate and estimate the elements of the transition matrices and utilities maintaining an efficient long-term learning performance measure. We develop the algorithm for implementing this model. A numerical empirical example shows how to deploy the estimation process as a function of agent experiences.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 5","pages":"675 - 690"},"PeriodicalIF":1.2,"publicationDate":"2023-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09860-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48089164","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
Quantifying the relationship between software design principles and performance in Jason: a case study with simulated mobile robots 在Jason中量化软件设计原则和性能之间的关系:模拟移动机器人的案例研究
IF 1.2 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2023-06-08 DOI: 10.1007/s10472-023-09844-3
Patrick Gavigan, Babak Esfandiari
{"title":"Quantifying the relationship between software design principles and performance in Jason: a case study with simulated mobile robots","authors":"Patrick Gavigan,&nbsp;Babak Esfandiari","doi":"10.1007/s10472-023-09844-3","DOIUrl":"10.1007/s10472-023-09844-3","url":null,"abstract":"<div><p>We investigated the relationship between various design approaches of AgentSpeak code for Jason Beliefs-Desires-Intentions (BDI) agents and their performance in a simulated automotive collision avoidance scenario. Also explored was how the approaches affected software maintainability, assessed through coupling, cohesion, and cyclomatic complexity. We then compared each agent’s performance, specifically their reasoning cycle duration and their responsiveness. Our findings revealed that agents with looser coupling and higher cohesion are more responsive to stimuli, implying that more maintainable AgentSpeak code can result in better performing agents. Performance was inversely related to cyclomatic complexity.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 4","pages":"775 - 795"},"PeriodicalIF":1.2,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43008486","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
Anomaly detection with superexperts under delayed feedback 基于延迟反馈的超专家异常检测
IF 1.2 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2023-06-05 DOI: 10.1007/s10472-023-09845-2
Raisa Dzhamtyrova, C. Maple
{"title":"Anomaly detection with superexperts under delayed feedback","authors":"Raisa Dzhamtyrova, C. Maple","doi":"10.1007/s10472-023-09845-2","DOIUrl":"https://doi.org/10.1007/s10472-023-09845-2","url":null,"abstract":"","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":" ","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45708381","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学术文献互助群
群 号：481959085
Book学术官方微信