This work is concerned with an application of drawing hierarchically structured trees. The tree drawing is applied to an explanation reasoning system. The reasoning is based on synthetic abduction (hypothesis) that gets a case from a rule and a result. In other words, the system searches a proper environment to get a desired result. In order that the system may be reliably related to the amount of rules which are used to get the answer, we visualize a process of reasoning to show how rules have concern with the process. Since the process of reasoning in the system makes a hierarchically structured tree, the visualization of reasoning is a drawing of a hierarchically structured tree. We propose a method of visualization that is applicable to the explanation reasoning system.
en-copyright= kn-copyright= en-aut-name=SasakuraMariko en-aut-sei=Sasakura en-aut-mei=Mariko kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=YamasakiSusumu en-aut-sei=Yamasaki en-aut-mei=Susumu kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= affil-num=1 en-affil= kn-affil=Okayama University affil-num=2 en-affil= kn-affil=Okayama University en-keyword=data visualisation kn-keyword=data visualisation en-keyword=explanation kn-keyword=explanation en-keyword=inference mechanisms kn-keyword=inference mechanisms en-keyword=knowledge based systems kn-keyword=knowledge based systems en-keyword= trees (mathematics) kn-keyword= trees (mathematics) END start-ver=1.4 cd-journal=joma no-vol=6 cd-vols= no-issue=6 article-no= start-page=737 end-page=749 dt-received= dt-revised= dt-accepted= dt-pub-year=2005 dt-pub=20051108 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Logic programming with default weak and strict negations en-subtitle= kn-subtitle= en-abstract= kn-abstract=This paper looks at logic programming with three kinds of negation: default, weak and strict negations. A 3-valued logic model theory is discussed for logic programs with three kinds of negation. The procedure is constructed for negations so that a soundness of the procedure is guaranteed in terms of 3-valued logic model theory.
en-copyright= kn-copyright= en-aut-name=YamasakiSusumu en-aut-sei=Yamasaki en-aut-mei=Susumu kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= affil-num=1 en-affil= kn-affil=Okayama University en-keyword=negation in logic programming kn-keyword=negation in logic programming en-keyword=3-valued logic kn-keyword=3-valued logic END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page= end-page= dt-received= dt-revised= dt-accepted= dt-pub-year=2006 dt-pub=20067 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=An interactive environment for generating sequential information en-subtitle= kn-subtitle= en-abstract= kn-abstract=We propose an interactive environment in which we can generate sequential information. Sequential information is a sequence of movements which makes changes of situations. The system allows a user to construct an environment for generating sequential information. We provide interactions and visualization for sequential information generation based on theoretical grounds.
en-copyright= kn-copyright= en-aut-name=SasakuraMariko en-aut-sei=Sasakura en-aut-mei=Mariko kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=IwataKenichi en-aut-sei=Iwata en-aut-mei=Kenichi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=YamasakiSusumu en-aut-sei=Yamasaki en-aut-mei=Susumu kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= affil-num=1 en-affil= kn-affil=Okayama University affil-num=2 en-affil= kn-affil=Okayama University affil-num=3 en-affil= kn-affil=Okayama University en-keyword=Sequential information generation kn-keyword=Sequential information generation en-keyword=interactive kn-keyword=interactive END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=194 end-page=199 dt-received= dt-revised= dt-accepted= dt-pub-year=2005 dt-pub=20057 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Visualization for management of electronics product composition en-subtitle= kn-subtitle= en-abstract= kn-abstract=There are some systems called supply chain management system or value chain management system that manages production. It is a powerful tool in normal cases, but in a problem such that some parts are out of stock, it can solve the problem only by simple solutions, like postponing shipping of the product because it does not have enough information about production and functions to use the various information. Our research is concerned with a system to integrate information about production and show a solution to help users to judge which way is better to solve the problem. We implemented a prototype system. It takes inputs of some information that were not integrated in one place in former systems, but distributed among systems, people, or sections. It shows a solution for a problem making use of the information integrated in the system. The solution comes as process of reasoning to help user to judge what is the best to do in the case. We also implemented the user interface to show the process of reasoning.
en-copyright= kn-copyright= en-aut-name=KenichiIwata en-aut-sei=Kenichi en-aut-mei=Iwata kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=SasakuraMariko en-aut-sei=Sasakura en-aut-mei=Mariko kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=YamasakiSusumu en-aut-sei=Yamasaki en-aut-mei=Susumu kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= affil-num=1 en-affil= kn-affil=Okayama University affil-num=2 en-affil= kn-affil=Okayama University affil-num=3 en-affil= kn-affil=Okayama University en-keyword=data visualisation kn-keyword=data visualisation en-keyword=inference mechanisms kn-keyword=inference mechanisms en-keyword=product development kn-keyword=product development en-keyword=production management kn-keyword=production management en-keyword=supply chain management kn-keyword=supply chain management en-keyword=user interfaces kn-keyword=user interfaces END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=132 end-page=137 dt-received= dt-revised= dt-accepted= dt-pub-year=2003 dt-pub=20037 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=A three-dimensional visualization of communications in distributed program environments en-subtitle= kn-subtitle= en-abstract= kn-abstract=In order to understand the behaviour of distributed program environments, we describe a three-dimensional visualization of communications. Most previous visualizations presented communications by means of the two dimensions of time and process, however, three dimensions are required to represent a message intermediary with visualization functions. We make use of a semantic configuration of messages, which is constructed by the quantities for three parametric factors: (i) time sequence, (ii) identifications of processors, and (iii) message exchanges.
en-copyright= kn-copyright= en-aut-name=SasakuraMariko en-aut-sei=Sasakura en-aut-mei=Mariko kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=YamasakiSusumu en-aut-sei=Yamasaki en-aut-mei=Susumu kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= affil-num=1 en-affil= kn-affil=Okayama University affil-num=2 en-affil= kn-affil=Okayama University en-keyword=distributed programming kn-keyword=distributed programming en-keyword=logic programming kn-keyword=logic programming en-keyword=message passing kn-keyword=message passing en-keyword=program visualisation kn-keyword=program visualisation END start-ver=1.4 cd-journal=joma no-vol=35 cd-vols= no-issue=1-2 article-no= start-page=97 end-page=135 dt-received= dt-revised= dt-accepted= dt-pub-year=2001 dt-pub=20010327 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Abductive Proof Procedure with Adjusting Derivations for General Logic Programs en-subtitle= kn-subtitle= en-abstract= kn-abstract=In this paper, we formulate a new integrity constraint in correlation with 3-valued stable models in an abduction framework based on general logic programs. Under the constraint, not every ground atom or its negation is a logical consequence of the theory and an expected abductive explanation, but some atom may be unspecified as a logical consequence by an adjustment. As a reflection of the integrity constraint with an adjustment, we augment an adjusting derivation to Eshghi and Kowalski abductive proof procedure, in which such an unspecified atom can be dealt with. en-copyright= kn-copyright= en-aut-name=YamasakiSusumu en-aut-sei=Yamasaki en-aut-mei=Susumu kn-aut-name=山崎進 kn-aut-sei=山崎 kn-aut-mei=進 aut-affil-num=1 ORCID= en-aut-name=KuroseYoshinori en-aut-sei=Kurose en-aut-mei=Yoshinori kn-aut-name=黒瀬義則 kn-aut-sei=黒瀬 kn-aut-mei=義則 aut-affil-num=2 ORCID= affil-num=1 en-affil= kn-affil=Department of Information Technology affil-num=2 en-affil= kn-affil=Graduate School of Natural Science and Technology END