• Asia pacific journal of information systems
• /
• v.13 no.1
• /
• pp.213-230
• /
• 2003

Most of existing expert systems developed for Web use CGI-based techniques and this frequently makes them suffer from the overburden of commercial Web servers, which deal with large-scale services. However, since HTML-based inference technique represents expert's knowledge by hyperlinks among HTML documents, the hypertext function of the Web can perform the inference efficiently in terms of time and space without the help of additional inference engines. In spite of such benefits, when the expert's knowledge is relatively large and/or complicated, the HTML-based inference technique has usually become to have a hard time of dealing with a lot of HTML documents because generation and management tasks of the numerous HTML documents would cause big trouble to the knowledge engineer. To resolve this problem, we developed an automatic generation and management tool for Web-based inference sites, called WeBIS. With this tool, a knowledge engineer can input and edit expert's knowledge using Expert's Diagram on the GUI(Graphical User Interface) environment and automatically generate hyper-linked HTML documents for Web-based inference from the Expert's Diagram.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.675-677
• /
• 1998

In this paper, we propose the fuzzy inference algorithm with multi-layer structure. MFIS(Multi-layer Fuzzy Inference System) uses PNN(Polynomial Neural networks) structure and the fuzzy inference method. The PNN is the extended structure of the GMDH(Group Method of Data Hendling), and uses several types of polynomials such as linear, quadratic and cubic, as well as the biquadratic polynomial used in the GMDH. In the fuzzy inference method, the simplified and regression polynomial inference methods are used. Here, the regression polynomial inference is based on consequence of fuzzy rules with the polynomial equations such as linear, quadratic and cubic equation. Each node of the MFIS is defined as fuzzy rules and its structure is a kind of neuro-fuzzy structure. We use the training and testing data set to obtain a balance between the approximation and the generalization of process model. Several numerical examples are used to evaluate the performance of the our proposed model.

• Cross-Cultural Studies
• /
• v.22
• /
• pp.355-375
• /
• 2011

This paper investigates multiple marking of evidentials in Korean. Korean has 4 evidential markers: Present Sensory -ney, Past Sensory -te-, Inference -keyss-, Reported -ay. Korean allows evidential marked more than once in the same clause. Not all the possible combinations of evidential markers are, however, observed in Korean. Only five combinations of evidential markers are allowed: Inference followed by Past Sensory (-keysste-), Inference followed by Present Sensory (-keyssney), Past Sensory followed by Reported (-teray), Inference followed by Reported (-keysstay), Inference followed by Past Sensory and Reported (-keyssteray). Multiple making of evidentials in Korean seems to follow combination restrictions: i) Inference comes before Direct Knowledge, ii) Present Sensory and Reported cannot be marked in the same clause, iii) Reported must come after other evidential markers, iv) Past Sensory and Present Sensory cannot be marked in the same clause. Because of these restrictions, only 5 out of dozens possible multiple evidential marking combinations are observed in Korean. This paper takes inflectional suffixes including evidential markers in Korean as syntatic markers and argues that syntactic markers have their own scope and contribute semantic meaning to the scope not to the full sentence. Evidential markers in double marking have different syntactic scope and add not contradictory but complementary meanings to the preposition to express subtle and delicate evidential-related meanings.

• Journal of The Korean Association For Science Education
• /
• v.28 no.3
• /
• pp.197-210
• /
• 2008

The purpose of this study is to explore the cases and features of the abductive inference used by young children when trying to explain natural phenomena in everyday life. From observing a 5-year-old's daily activities with his family, and analyzing the data according to the criterion extracted from the form of abductive inference described by C. S. Peirce, a few cases where the child used abductive inferences to explain natural phenomena were found. The abductive inferences in the cases were conducted: (a) based on figural resemblance and behavioral resemblance (b) under the influence by individual belief and communal belief, then (c) resulted in new categorization accompanied by over generalization. Such features of the abductive inference showed the 'double faces'; sometimes encourages and sometimes discourages children's generating better scientific hypotheses and explanations. These results suggest that even young children use abductive inference to explain doubtful natural phenomena in everyday life, although we need to consider carefully with the double aspects of the features of abductive inference for the practical applications to the fields of science education. Finally, several suggestions and following studies for science education are proposed.

• Journal of The Korean Association For Science Education
• /
• v.28 no.8
• /
• pp.786-795
• /
• 2008

The purpose of this research is to propose a program for teaching and learning effective problem-solving for gifted students based on abductive inference. The role of abductive inference is important for scientific discoveries and creative inferences in problem-solving processes. The characteristics of creativity and abductive inference were investigated, and the following were discussed: (a) a suggestion for a new program based on abductive inference for creative outcomes, this program largely consists of two phases: generative hypotheses and confirmative hypotheses, (b) a survey of the validity of a program. It is typical that hypotheses are confirmed in phases through experiments based on hypothetic deductive methodology. However, because generative hypotheses of this hypothetic deductive methodology are not manifest, we maintained that abductive inference strategies must be used in a Creative Teaching-learning Program for gifted science students.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.975-976
• /
• 1993

