Journal:Informatica
Volume 23, Issue 3 (2012), pp. 427–441
Abstract
In this paper, we consider piecewise linear aggregates (PLA) and a possibility to use a linear temporal logic for analysis of their performance over finite structures (finite linear temporal logic (LTL)). We describe a calculus where the search is performed with respect to a context of the formula. An important aspect of finite LTL is the simplicity of its model of time and actions. PLA is used for description of numerous complex systems. The answers about the behavior of the aggregate are got by finding an interpretation in which all the formulas describing the work of the aggregate are true. This is illustrated by formalizing alternative bit protocol (ABP) task. We describe the ABP by putting it in the form of a planning problem. From the obtained model, we can find a finite sequence of actions to be executed in order to achieve the goal. In addition, an alternative bit protocol problem is described using the planning domain description language (PDDL). We report the results of experiments conducted using the LPG-TD planner.
Journal:Informatica
Volume 1, Issue 2 (1990), pp. 121–124
Abstract
In this report an expert system AKU for diagnostics in acupuncture is described. The injured vital energy channels can be diagnosed using three independent methods: inquiring, Ryodoraku test and Akabane test. The inquiring is constructed as a set of trees whose internal vertices are questions while the leaves are the symptoms of diseases. The production rules describe the correspondence between the symptoms and the state of vital energy “qi” in the channels. AKU is realized by IBM PC computer and used for acupuncture treatment. The program is coded in Turbo Prolog.