<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Intelligent software environment for integrated expert system designing and development</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Galina</forename><forename type="middle">V</forename><surname>Rybina</surname></persName>
							<email>galina@ailab.mephi.ru</email>
							<affiliation key="aff0">
								<orgName type="department">Moscow Engineering Physics Institute)</orgName>
								<orgName type="institution">National Research Nuclear University MEPhI (</orgName>
								<address>
									<addrLine>Kashiskoe sh. 31</addrLine>
									<postCode>115409</postCode>
									<settlement>Moscow</settlement>
									<country key="RU">Russian Federation</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Yury</forename><forename type="middle">M</forename><surname>Blokhin</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Moscow Engineering Physics Institute)</orgName>
								<orgName type="institution">National Research Nuclear University MEPhI (</orgName>
								<address>
									<addrLine>Kashiskoe sh. 31</addrLine>
									<postCode>115409</postCode>
									<settlement>Moscow</settlement>
									<country key="RU">Russian Federation</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Intelligent software environment for integrated expert system designing and development</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">403D947045E4F461631A7CA7D5E51B8C</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-23T22:18+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract/>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">Introduction</head><p>Today dynamic intelligent systems (DIS) are the most complex class of applied intelligent systems, including real time (RT) DIS. This is one of the most and currently one of the most relevant and in-demand classes of DIS are dynamic integrated expert systems (IES) that use dynamic domain and solving dynamic problems <ref type="bibr" target="#b9">[10]</ref>. Analysis of the foreign and domestic level of research and development in the field of DIS, in particular, dynamic IES, has shown that when creating dynamic IES and relevant tools (IS), a large number of scientific and technological problems arise related to the specific features of building both separate components of the IES. And the organization of interaction of these components among themselves in the RV. As a whole, despite the lack of semantic unification of the terminology base, integrated DIS classifications, and their separate classes as well as the circle of general scientific and technological problems that hinder the wide application of DIS applications in strategically important subject domains, where the highest effect of using the temporal DIS occurs, have already accumulated <ref type="bibr" target="#b10">[11]</ref><ref type="bibr" target="#b11">[12]</ref><ref type="bibr" target="#b12">[13]</ref>.</p><p>Listed above problems substantially determine the high complexity of DIS development as dynamic integrated expert systems that are the most widespread and needed DIS class. Moreover, there is no universal complex method for solving the described problems (or a part of them) that implies the development of an integrated integral methodology and technology for creating such complicated systems at all lifecycle stages. Modern commercial software to support the construction of most DISs (G2, Rtworks, RTXPS, etc.) despite its power and versatility, is not able to solve the above problems in terms of integrated methodology fully <ref type="bibr" target="#b14">[15]</ref> and others.</p><p>А new stage of developing the theory and technology of IES construction based on the problem oriented methodology is a valuable step towards IES development automation. Its main properties are stated in a few monographies <ref type="bibr" target="#b10">[11]</ref><ref type="bibr" target="#b11">[12]</ref><ref type="bibr" target="#b12">[13]</ref>. Today, this is the basis that is used to create the intelligent applications and automated workstation of a knowledge engineer, namely, the AT TECHNOLOGY tool complex, on whose basis several tens of applied IESs have been created, where a wide spectrum of models and methods of solving different unformalized and formalized problems is used in terms of integrated IES architecture.</p><p>A few generations of the AT-TECHNOLOGY workbench have proved efficiency in the development of more than 20 applied intelligent systems, including dynamic IES, which, in the context of a problem-oriented methodology, represent the further improvement of static IES related to working in dynamic environments and domains and solving dynamic problems (monitoring, diagnostics, planning, control, etc.). Thus in the architectures of dynamic IES there are components modeling the external environment and allowing to interact with hardware in the RT, and also to perform reasoning in the changing data and temporal knowledge. In general, this corresponds to specific results obtained by solving the scientific problems listed above (published in <ref type="bibr" target="#b9">[10]</ref><ref type="bibr" target="#b10">[11]</ref><ref type="bibr" target="#b11">[12]</ref><ref type="bibr" target="#b12">[13]</ref>, etc.).</p><p>The modern version of the AT-TECHNOLOGY workbench enables automated support of IES development, using methods of intelligent planning and control of development processes <ref type="bibr" target="#b15">[16,</ref><ref type="bibr" target="#b16">17]</ref> etc. As the conceptual basis of intellectual software technology is the concept of intelligent program environment model. Its complete formal description and methods for implementing individual components is given in <ref type="bibr" target="#b9">[10]</ref>.</p><p>The work is focused on the further development of methods and tools for the automated construction of dynamic IES using components of the intelligent software environment and taking into account the modern requirements of software engineering, described in detail in <ref type="bibr" target="#b4">[5]</ref> and other works.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>2</head><p>Intelligent planning methods and their usage for integrated expert systems development automation</p><p>The detailed analysis of modern methods, approaches and software tools used in the field of intelligent planning is given in <ref type="bibr" target="#b16">[17]</ref>, so here we consider only the most important theoretical and methodological aspects of this problem in the context of the goals and objectives of this paper.</p><p>The planning problem formulation described in modern works is usually based on the basic set of axioms for Labeled Transition System Σ, as <ref type="bibr" target="#b5">[6,</ref><ref type="bibr" target="#b2">3]</ref>: finiteness; full observability; determinism; static; limited goals; plans linearity; implicit time; offline planning. These axioms impose significant restrictions on the formulation of the planning problem, and violation of some of these axioms leads to a complication of the planning task. The formal formulation of the planning problem is given in <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b5">6]</ref>. The most known approaches to planning were analyzed -graph planning, state space planning, transition to other problems, etc. <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b5">6,</ref><ref type="bibr" target="#b6">7]</ref>.</p><p>The problem of planning of prototyping IES is quite well described in terms of states and transitions. It is necessary to point out that application of intelligent planning for the automated support processes of building intelligent systems is a poorly investigated area, and it is possible here to refer mainly to the experience gained in the creation of applied dynamic IES based on the problem-oriented methodology and AT-TECHNOLOGY workbench, in particular, the development and use of educational and dynamic IES <ref type="bibr" target="#b13">[14]</ref>. Let us consider the basic concepts of intellectual AT-TECHNOLOGY workbench software in more detail. So far, the main applications of intelligent planning are <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b2">3,</ref><ref type="bibr" target="#b3">4,</ref><ref type="bibr" target="#b5">6,</ref><ref type="bibr" target="#b16">17,</ref><ref type="bibr" target="#b17">18]</ref>: autonomous robots control; logistics and the resolution of extraordinary events; semantic web; automated tutoring; calibration of equipment; control of conveyor machines; resource-scheduling; resource allocation in computer systems.</p><p>The classical algorithm A* was chosen as the base for developing algorithms for generating global and detailed plans <ref type="bibr" target="#b16">[17]</ref> used in the prototyping of PECs, was chosen, which is the simplest and sufficiently well-researched, which corresponds to modern world trends in the development of planners <ref type="bibr" target="#b8">[9]</ref>. To reduce the search space, usually effective heuristic functions is used, which development in modern works on intellectual planning is given significant attention.</p><p>During the researches comparative analysis of universal heuristic functions used in planners implementations was carried out within the framework of these studies and using heuristics (relaxed heuristics, heuristics of the critical path, abstract heuristics, landmark) <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b2">3,</ref><ref type="bibr" target="#b7">8]</ref>: Blind; Relaxation-based maximum; Merge-and-shrink; Admissible Landmark; Relaxation-based additive; Relaxed plan heuristic; Casual graph heuristic; Context-enhanced additive heuristic; The Landmark Heuristic et al.</p><p>The comparison between different heuristic functions showed that even though the most powerful heuristic functions (for example, from the landmark class) show rather high efficiency, they do not give a fundamentally qualitative leap in the issues of computational complexity of solving the planning problem. Therefore, for specialized domains such as dynamic IES, it is preferable to use problem-oriented heuristic functions instead of universal ones. They can reduce search space size up to several orders, so in this work, the specialized heuristic function have been developed.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">Implementation details of basic intelligent software environment components</head><p>Intelligent software environment takes significant place in the framework of the problem-oriented IES constructing methodology (basic points are reflected in <ref type="bibr" target="#b9">[10]</ref>) and implements intelligent software support for the IES development processes. It is general concept of "intelligent environment". Complete formal description of the intellectual environment model and methods of the individual components implementation is presented in <ref type="bibr" target="#b9">[10]</ref>, so here only a brief description of the model in the form of quaternion is presented: M AT = &lt;KB, K, P, TI&gt;, where KB is a technological knowledge base (KB) on the composition of the project, and typical design solutions used in development of IES. K -set of current contexts K i , consisting of a set of objects from the KB, editing or implementing on the current control step. P -a special program -an intelligent planner that manages the development and IES testing process. TI -many tools TI i , applied at various stages of IES development.</p><p>Intelligent planner is the main procedural (operational) component. It is defined as P = &lt;SK, AF, Pa, Pb, I, GP&gt;, SK here is the state of the current context, in which the scheduler was activated. AF is a set of functional modules, a part of planner. Pa is a selection procedure for the current target based on the global development plan. Pb is a selection procedure for the best executive function module from the list of possible candidates. I -procedures to ensure the interface with the corresponding components of the AT-TECHNOLOGY workbench; GP -operating procedures for the IES global development plan.</p><p>The main technological knowledge unit is a standard design procedure (SDP), which can be represented as tuple SDP i = &lt;C, L, T&gt; where C -is the set of conditions under which the SDP can be implemented; L -script implementation described in the describing internal language actions of the SDP; T -set of parameters initialized by intelligent planner at SDP inclusion in the development plan of a IES prototype. Description of other intelligent software environment can be found, for example in <ref type="bibr" target="#b16">[17]</ref>. Now let us state methods and approaches used in the implementation of the intellectual supportive environment for the development of IES model. The main components of this IES are the technological KB on the composition of IES project, SDP and RUC, and the intelligent planner managing the process of plans construction and implementation for the development of IES prototypes. These are the main purposes why it is necessary to use different types of knowledge in the process of developing a IES prototype: checking referential integrity of the project on the development of IES; automated construction of components diagrams; layout synthesis of IES prototype architecture; planning a series of steps to create a prototype of IES-specific features and tasks; determining a set of the most relevant sub-tasks for each of the stages (steps) in the development of IES prototype and others.</p><p>The main task of intelligent planner is a dynamic support knowledge engineer operations at all life cycle stages of building. Dynamic support is done by generating IES development plans for the current IES prototypes and allowing the specific plans execution (made either automatically or interactively). It should be noted that detailed plans and global IES prototyping generation and architecture model synthesis is based on the integration of IES with planning methods.</p><p>The proposed method is based on state-space planning which generates plan applied IES architecture model and the SDP set. The architecture model IES contains a set of elements that need to be realized and depending on the type of element and its content, different RUCs can be used for implementation, resulting in various components of the IES prototype project. Moreover, the use of knowledge from the technological KB (containing SDP and RUC) allows the implementation of several architecture mode components together with the application of the appropriate RUC. Four special algorithms have been developed to implement the proposed method. With the help of the first one, the model of the prototype architecture of the IES <ref type="bibr" target="#b9">[10]</ref> is preprocessed by converting architecture model in the form of a hierarchy of extended data flow diagrams (RDPD) into one generalized diagram by recursive detailing of complex operations (example is shown in Fig. <ref type="figure">1</ref>. as a uncovered graph).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Fig. 1. Detailed coverage</head><p>The aim of the second algorithm is to search the coarse coverage of the generalized diagram (Fig. <ref type="figure">1</ref>, solid bound). In this paper, a multiple of SDP fragments is meant to cover a diagram, between elements of which a one-to-one correspondence with elements of a generalized diagram is established. Under a coarse coverage is meant a cover only by necessary fragments of a SDP.</p><p>It is performed in the following manner. At the first step, all the vertices of the diagram are marked with a number 0, and an empty set is also initialized, into which the activated SDPs will be added. Next, for each SDP from the technological KB, the possibility of covering this necessary SDP fragment on a fragment of a generalized diagram consisting of elements marked with zeros is checked. For the SDP in the set of activated SDPs, an instance of the corresponding SDP is added, and the covered elements are marked with the identifier of the corresponding instance. The process of generating coverage continues as long as there are SDPs in the technological KB, which can be covered with zeros of the generalized diagram. In this case, the same SDP can be activated several times in the form of different instances.</p><p>The third algorithm allows to generate detailed coverage (example is shown in Fig. <ref type="figure">1</ref>, where optional fragments bounded with dashed lines), which means covering all available SDP fragments from the set of activated SDPs. To do this an instance of the activated SDP is selected with attempt to cover the diagram elements marked with 0 using each of the optional SDP fragments, taking into account their links (data flows) with the required SDP fragment. The covered elements of the diagram are also marked with the identification number of the SDP instance. The algorithm is terminated when there are no optional SDP fragments that can extend the existing coverage.</p><p>The coverage generating with second and third algorithms are implemented with using heuristic state space search, based on the classical algorithm A*. Generating of new states is associated with the coverage of the diagram by each new fragment (necessary and optional respectively). The fourth algorithm is designed to convert the detailed coverage into a plan, with a set of planned tasks associated with the use of certain operational RUCs from each coverage fragment.</p><p>The reason for development of specialized algorithms is due to the violation of the axiom associated with setting constraints on the complexity of describing the goal state of the system. The generating of a global plan involves special search metric. To construct a coarse and accurate coverage, two specialized heuristic functions are used, which were developed on the basis of the experience of prototyping IES of different architectural typologies.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4">Conclusion</head><p>Now various methods of intelligent planning, algorithms and heuristic functions have been experimentally evaluated for the further development of the intelligent planner efficiency of AT-TECHNOLOGY workbench. As a result the following were completed: model of IES prototype development plan (decomposed to the global and detailed plans), as well as concretization of individual components of SDP model (scenario and conditions); the original method for IES prototype development plan generating based on heuristic search is developed as well as algorithms for its implementation, including specialized heuristic function.</p><p>On the example of development of two prototypes of dynamic IES for the Russian Center for Disaster Medicine "Zaschita" ("Management of medical forces and means for major road accidents" and "Management and monitoring of resources of the satellite communication system between regional centers"), software simulation of methods for development of particular components of dynamic IES prototypes of various architectural typology. Their design and development stages are characterized by high laboriousness and intellectual load on knowledge engineers.</p><p>The work was supported by the Russian Foundation for Basic Research support (project № 15-01-04696) and the MEPhI Academic Excellence Project (agreement with the Ministry of Education and Science of the Russian Federation of August 27, 2013, project no. 02.a03.21.0005).</p></div>		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Temporal planning with preferences and time-dependent continuous costs</title>
		<author>
			<persName><forename type="first">J</forename><surname>Benton</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">J</forename><surname>Coles</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Coles</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012</title>
				<meeting>the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012<address><addrLine>Atibaia, Sao Paulo, Brazil</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2012">June 25-19, 2012. 2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">A tutorial on planning graph based reachability heuristics</title>
		<author>
			<persName><forename type="first">D</forename><surname>Bryce</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Kambhampati</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">AI Magazine</title>
		<imprint>
			<biblScope unit="volume">28</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="47" to="83" />
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<title level="m" type="main">Automated planning -theory and practice</title>
		<author>
			<persName><forename type="first">M</forename><surname>Ghallab</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">S</forename><surname>Nau</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Traverso</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2004">2004</date>
			<publisher>Elsevier</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Unifying the causal graph and additive heuristics</title>
		<author>
			<persName><forename type="first">M</forename><surname>Helmert</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Gener</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, ICAPS 2008</title>
				<meeting>the Eighteenth International Conference on Automated Planning and Scheduling, ICAPS 2008<address><addrLine>Sydney, Australia</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2008">September 14-18, 2008. 2008</date>
			<biblScope unit="page" from="140" to="147" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Software Engineering of computer systems</title>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">M</forename><surname>Lavrisheva</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Paradigms, technologies and CASE-tools of programming</title>
				<meeting><address><addrLine>Kiev</addrLine></address></meeting>
		<imprint>
			<publisher>Scien. dumka</publisher>
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Current trends in automated planning</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">S</forename><surname>Nau</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">AI Magazine</title>
		<imprint>
			<biblScope unit="volume">28</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="43" to="58" />
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<monogr>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">S</forename><surname>Osipov</surname></persName>
		</author>
		<title level="m">Artificial intelligence methods</title>
				<meeting><address><addrLine>Moscow</addrLine></address></meeting>
		<imprint>
			<publisher>FIZMATLIT</publisher>
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">UCPOP: A sound, complete, partial order planner for ADL</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">S</forename><surname>Penberthy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">S</forename><surname>Weld</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR&apos;92)</title>
				<meeting>the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR&apos;92)<address><addrLine>Cambridge, MA</addrLine></address></meeting>
		<imprint>
			<date type="published" when="1992">October 25-29, 1992. 1992</date>
			<biblScope unit="page" from="103" to="114" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">J</forename><surname>Russell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Norvig</surname></persName>
		</author>
		<title level="m">Artificial Intelligence -A Modern Approach</title>
				<imprint>
			<publisher>Pearson Education</publisher>
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
	<note>3. internat. ed</note>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Theory and technology of construction of integrated expert systems</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">V</forename><surname>Rybina</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Monography. Nauchtehlitizdat</title>
				<meeting><address><addrLine>Moscow</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2008">2008</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Intelligent systems: from A to Z</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">V</forename><surname>Rybina</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Knowledge-based systems. Integrated expert systems</title>
		<title level="s">Monography series in</title>
		<meeting><address><addrLine>Moscow</addrLine></address></meeting>
		<imprint>
			<publisher>Nauchtehlitizdat</publisher>
			<date type="published" when="2014">2014</date>
			<biblScope unit="volume">1</biblScope>
		</imprint>
	</monogr>
	<note>3 books</note>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Intelligent systems: from A to Z</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">V</forename><surname>Rybina</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">telligent dialogue systems. Dynamic intelligent systems</title>
		<title level="s">Monography series in</title>
		<meeting><address><addrLine>Moscow</addrLine></address></meeting>
		<imprint>
			<publisher>Nauchtehlitizdat</publisher>
			<date type="published" when="2015">2015</date>
			<biblScope unit="volume">2</biblScope>
		</imprint>
	</monogr>
	<note>3 books</note>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Intelligent systems: from A to Z</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">V</forename><surname>Rybina</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Problem-oriented intelligent systems. Tools for intelligent system developing. Dynamic intelligent systems</title>
				<meeting><address><addrLine>Moscow</addrLine></address></meeting>
		<imprint>
			<publisher>Nauchtehlitizdat</publisher>
			<date type="published" when="2015">2015</date>
			<biblScope unit="volume">3</biblScope>
		</imprint>
	</monogr>
	<note>Monography series in 3 books</note>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Distributed knowledge acquisition control with use of the intelligent program environment of the at-technology workbench</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">V</forename><surname>Rybina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><forename type="middle">M</forename><surname>Blokhin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Commu-nications in Computer and Information Science</title>
		<imprint>
			<biblScope unit="page" from="150" to="159" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Dynamic integrated expert systems: the evolution of the attechnology workbench</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">V</forename><surname>Rybina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><forename type="middle">M</forename><surname>Blokhin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal Information Content and Processing</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="155" to="161" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Use of intelligent program environment for construction of integrated expert systems</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">V</forename><surname>Rybina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><forename type="middle">M</forename><surname>Blokhin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Life Science Journal</title>
		<imprint>
			<biblScope unit="volume">11</biblScope>
			<biblScope unit="issue">8</biblScope>
			<biblScope unit="page" from="287" to="291" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Modern automated planning methods and tools and their use for control of process of integrated expert systems construction</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">V</forename><surname>Rybina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><forename type="middle">M</forename><surname>Blokhin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Artificial intelligence and decision making</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="75" to="93" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Automated planning for liner shipping fleet repositioning</title>
		<author>
			<persName><forename type="first">K</forename><surname>Tierney</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">J</forename><surname>Coles</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Coles</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Kroer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">M</forename><surname>Britt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">M</forename><surname>Jensen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012</title>
				<meeting>the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012<address><addrLine>Atibaia, Sao Paulo, Brazil</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2012">June 25-19, 2012. 2012</date>
			<biblScope unit="page" from="279" to="287" />
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
