It is hard to imagine the scope of life, which we did not address the rapidly developing information technologies. A great amount of programs are indispensable tools for people in all sectors of life. One of the most important of these programs are expert system (ES). The range of this kind of applications is very wide, but at the same time, each program is self-sufficient for its narrow specific subject area, and is comprehensive in its subject area.
Relevance of the topic is that, in the case of Shell to the possibility of building a power plant, the ideology of which is minimal expert to humanity will be granted a panacea for the deal with a range of problems, not limiting the subject area of the problem to be solved. Moreover, the proliferation of shell such systems could enable a wide range of users without programming skills, but experts in a field to set up and manage such systems.
The main objective is the implementation, expansion and deepening of algorithm performance teoretical plural operations of grammar in a special envelope for the development of intelligent CAD created by A.V. Grigoriev.
Scientific novelty of the folowing work is that the knowledge base of expert systems is in the form of one or more grammar, that interact with each other.
With the help of this program experts of different range of skills will quickly and effectively create customized CAD within existing larger CAD. Users of the system will be able to receive high-quality intellectual ES automation design for a reasonable price.
Most of my scientific publications on topic were written by manager of this master’s work AV Grigoriev. The basis of my project is designed to implement algorithm teoretic-plural operations of grammar in a special envelope for the development of intelligent CAD. Also, his authorship belongs article "Specific of the teoretic-plural operations on context-free grammar in a variety of additional semantics in semiotics intelligent CAD model" and "Towards an intelligent CAD system with different levels of skills expert", I have been actively used in writing the Master's work.
The theme I had chosen is a rare and a little ununderstood, therefore I found impossible to find any research and development on this theme in Ukraine.
One of the best examples of international developments on the system functional-logic programming is system S-FLOGOL. S-FLOGOL is functional-logic system programming that is based on the theory of relations and the implementation of a direct relationship based on a network of schemes aimed relations. To make the semantic objects in the language used recursive scheme aimed relations with a network of grammar context-free set in a network of language (multiple networks, in a terminal element basis) [1]. The main components are integrated environment programiirovaniya : structure-oriented text editor, graphics editor and central module. a) Text Editor text editor designed for language queries and to create and edit database modules. It is based on the original technology of input, based on alternativno-spiskovoy a grammar language. At any given time, in the text of a host of fragments that define the syntax of the language. The piece is the name of the concept, disclosed in the process of working with the editor. The language grammar, syntax for each of the disclosure could be one of its definition. Using the language S-FLOGOL notion of some type of basic syntax of a clear set of tools. After selecting the desired option from the list in the context of a place dedicated to the name of the law placed the option of identifying with terminal elements of the environment, and the names of other syntax definitions, which disclosed the same. No manual entry of the syntax is automatically structuring of the programme. To achieve this algorithm has been developed, based on the principle of not tab for the entry of elements according to the level of their nesting in a tree-like domestic program. After commissioning program compiled in the internal representation, which in graphics for a possible adjustment and execution. b) Graphic Editor. The system uses a dedicated graphics, performing the task of creating, maintaining and loading network grammar; Administration zeroes; display intermediate results of calculations. Creating a network of grammar based on graphical programming technology, allowing the user at each step of editing graphically construct always correct grammar description of the network. A central element of the interface and display of grammar is the editor of the tree, thus waive additional windows designed to form the structure of grammar. The tree also displayed intermediate and final results of calculations. Building rules of grammar is to create a new rule in the tree and editing automatically set up an empty network class with special tools. The graphic of the rules of grammar are adding network elements to identify the relationship, and the subsequent merger of points of the entrances or exits of the elements. Note that when adding a new element in the network at the same time there are all points of its etrances and exits. The user is also provided support tools to facilitate the process of graphic rules of grammar, such as grid, scrolling and zoom. For a comfortable display networks used specialized imaging techniques and drawing, which allows for a smooth transfer of any scale images.
Its planned to implement a knowledge base expert system of grammar through the interaction between grammar etc. assistance algorithm performance teoretiko-mnozhestvennyh operations of grammar in a special envelope for the development of intelligent CAD [2]. Most prominent is the formation of CAD models used in the shell tool for creating expert systems were severely flawed. These shortcomings do not allow the use of expert systems created in a CAD or intellectual issue superstructures on them. Addressing a large number of such problems as a result of the use of model-semiotics as a form of CAD models [3]. In this model has two components-a task space systems (CPS), or Many prototipes looks and space systems (POS), or Many technical jobs. Accordingly, there are two different context - grammar, grammar and grammar TSPS POS. The semiotic modeoi be seen in Figure 8.1. Figure 8.1 To achieve semiotic model precisely apply the above algorithm. In this case the grammar is similar I-ILI tree, or had cycles and recursy. Consider the basic definitions used to describe the algorithm : a) Term - basic character set. b) Sinterm-name variety, which can displayed. Elements of decomposition can be Thermes, and sintermy connected through Operation I (&) or "OR" (V). c) If two of many similar name, it means that they are equivalent and on the structure, ie the same name is the same variety. g) If two of many similar structure, it is because they have different names, and a subset of them the same way, that is, The same structure can have many different kinds of records, but in full decomposition of these recordings we get through the same thing. An algorithm performance teoretic-plural operations over sensitive grammar, or context-free grammar, which identifies products based semantic (explicit and implicit). Shadow product presuppose a list of prototypes therm and sinterms context-free grammar designed to choose only semantically possible solutions. Sharp products are directly imposed on the user’s context-free leading grammar. They are designed to capture possible and impossible combination of alternatives ILI-sinterms.
The realization of teoretic-plural operations of grammar will create a space of grammar and grammar of the target space of a new, unified grammar, which will be concluded newly system, which will establish the knowledge base for expert system.
1. Al.M. Bebchik, An.Ì.Bebchik, V.N. Fal'k. Tools of development and program debug system of the functionally-logical programming of S-FLOGOL.
2. À.V. Grigor'ev. Algorithm of implementation of òåîðåòèêî-plural operations above grammars in the environment of the specialized shell for creation of intellectual SAPR
3. Pospelov Ä.À. the Situation management: theory and practice. Ì.: Science, 1986.