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

Automation of triangle straightedge-and-compass constructions using automated planning 使用自动规划的三角形直罗经结构的自动化

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-02-19 DOI: 10.1007/s10472-025-09972-y

Milan Banković

{"title":"Automation of triangle straightedge-and-compass constructions using automated planning","authors":"Milan Banković","doi":"10.1007/s10472-025-09972-y","DOIUrl":"10.1007/s10472-025-09972-y","url":null,"abstract":"<div>In this paper, we consider automated solving of triangle straightedge-and-compass construction problems by reducing them to automated planning. We consider the problems from the Wernick’s list, where each problem assumes that locations of three significant points of a triangle are given, and the goal is to construct all three vertices of the triangle. We develop two different models of the corresponding planning problem. In the first model, the planning problem is described using the PDDL language, which is suitable for solving with dedicated automated planners. The second model assumes that the planning problem is first expressed as a finite-domain constraint satisfaction problem, and then encoded in the MiniZinc language. Such model is suitable for solving with constraint solvers. In both cases, we employ existing artificial intelligence tools in search for a solution of our construction problem. The main benefit of using the existing tools for such purpose, instead of developing dedicated tools, is that we can rely on the efficient search that is already implemented within the tool, enabling us to focus on geometric aspects of the problem. We evaluate our approach on 74 solvable problems from the Wernick’s list, and compare it to the dedicated triangle construction solver ArgoTriCS. The results show that our approach tends to be superior to dedicated tools in terms of efficiency, while it requires much less effort to implement. Also, we are often able to find shorter construction plans, thanks to the optimization capabilities offered by the modern planners and constraint solvers. The presented approach is only a search method and does not address proving the correctness of the obtained constructions and discussing when solutions exist, leaving these tasks to other tools. Although the paper focuses on a specific set of construction problems, the approach can be generalized to other classes of problems, which will be explored in future work.</div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 6","pages":"843 - 869"},"PeriodicalIF":1.0,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886810","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

Approximate integrity constraints in incomplete databases with limited domains 有限域不完整数据库的近似完整性约束

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-02-10 DOI: 10.1007/s10472-025-09967-9

Munqath Al-atar, Attila Sali

{"title":"Approximate integrity constraints in incomplete databases with limited domains","authors":"Munqath Al-atar, Attila Sali","doi":"10.1007/s10472-025-09967-9","DOIUrl":"10.1007/s10472-025-09967-9","url":null,"abstract":"<div>A strongly possible constraint is an intermediate concept between possible and certain constraints, based on the strongly possible world approach (a strongly possible world is obtained by replacing NULL’s by a value from the ones appearing in the corresponding attribute of the table). In the present paper, we introduce strongly possible versions of multivalued dependencies and cross joins, and we analyse the complexity of checking the validity of a given strongly possible cross joins. We also study two approximation measures, (g_3) and (g_5), of strongly possible keys (spKeys), functional dependencies (spFDs), multivalued dependencies (spMVDs) and cross joins (spCJs). For spKeys and spFDs, we show that the (g_3) value is always an upper bound of the (g_5) value for a given constraint in a table. However, there are tables of arbitrarily large number of tuples and a constant number of attributes that satisfy (g_3-g_5=frac{p}{q}) for any rational number (0le frac{p}{q}<1). On the other hand, we show that the values of measures (g_3) and (g_5) are independent of each other in the case of spMVDs and spCJs. We prove that checking whether a given strongly possible cross join holds in an incomplete table is NP-complete, in sharp contrast to the fact that checking a given cross join in a complete table is easily seen to be polynomially solvable. We also treat complexity questions of determination of the approximation values, namely we show that both, determining (g_3) and (g_5) for spCJs are NP-complete.</div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 5","pages":"759 - 786"},"PeriodicalIF":1.0,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-025-09967-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145449776","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

35 years of math and AI 35年的数学和人工智能

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-02-10 DOI: 10.1007/s10472-025-09969-7

Martin Charles Golumbic

引用次数: 0

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

引用次数: 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, 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>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.</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>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 schema graph 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 t from a KG. First, we determine the set of triple types stt from the schema graph that are affected by adding a triple t to an RDF store. Finally, the statistics of triple types from the set stt are updated.</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

引用次数: 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 攻击图的正式方法