A METHOD FOR IMPROVING REASONING AND REALIZATION PROBLEM SOLVING IN DESCRIPTIVE LOGIC- BASED AND ONTOLOGY-BASED REASONERS

IF 1.1 4区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Malaysian Journal of Computer Science Pub Date : 2022-01-31 DOI:10.22452/mjcs.vol35no1.3

Mojtaba Shokohinia, A. Dideban, F. Yaghmaee

{"title":"A METHOD FOR IMPROVING REASONING AND REALIZATION PROBLEM SOLVING IN DESCRIPTIVE LOGIC- BASED AND ONTOLOGY-BASED REASONERS","authors":"Mojtaba Shokohinia, A. Dideban, F. Yaghmaee","doi":"10.22452/mjcs.vol35no1.3","DOIUrl":null,"url":null,"abstract":"Recently, many methods have been developed for representing knowledge, reasoning, and result extraction extracting results based on the respective domain knowledge in question. Despite the ontological success in knowledge representation, the reasoning method has faces some challenges. The main challenge in ontology reasoning methods is the failure in solving realization problems in the reasoning process. Apart from the complexity of solving realization problems, this already daunting challenge is compounded by computational complexity the time complexity of the solving realization problem solving process problems is equal to that of NEXP TIME. This important issue problem is achieved solved by solving the subsumption and satisfiability problems. Thus, to solve the realization problem, we first partition the ontology or extract partitions related to the query. Then, the satisfiability problem is solved by extracting partitions, and all concepts related to the query are extracted. This study proposes a method to overcome this problem, where a new solution is proposed with an appropriate time position. Finally, the efficiency of the proposed method, is evaluated against other reasoning engines, and the results show optimized performance vis-a-vis previous studies.","PeriodicalId":49894,"journal":{"name":"Malaysian Journal of Computer Science","volume":" ","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Malaysian Journal of Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.22452/mjcs.vol35no1.3","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}

引用次数: 1

Abstract

Recently, many methods have been developed for representing knowledge, reasoning, and result extraction extracting results based on the respective domain knowledge in question. Despite the ontological success in knowledge representation, the reasoning method has faces some challenges. The main challenge in ontology reasoning methods is the failure in solving realization problems in the reasoning process. Apart from the complexity of solving realization problems, this already daunting challenge is compounded by computational complexity the time complexity of the solving realization problem solving process problems is equal to that of NEXP TIME. This important issue problem is achieved solved by solving the subsumption and satisfiability problems. Thus, to solve the realization problem, we first partition the ontology or extract partitions related to the query. Then, the satisfiability problem is solved by extracting partitions, and all concepts related to the query are extracted. This study proposes a method to overcome this problem, where a new solution is proposed with an appropriate time position. Finally, the efficiency of the proposed method, is evaluated against other reasoning engines, and the results show optimized performance vis-a-vis previous studies.

查看原文本刊更多论文

一种改进基于描述逻辑和基于本体推理器推理和实现问题解决的方法

最近，已经开发了许多方法来表示知识、推理和基于所讨论的各个领域知识的结果提取提取结果。尽管本体论在知识表示方面取得了成功，但推理方法仍面临一些挑战。本体推理方法的主要挑战是在推理过程中未能解决实现问题。除了解决实现问题的复杂性外，这一本已艰巨的挑战还因计算复杂性而加剧——解决实现问题解决过程问题的时间复杂性与NEXP time的时间复杂性相等。这个重要的问题是通过求解包含性和可满足性问题来实现的。因此，为了解决实现问题，我们首先对本体进行分区或提取与查询相关的分区。然后，通过提取分区来解决可满足性问题，并提取与查询相关的所有概念。这项研究提出了一种克服这个问题的方法，其中提出了一个具有适当时间位置的新解决方案。最后，将所提出的方法与其他推理引擎进行了比较，结果表明，与以前的研究相比，该方法的性能得到了优化。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Malaysian Journal of Computer Science COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, THEORY & METHODS

CiteScore

2.20

自引率

33.30%

发文量

审稿时长

7.5 months

期刊介绍： The Malaysian Journal of Computer Science (ISSN 0127-9084) is published four times a year in January, April, July and October by the Faculty of Computer Science and Information Technology, University of Malaya, since 1985. Over the years, the journal has gained popularity and the number of paper submissions has increased steadily. The rigorous reviews from the referees have helped in ensuring that the high standard of the journal is maintained. The objectives are to promote exchange of information and knowledge in research work, new inventions/developments of Computer Science and on the use of Information Technology towards the structuring of an information-rich society and to assist the academic staff from local and foreign universities, business and industrial sectors, government departments and academic institutions on publishing research results and studies in Computer Science and Information Technology through a scholarly publication. The journal is being indexed and abstracted by Clarivate Analytics'' Web of Science and Elsevier''s Scopus