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

Conformal Predictive Distribution Trees 保形预测分布树

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-06-03 DOI: 10.1007/s10472-023-09847-0

U. Johansson, Tuwe Löfström, Henrik Boström

引用次数: 0

Correction to: Preface 更正:前言

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-05-25 DOI: 10.1007/s10472-023-09870-1

Adel Bouhoula, Bruno Buchberger, Tetsuo Ida, Temur Kutsia

引用次数: 0

Towards a geometry deductive database prover 一个几何演绎数据库证明器

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-05-24 DOI: 10.1007/s10472-023-09839-0

Nuno Baeta, Pedro Quaresma

{"title":"Towards a geometry deductive database prover","authors":"Nuno Baeta, Pedro Quaresma","doi":"10.1007/s10472-023-09839-0","DOIUrl":"10.1007/s10472-023-09839-0","url":null,"abstract":"<div><p>The Geometry Automated-Theorem-Provers (GATP) based on the deductive database method use a data-based search strategy to improve the efficiency of forward chaining. An implementation of such a method is expected to be able to efficiently prove a large set of geometric conjectures, producing readable proofs. The number of conjectures a given implementation can prove will depend on the set of inference rules chosen, the deductive database method is not a decision procedure. Using an approach based in an <i>SQL</i> database library and using an in-memory database, the implementation described in this paper tries to achieve the following goals. Efficiency in the management of the inference rules, the set of already known facts and the new facts discovered, by the use of the efficient data manipulation techniques of the <i>SQL</i> library. Flexibility, by transforming the inference rules in <i>SQL</i> data manipulation language queries, will open the possibility of meta-development of GATP based on a provided set of rules. Natural language and visual renderings, possible by the use of a synthetic forward chaining method. Implemented as an open source library, that will open its use by third-party programs, e.g. the dynamic geometry systems.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 6","pages":"851 - 863"},"PeriodicalIF":1.2,"publicationDate":"2023-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09839-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44899834","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

Logical aspects of multi-agent systems 多代理系统的逻辑方面

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-05-19 DOI: 10.1007/s10472-023-09852-3

Bastien Maubert, Aniello Murano, Sasha Rubin

引用次数: 0

Correction to: Preface: Selected revised papers from the LION 15 conference 更正:前言:选自LION 15会议的修订论文

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-05-17 DOI: 10.1007/s10472-023-09855-0

Ilias S. Kotsireas, Panos M. Pardalos, Dimitris E. Simos

引用次数: 0

A program to create new geometry proof problems 创建新的几何证明问题的程序

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-05-16 DOI: 10.1007/s10472-023-09854-1

Philip Todd, Danny Aley

{"title":"A program to create new geometry proof problems","authors":"Philip Todd, Danny Aley","doi":"10.1007/s10472-023-09854-1","DOIUrl":"10.1007/s10472-023-09854-1","url":null,"abstract":"<div><p>In a previous paper Todd (Submitted to AMAI, 2022), linear systems corresponding to sets of angle bisector conditions are analyzed. In a system which is not full rank, one bisector condition can be derived from the others. In that paper, we describe methods for finding such rank deficient linear systems. The vector angle bisector relationship may be interpreted geometrically in a number of ways: as an angle bisector, as a reflection, as an isosceles triangle, or as a circle chord. A rank deficient linear system may be interpreted as a geometry theorem by mapping each vector angle bisector relationship onto one of these geometrical representations. In Todd (Submitted to AMAI, 2022) we illustrate the step from linear system to geometry theorem with a number of by-hand constructed examples. In this paper, we present an algorithm which automatically generates a geometry theorem from a starting point of a linear system of the type identified in Todd (Submitted to AMAI, 2022). Both statement and diagram of the new theorem are generated by the algorithm. Our implementation creates a simple text description of the new theorem and utilizes the Mathematica GeometricScene to form a diagram.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 6","pages":"779 - 795"},"PeriodicalIF":1.2,"publicationDate":"2023-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49469437","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

Probabilistic causal bipolar abstract argumentation: an approach based on credal networks 概率因果双极抽象论证:基于凭证网络的方法

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-05-16 DOI: 10.1007/s10472-023-09851-4

Mariela Morveli-Espinoza, Juan Carlos Nieves, Cesar Augusto Tacla

{"title":"Probabilistic causal bipolar abstract argumentation: an approach based on credal networks","authors":"Mariela Morveli-Espinoza, Juan Carlos Nieves, Cesar Augusto Tacla","doi":"10.1007/s10472-023-09851-4","DOIUrl":"10.1007/s10472-023-09851-4","url":null,"abstract":"<div><p>The Bipolar Argumentation Framework approach is an extension of the Abstract Argumentation Framework. A Bipolar Argumentation Framework considers a support interaction between arguments, besides the attack interaction. As in the Abstract Argumentation Framework, some researches consider that arguments have a degree of uncertainty, which impacts on the degree of uncertainty of the extensions obtained from a Bipolar Argumentation Framework under a semantics. In these approaches, both the uncertainty of the arguments and of the extensions are modeled by means of precise probability values. However, in many real application domains there is a need for aggregating probability values from different sources so it is not suitable to aggregate such probability values in a unique probability distribution. To tackle this challenge, we use credal networks theory for modelling the uncertainty of the degree of belief of arguments in a BAF. We also propose an algorithm for calculating the degree of uncertainty of the extensions inferred by a given argumentation semantics. Moreover, we introduce the idea of modelling the support relation as a causal relation. We formally show that the introduced approach is sound and complete w.r.t the credal networks theory.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 4","pages":"517 - 536"},"PeriodicalIF":1.2,"publicationDate":"2023-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09851-4.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42108181","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

Automated discovery of angle theorems 自动发现角度定理

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-05-09 DOI: 10.1007/s10472-023-09841-6

Philip Todd

引用次数: 1

Tetrahedral tile pasting systems 四面体瓷砖粘贴系统

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-05-06 DOI: 10.1007/s10472-023-09840-7

T. Kalyani, S. Annadurai, T. T. Raman, D. G. Thomas

引用次数: 0

An algorithmic debugging approach for belief-desire-intention agents 信念-愿望-意图代理的算法调试方法