可信推理的代数规范

IF 0.5 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS Pub Date : 2024-12-16 DOI:10.3103/S0005105524700286

E. A. Efimova

{"title":"可信推理的代数规范","authors":"E. A. Efimova","doi":"10.3103/S0005105524700286","DOIUrl":null,"url":null,"abstract":"<p>An algebraic point of view on the description of abstract data types is applied to JSM reasoning: names of sorts and types of algebraic operations are presented together with equations that can determine their meaning. These equations form a convergent system of term rewriting. The Wolfram language is used for the equation definitions. The algebraic specification could be used both to create an ontology and to program an implementation of plausible reasoning.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"58 5","pages":"364 - 374"},"PeriodicalIF":0.5000,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algebraic Specification of Plausible Reasoning\",\"authors\":\"E. A. Efimova\",\"doi\":\"10.3103/S0005105524700286\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>An algebraic point of view on the description of abstract data types is applied to JSM reasoning: names of sorts and types of algebraic operations are presented together with equations that can determine their meaning. These equations form a convergent system of term rewriting. The Wolfram language is used for the equation definitions. The algebraic specification could be used both to create an ontology and to program an implementation of plausible reasoning.</p>\",\"PeriodicalId\":42995,\"journal\":{\"name\":\"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS\",\"volume\":\"58 5\",\"pages\":\"364 - 374\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.3103/S0005105524700286\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.3103/S0005105524700286","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

抽象数据类型描述的代数观点被应用于 JSM 推理：分类名称和代数运算类型与确定其含义的等式一起呈现。这些等式构成了术语重写的收敛系统。等式定义使用 Wolfram 语言。代数规范既可用于创建本体，也可用于对合理推理的实现进行编程。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Algebraic Specification of Plausible Reasoning

查看原文本刊更多论文

Algebraic Specification of Plausible Reasoning

An algebraic point of view on the description of abstract data types is applied to JSM reasoning: names of sorts and types of algebraic operations are presented together with equations that can determine their meaning. These equations form a convergent system of term rewriting. The Wolfram language is used for the equation definitions. The algebraic specification could be used both to create an ontology and to program an implementation of plausible reasoning.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS COMPUTER SCIENCE, INFORMATION SYSTEMS-

自引率

40.00%

发文量

期刊介绍： Automatic Documentation and Mathematical Linguistics is an international peer reviewed journal that covers all aspects of automation of information processes and systems, as well as algorithms and methods for automatic language analysis. Emphasis is on the practical applications of new technologies and techniques for information analysis and processing.