This position paper aims at setting a new semantics for multi-modal mu-calculus to represent interactive states where abstract actions may be applied to. A least fixed point formula may be available to denote states allowing interaction. A simple algebraic representation for interactive states can be definable. For communication between human and machinery, a modality is reserved. In applicative task domains, knowledge construction is focused on with respect to interactive action applications through communications. Panel touch behaviour on iDevice as practice, URL references as functions and grammatical rule applications for sequential effects are studied, as knowledge construction technologies. These views coherent with abstract state machine are finally related to recent trends as semiring in algebraic structure and coalgebra for streams as sequential knowledge structures. A refinement of interactive techniques is positioned into a formal approach to multi-modal logic, applicable to some practices.

We propose a new interaction way that uses mobile devices to input and output devices of computers. The idea is simple but powerful, because 1) mobile devices are popular, 2) people can use them easily, 3) people carry them at all times, 4) two displays one of which is a big display for a computer and another is a small display of a mobile device may make new interaction and visualization and 5) a user can store parts of public data in physically independent device, that is his/her mobile device. We expect that our idea may make psychological barrier lower than now so that users can access and modify all data around the world more easily. In this paper, we show an example application based the idea we propose and discuss its possibilities.

In this paper, we propose a visual interface which assist managing educational courses in e-Learning systems. Educational courses in e-Learning systems can be represented as graphs. We design a simple interface which specializes in manipulation of educational courses only by movements of mouse. The feature of the interface is that we can manipulate graphs without pull down menus and buttons. We specify operations by drawing lines in the canvas window. For example, we can add an edge to a graph by drawing an arrow, and delete nodes and edges by drawing crossing lines on them. Since this is an application-dependent small system, we carefully select the operations and design the simple interface. We show which operations can be used in the interface and how we detect them from mouse movements.

E-learning systems have become important in higher education, especially in universities. An adaptive e-learning system, which dynamically generates suitable courses for each student, is one of the most remarkable research fields. In this paper, we propose a general framework for adaptive e-learning systems, and discuss the role of information visualization in adaptive e-learning systems.

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

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.

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.

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.

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.

This paper shows a method of constructing a dataflow, which denotes the deductions of a logic program, by means of a sequence domain based on equivalence classes of substitutions. The dataflow involves fair merge functions to represent unions of atom subsets over a sequence domain, as well as functions as manipulations of unifiers for the deductions of clauses. A continuous functional is associated with the dataflow on condition that the dataflow completely and soundly denotes the atom generation in terms of equivalent substitutions sets. Its least fixpoint is interpreted as denoting the whole atom generation based on manipulations of equivalent substitutions sets.