• Title/Summary/Keyword: inference(reasoning)

Search Result 230, Processing Time 0.029 seconds

Neural Logic Network-Based Fuzzy Inference Network and its Search Strategy (신경논리망 기반의 퍼지추론 네트워크와 탐색 전략)

  • Lee, Heon-Joo;Kim, Jae-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.5
    • /
    • pp.1138-1146
    • /
    • 1996
  • Fuzzy logic ignores some informations in the reasoning process. Neural networks are powerful tools for the pattern processing. However, to model human knowledges, besides pattern processing capability, the logical reasoning capability is equally important. Another new neural network called neural logic network is able to do the logical reasoning. Because the fuzzy logical reasoning, we construct fuzzy inference net-work based on the neural logic network, extending the existing rule-inferencing network. And the traditional propagation rule is modified. For the search strategies to find out the belief value of a conclusion in the fuzzy inference network, we conduct a simulation to evaluate the search cost for searching sequentially and searching by means of priorities.

  • PDF

Study on Inference and Search for Development of Diagnostic Ontology in Oriental Medicine (한의진단 Ontology 구축을 위한 추론과 탐색에 관한 연구)

  • Park, Jong-Hyun
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.23 no.4
    • /
    • pp.745-750
    • /
    • 2009
  • The goal of this study is to examine on reasoning and search for construction of diagnosis ontology as a knowledge base of diagnosis expert system in oriental medicine. Expert system is a field of artificial intelligence. It is a system to acquire information with diverse reasoning methods after putting expert's knowledge in computer systematically. A typical model of expert system consists of knowledge base and reasoning & explanatory structure offering conclusion with the knowledge. To apply ontology as knowledge base to expert system practically, consideration on reasoning and search should be together. Therefore, this study compared and examined reasoning, search with diagnosis process in oriental medicine. Reasoning is divided into Rule-based reasoning and Case-based reasoning. The former is divided into Forward chaining and Backward chaining. Because of characteristics of diagnosis, sometimes Forward chaining or backward chaining are required. Therefore, there are a lot of cases that Hybrid chaining is effective. Case-based reasoning is a method to settle a problem in the present by comparing with the past cases. Therefore, it is suitable to diagnosis fields with abundant cases. Search is sorted into Breadth-first search, Depth-first search and Best-first search, which have respectively merits and demerits. To construct diagnosis ontology to be applied to practical expert system, reasoning and search to reflect diagnosis process and characteristics should be considered.

Scalable Ontology Reasoning Using GPU Cluster Approach (GPU 클러스터 기반 대용량 온톨로지 추론)

  • Hong, JinYung;Jeon, MyungJoong;Park, YoungTack
    • Journal of KIISE
    • /
    • v.43 no.1
    • /
    • pp.61-70
    • /
    • 2016
  • In recent years, there has been a need for techniques for large-scale ontology inference in order to infer new knowledge from existing knowledge at a high speed, and for a diversity of semantic services. With the recent advances in distributed computing, developments of ontology inference engines have mostly been studied based on Hadoop or Spark frameworks on large clusters. Parallel programming techniques using GPGPU, which utilizes many cores when compared with CPU, is also used for ontology inference. In this paper, by combining the advantages of both techniques, we propose a new method for reasoning large RDFS ontology data using a Spark in-memory framework and inferencing distributed data at a high speed using GPGPU. Using GPGPU, ontology reasoning over high-capacity data can be performed as a low cost with higher efficiency over conventional inference methods. In addition, we show that GPGPU can reduce the data workload on each node through the Spark cluster. In order to evaluate our approach, we used LUBM ranging from 10 to 120. Our experimental results showed that our proposed reasoning engine performs 7 times faster than a conventional approach which uses a Spark in-memory inference engine.

Disambiguiation of Qualitative Reasoning with Quantitative Knowledge (정성추론에서의 모호성제거를 위한 양적지식의 활용)

  • Yoon, Wan-Chul
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.18 no.1
    • /
    • pp.81-89
    • /
    • 1992
  • After much research on qualitative reasoning, the problem of ambiguities still hampers the practicality of this important AI tool. In this paper, the sources of ambiguities are examined in depth with a systems engineering point of view and possible directions to disambiguation are suggested. This includes some modeling strategies and an architecture of temporal inference for building unambiguous qualitative models of practical complexity. It is argued that knowledge of multiple levels in abstraction hierarchy must be reflected in the modeling to resolve ambiguities by introducing the designer's decisions. The inference engine must be able to integrate two different types of temporal knowledge representation to determine the partial ordering of future events. As an independent quantity management system that supports the suggested modeling approach, LIQUIDS(Linear Quantity-Information Deriving System) is described. The inference scheme can be conjoined with ordinary rule-based reasoning systems and hence generalized into many different domains.

  • PDF

A Vindication of Induction by Practical Inference (실천추론에 의한 귀납의 정당화)

  • Lee, Byeong-Deok
    • Korean Journal of Logic
    • /
    • v.12 no.2
    • /
    • pp.59-88
    • /
    • 2009
  • According to David Hume, a deductive demonstration for inductive inference is not possible, because inductive inference is not deductive; and an inductive demonstration for inductive inference is not possible either, because such a demonstration is circular. Thus, on his view, there is no way of justifying inductive inference. Ever since Hume raised this problem of induction, a fair number of philosophers have tried to solve it. Nevertheless there is still no solution which is plausible enough to receive wide endorsement. According to Wilfrid Sellars, we cannot justify inductive inference by any theoretical reasoning; we can vindicate it only by a certain sort of practical reasoning. In this paper, I defend this Sellarsian proposal by developing and explaining it.

  • PDF