This talk presents the overview of the author's research and development activities on fuzzy inference hardware. We involved it with two distinct approaches. The first approach is to use application specific integrated circuits (ASIC) technology. The fuzzy inference method is directly implemented in silicon. The second approach, which is in its preliminary stage, is to use more conventional microprocessor architecture. Here, we use a quantitative technique used by designer of reduced instruction set computer (RISC) to modify an architecture of a microprocessor. In the ASIC approach, we implemented the most widely used fuzzy inference mechanism directly on silicon. The mechanism is beaded on a max-min compositional rule of inference, and Mandami's method of fuzzy implication. The two VLSI fuzzy inference chips are designed, fabricated, and fully tested. Both used a full-custom CMOS technology. The second and more claborate chip was designed at the University of North Carolina(U C) in cooperation with MCNC. Both VLSI chips had muliple datapaths for rule digital fuzzy inference chips had multiple datapaths for rule evaluation, and they executed multiple fuzzy if-then rules in parallel. The AT & T chip is the first digital fuzzy inference chip in the world. It ran with a 20 MHz clock cycle and achieved an approximately 80.000 Fuzzy Logical inferences Per Second (FLIPS). It stored and executed 16 fuzzy if-then rules. Since it was designed as a proof of concept prototype chip, it had minimal amount of peripheral logic for system integration. UNC/MCNC chip consists of 688,131 transistors of which 476,160 are used for RAM memory. It ran with a 10 MHz clock cycle. The chip has a 3-staged pipeline and initiates a computation of new inference every 64 cycle. This chip achieved an approximately 160,000 FLIPS. The new architecture have the following important improvements from the AT & T chip: Programmable rule set memory (RAM). On-chip fuzzification operation by a table lookup method. On-chip defuzzification operation by a centroid method. Reconfigurable architecture for processing two rule formats. RAM/datapath redundancy for higher yield It can store and execute 51 if-then rule of the following format: IF A and B and C and D Then Do E, and Then Do F. With this format, the chip takes four inputs and produces two outputs. By software reconfiguration, it can store and execute 102 if-then rules of the following simpler format using the same datapath: IF A and B Then Do E. With this format the chip takes two inputs and produces one outputs. We have built two VME-bus board systems based on this chip for Oak Ridge National Laboratory (ORNL). The board is now installed in a robot at ORNL. Researchers uses this board for experiment in autonomous robot navigation. The Fuzzy Logic system board places the Fuzzy chip into a VMEbus environment. High level C language functions hide the operational details of the board from the applications programme . The programmer treats rule memories and fuzzification function memories as local structures passed as parameters to the C functions. ASIC fuzzy inference hardware is extremely fast, but they are limited in generality. Many aspects of the design are limited or fixed. We have proposed to designing a are limited or fixed. We have proposed to designing a fuzzy information processor as an application specific processor using a quantitative approach. The quantitative approach was developed by RISC designers. In effect, we are interested in evaluating the effectiveness of a specialized RISC processor for fuzzy information processing. As the first step, we measured the possible speed-up of a fuzzy inference program based on if-then rules by an introduction of specialized instructions, i.e., min and max instructions. The minimum and maximum operations are heavily used in fuzzy logic applications as fuzzy intersection and union. We performed measurements using a MIPS R3000 as a base micropro essor. The initial result is encouraging. We can achieve as high as a 2.5 increase in inference speed if the R3000 had min and max instructions. Also, they are useful for speeding up other fuzzy operations such as bounded product and bounded sum. The embedded processor's main task is to control some device or process. It usually runs a single or a embedded processer to create an embedded processor for fuzzy control is very effective. Table I shows the measured speed of the inference by a MIPS R3000 microprocessor, a fictitious MIPS R3000 microprocessor with min and max instructions, and a UNC/MCNC ASIC fuzzy inference chip. The software that used on microprocessors is a simulator of the ASIC chip. The first row is the computation time in seconds of 6000 inferences using 51 rules where each fuzzy set is represented by an array of 64 elements. The second row is the time required to perform a single inference. The last row is the fuzzy logical inferences per second (FLIPS) measured for ach device. There is a large gap in run time between the ASIC and software approaches even if we resort to a specialized fuzzy microprocessor. As for design time and cost, these two approaches represent two extremes. An ASIC approach is extremely expensive. It is, therefore, an important research topic to design a specialized computing architecture for fuzzy applications that falls between these two extremes both in run time and design time/cost. TABLEI INFERENCE TIME BY 51 RULES {{{{Time }}{{MIPS R3000 }}{{ASIC }}{{Regular }}{{With min/mix }}{{6000 inference 1 inference FLIPS }}{{125s 20.8ms 48 }}{{49s 8.2ms 122 }}{{0.0038s 6.4㎲ 156,250 }} }}

• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.17-29
• /
• 2007

Inference engine that performs the brain of software agent in next generation's web with various standards based on standard language of the web, XML has to understand SWRL (Semantic Web Rule Language) that is a language to express the rule in the Semantic Web. In this research, we want to develop a forward inference engine, SMART-F (SeMantic web Agent Reasoning Tools-Forward chaining inference engine) that uses SWRL as a rule express method, and OWL as a fact express method. In the traditional inference field, the Rete algorithm that improves effectiveness of forward rule inference by converting if-then rules to network structure is often used for forward inference. To apply this to the Semantic Web, we analyze the required functions for the SWRL-based forward inference, and design the forward inference algorithm that reflects required functions of next generation's Semantic Web deducted by Rete algorithm. And then, to secure each platform's independence and portability in the ubiquitous environment and overcome the gap of performance, we developed management tool of fact and rule base and forward inference engine. This is compatible with fact and rule base of SMART-B that was developed. So, this maximizes a practical use of knowledge in the next generation's Web environment.

• Science of Emotion and Sensibility
• /
• v.24 no.1
• /
• pp.59-72
• /
• 2021

Concepts and categories offer the basis for inference pertaining to unobserved features. Prior research on category-based induction that used blank properties has suggested that similarity between categories and features explains feature inference (Rips, 1975; Osherson et al., 1990). However, it was shown by later research that prior knowledge had a large influence on category-based inference and cases were reported where similarity effects completely disappeared. Thus, this study tested category-based feature inference when features are connected in a causal chain and proposed a feature inference model that predicts participants' inference ratings. Each participant learned a category with four features connected in a causal chain and then performed feature inference tasks for an unobserved feature in various exemplars of the category. The results revealed nonindependence, that is, the features not only linked directly to the target feature but also to those screened-off by other feature nodes and affected feature inference (a violation of the causal Markov condition). Feature inference model of causal model theory (Sloman, 2005) explained nonindependence by predicting the effects of directly linked features and indirectly related features. Indirect features equally affected participants' inference regardless of causal distance, and the model predicted smaller effects regarding causally distant features.

• Smart Media Journal
• /
• v.11 no.2
• /
• pp.77-83
• /
• 2022

The neuromorphic architecture uses a spiking neural network (SNN) model to derive more accurate results as more spike values are accumulated through inference experiments. When the inference result converges to a specific value, even if the inference experiment is further performed, the change in the result is smaller and power consumption may increase. In particular, in an AI-based IoT environment, power consumption can be a big problem. Therefore, in this paper, we propose a technique to reduce the power consumption of AI-based IoT by reducing the inference time by adjusting the inference image exposure time in the neuromorphic architecture environment. The proposed technique calculates the next inferred image exposure time by reflecting the change in inference accuracy. In addition, the rate of reflection of the change in inference accuracy can be adjusted with a coefficient value, and an optimal coefficient value is found through a comparison experiment of various coefficient values. In the proposed technique, the inference image exposure time corresponding to the target accuracy is greater than that of the linear technique, but the overall power consumption is less than that of the linear technique. As a result of measuring and evaluating the performance of the proposed method, it is confirmed that the inference experiment applying the proposed method can reduce the final exposure time by about 90% compared to the inference experiment applying the linear method.

• Science of Emotion and Sensibility
• /
• v.26 no.1
• /
• pp.55-64
• /
• 2023

This research investigated category-based feature inference when category features were connected in common cause and common effect causal networks. Previous studies that tested feature inference in causal categories showed unique inference patterns depending on causal direction, number of related features, whether the to-be-inferred feature was cause or effect, etc. However, these prior studies primarily focused on inference pattens that arise from causal relations, and few studies directly explored how the effects of causal relations vary depending on causal strength. We tested feature inference in common cause (Expt. 1) and common effect (Expt. 2) causal categories when casual strengths were either strong or weak. To this end, we had participants learn causal categories where features were causally linked and then perform feature inference task. The results showed that causal strengths as well as causal relations had important impacts on feature inference. When causal strength was strong, inference for common cause feature became weaker but that for the common effect feature became stronger. Moreover, when causal strength was strong and common cause was present, inference for the effect features became stronger, whereas the results were reversed in common effect networks. In particular, in common effect networks, casual discounting was more evident with strong causal strength. These results consistently demonstrate that participants consider not only causal relations but also causal strength in feature inference of causal categories.