Mobile Cloud Context-Awareness System based on Jess Inference and Semantic Web RL for Inference Cost Decline (추론 비용 감소를 위한 Jess 추론과 시멘틱 웹 RL기반의 모바일 클라우드 상황인식 시스템)

  • Jung, Se-Hoon;Sim, Chun-Bo
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.1 no.1
    • /
    • pp.19-30
    • /
    • 2012
  • The context aware service is the service to provide useful information to the users by recognizing surroundings around people who receive the service via computer based on computing and communication, and by conducting self-decision. But CAS(Context Awareness System) shows the weak point of small-scale context awareness processing capacity due to restricted mobile function under the current mobile environment, memory space, and inference cost increment. In this paper, we propose a mobile cloud context system with using Google App Engine based on PaaS(Platform as a Service) in order to get context service in various mobile devices without any subordination to any specific platform. Inference design method of the proposed system makes use of knowledge-based framework with semantic inference that is presented by SWRL rule and OWL ontology and Jess with rule-based inference engine. As well as, it is intended to shorten the context service reasoning time with mapping the regular reasoning of SWRL to Jess reasoning engine by connecting the values such as Class, Property and Individual which are regular information in the form of SWRL to Jess reasoning engine via JessTab plug-in in order to overcome the demerit of queries reasoning method of SparQL in semantic search which is a previous reasoning method.

An event-based temporal reasoning method (사건 기반 시간 추론 기법)

  • 이종현;이민석;우영운;박충식;김재희
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.5
    • /
    • pp.93-102
    • /
    • 1997
  • Conventional expert systems have difficulties in the inference on time-varing situations because they don't have the structure for processing time related informations and rule representation method to describe time explicitely. Some expert systems capable of temporal reasoning are not applicable to the domain in which state changes happen by unpredictble events that cannot be represented by periodic changes of data. In this paper, an event based temporal reasoning method is proposed. It is capable of processing te unpredictable events, representing the knowledge related to event and time, and infering by that knowledge as well as infering by periodically time-varing data. The NEO/temporal, an temporal inference engine, is implemented by applying the proposed temporal reasoning situation assessment and decision supporting system is implemented to show the benefits of the proposed temporal information processing model.

  • PDF

INTERPOLATIVE REASONING FOE COMPUTATIONALLY EFFICIENT OPTIMAL FUZZY CONTROL

  • Kacprzyk, Janusz
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1270-1273
    • /
    • 1993
  • Fuzzy optimal control is considered. An optimal sequence of controls is sought best satisfying fuzzy constraints on the controls and fuzzy goals on the states (outputs), with a fuzzy system under control Control over a fixed and specified, implicitly specified, fuzzy, and infinite termination time is discussed. For computational efficiency a small number of reference fuzzy staters and controls is to be assumed by which fuzzy controls and stated are approximated. Optimal control policies reference fuzzy states are determined as a fuzzy relation used, via the compositional rule of inference, to derive an optimal control. Since this requires a large number of overlapping reference fuzzy controls and states implying a low computational efficiency, a small number of nonoverlapping reference fuzzy states and controls is assumed, and then interpolative reasoning is used to infer an optimal fuzzy control for a current fuzzy state.

  • PDF

Inference Mechanisms for Configuration Design Expert System of Machine Tools (공작기계 구조형태계 설계전문가 시스템을 위한 추론 메커니즘)

  • 박지형;강민형;차주헌;박면웅
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.15 no.5
    • /
    • pp.161-166
    • /
    • 1998
  • As a part of the configuration design expert system of machine tools, inference mechanisms are constructed in this paper. In addition to procedural inference, the method of multivariable inference is considered as an efficient approach to deal with the cases of highly coupled condition. We propose a generalized multi-variable inference procedure. The procedure is applied to the type selection module of the configuration design expert system of machine tools in order to demonstrate the efficiency and validity.

  • PDF

Development of a Backward Chaining Inference Methodology Considering Unknown Facts Based on Backtrack Technique (백트래킹 기법을 이용한 불확정성 하에서의 역방향추론 방법에 대한 연구)

  • Song, Yong-Uk;Shin, Hyun-Sik
    • Journal of Information Technology Services
    • /
    • v.9 no.3
    • /
    • pp.123-144
    • /
    • 2010
  • As knowledge becomes a critical success factor of companies nowadays, lots of rule-based systems have been and are being developed to support their activities. Large number of rule-based systems serve as Web sites to advise, or recommend their customers. They usually use a backward chaining inference algorithm based on backtrack to implement those interactive Web-enabled rule-based systems. However, when the users like customers are using these systems interactively, it happens frequently where the users do not know some of the answers for the questions from the rule-based systems. We are going to design a backward chaining inference methodology considering unknown facts based on backtrack technique. Firstly, we review exact and inexact reasoning. After that, we develop a backward chaining inference algorithm for exact reasoning based on backtrack, and then, extend the algorithm so that it can consider unknown facts and reduce its search space. The algorithm speeded-up inference and decreased interaction time with users by eliminating unnecessary questions and answers. We expect that the Web-enabled rule-based systems implemented by our methodology would improve users' satisfaction and make companies' competitiveness.