Open access peer-reviewed chapter

Multiset-Based Knowledge Representation for the Assessment and Optimization of Large-Scale Sociotechnical Systems

By Igor Sheremet

Submitted: June 28th 2018Reviewed: September 26th 2018Published: November 21st 2018

DOI: 10.5772/intechopen.81698

Downloaded: 139

Abstract

This chapter is dedicated to a new knowledge representation model, providing convergence of classical operations research and modern knowledge engineering. Kernel of the introduced model is the recursively generated multisets, selected according to the predefined restrictions and optimization criteria. Sets of multisets are described by the so-called multiset grammars (MGs), being projection of a conceptual background of well-known string-generating grammars on the multisets universum. Syntax and semantics of MGs and their practice-oriented development—unitary multiset grammars and metagrammars—are considered.

Keywords

  • systems analysis
  • operations research
  • knowledge engineering
  • digital economy
  • multisets
  • recursive multisets
  • multiset grammars
  • unitary multiset grammars and multimetagrammars
  • sociotechnical systems assessment and optimization

1. Introduction

Large-scale sociotechnical systems (STS) usually have hierarchical structure, including personnel and various technical devices, which, in turn, consume various material, financial, information resources, as well as energy. As a result, they produce new resources (objects), which are delivered to other similar systems. Main features of such STS are large dimensionality and high volatility of their structures, equipment, consumed/produced objects, and at all, operation logics and dynamics [1, 2, 3, 4, 5].

Knowledge and data representation models, used in STS, provide comparatively easy and comfortable management of very large knowledge and data bases with dynamic structures and content [6, 7, 8, 9, 10]. These model bases are objects other than matrices, vectors, and graphs, traditionally used in operations research and systems analysis [11, 12, 13, 14], and they are much more convenient for practical problem consideration. But, on the other hand, aforementioned models in general case do not incorporate strict theoretical background and fundamental algorithmics, compared with, for example, mathematical programming, which provides strictly optimal solutions for decision-makers. So, practically all decision-support software in the considered STS is based on various heuristics, which correctness and adequacy are not proved usually in the mathematical sense. As a consequence, quality of the adopted decisions, based on such heuristics, in many cases may be far of optimal.

This chapter is dedicated to a primary survey of the developed knowledge representation model, providing convergence of classical operations research and modern knowledge engineering. This convergence creates new opportunities for complicated problem formalization and solution by integrating best features of mathematical programming (strict optimal solution search in solution space, defined by goal functions and boundary conditions) and constraint programming [15, 16, 17] (natural and easily updated top-down representation of logic of the decision-making in various situations). Kernel of the considered model is multisets (MS)—relatively long ago known and in the last 20 years intensively applied object of classical mathematics [18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29]. This background is generalized to the recursively generated, or, for short, recursive multisets (RMS) by introduction of so-called multiset grammars, or, again for short, multigrammars (MGs), which were described by the author in [30, 31]. Last, in turn, are peculiar “projection” of the conceptual basis of classical formal grammars by Chomsky [32, 33], operating strings of symbols, to the multisets universum in such a way, that MGs provide generation of one multiset from another and selection (filtration) of those, which satisfy necessary integral conditions: boundary restrictions and/or optimality criteria.

MGs may be considered as prolog-like constraint programming language for solution of problems in operations research and systems analysis areas. Taking into account relative novelty of the multigrammatical approach and absence of any substantial associations with mathematical constructions presented lower, we introduce main content of the chapter by short informal description of the main elements of this approach in Section 2. Basic formal definitions are presented in Section 3. Section 4 is dedicated to multiset grammars, while Section 5—to detailed consideration of the so-called unitary multigrammars (UMGs) and unitary multimetagrammars (UMMGs), which are main tool of the aforementioned problem formalization and solution.

2. Informal description

Let us consider a company, which consists of director, three departments, and one separate laboratory. This fact may be simply represented as follows:

company1director,3department,1laboratory.E1

In this notation, a whole structure of the company, detailed to employee positions, may be described in such a way:

department1headdepartment,3laboratory,laboratory1headlaboratory,2analyst,3assistant.E2

This set of constructions is of the form:

an1a1,,nmamE3

describes following set, created by multiplying and summarizing quantities of identical positions:

1director3headdepartment10headlaboratory20analyst30assistant,E4

where niaimeans there are nipositions of type aiin this company.

Let us join to the company structure knowledge about employees’ month salary, represented in the same unified manner:

director10000eur,headdepartment5000eur,headlaboratory3000eur,analyst1500eur,assistant500eur.E5

After applying to the joined set of constructions just the same multiplying-summarizing procedure, we may obtain resulting set containing the only element {100,000eur}, which defines company’s total financial resource, necessary for employees’ provision a month.

Presented knowledge representation concerns systems analysis, that is, obtaining integral parameters of the system given its structure and local parameters.

Consider more sophisticated task-relating systems design and concerning development of company structure given its integral parameters. Goal is to determine rational quantity of departments and laboratories in the department, as well as quantities of analysts and assistants in one laboratory. Total salary is no more than 120,000 eur, quantity of analysts in one laboratory may be from 1 to 3, while corresponding quantity of assistants may be from 2 to 6. Total quantity of employees must be maximal. There may be three different variants of company structure: (1) three departments and one laboratory; (2) two departments and three laboratories; and (3) four departments. Corresponding set of constructions is as follows:

company1director,3department,1laboratory,E6
company1director,2department,1laboratory,E7
company1director,4department,E8
department1headdepartment,mlaboratory,E9
laboratory1headlaboratory,nanalyst,lassistant.E10

Constructions, defining employees’ salary, and other aforementioned restrictions are as follows (for definiteness, let us take that quantity of laboratories in one department does not exceed five):

director1employee,10000eur,E11
headdepartment1employee,5000eur,E12
headlaboratory1employee,3000eur,E13
analyst1employee,1500eur,E14
assistant1employee,500eur,E15
employee=max,E16
eur120000,E17
1m5,E18
1n3,E19
1l6.E20

As seen, along with already introduced “detailing” constructions, there are additional constructions, defining sets of values of variables, having places in the first ones, as well as conditions, determining optimization criterion (there may be several such criteria), and bounds of quantities of some objects in the resulting sets. Evidently, due to presence of alternatives in the description of company structure (there are three such alternatives) and variables in some of “detailing” constructions, there may be more than one resulting set like Eq. (4). These sets are of the form xemployeeyeur, where x is the quantity of employees, while y—total salary, corresponding to this variant. Conditions (16)(20) provide selection of those sets, which satisfy them in the described sense. In general, Eqs. (16)(20) may be interpreted as a query, determining subset of all possible variants, described by Eqs. (6)(15).

To “mark” “detailing” constructions, used while resulting set creation, one can add to their “bodies” elements like 1varianti, for example,

company1variant1,1director,3department,1laboratory,E21
company1variant2,1director,2department,3laboratory,E22
company1variant3,1director,4department.E23

If so, then resulting sets will be of the form:

1variantixemployeeyeur.E24

To implant to these sets values of variables, it is sufficient to represent them in resulting sets in “usual” form jv, where vis variable and j is its value, so considered example will lead us to sets like:

1variantixemployeeyeurimjnkl.E25

As seen, shortly introduced by this example knowledge and query representation language, being easy to understand and to use, allows formalization of multicriterial optimization problems, for years associated with mathematical programming. On the other hand, “detailing” constructions have form of productions (rules), far and wide used in knowledge engineering and being common background of prolog-like declarative (nonprocedural) knowledge representation [34, 35, 36]. As will be shown lower, such constructions may be used not only for structuring, but in many other cases, enabling description of various systems behavior and interaction, as well as their mutual impacts. For such reasons, this informally described technique is taken as a basis for the description of the developed mathematical toolkit considered thoroughly in the following sections.

3. Basic operations on multisets

Classical set theory is based on the concept of set as unordered assembly of elements, different from one another. Theory of multisets assumes presence of equal (“indistinguishable”) elements:

v=a1,,a1n1timesai,,ainitimesam,,amnmtimesE26

Expression (26) is recorded as:

v=n1a1nmam,E27

where vis called multiset, a1,,am—objects, n1,,nm—multiplicities of these objects, and n1a1,,nmam—multiobjects. Following Eq. (27), one may consider vas set of multiobjects; also, from substantial point of view, set a1amand multiset 1a11amare equivalent. Empty multiset, as well as empty set, is designated as . Multiplicity of object may be zero, what is equivalent to absence of this object in the multiset:

n1a1nmam0am+1=n1a1nmam.E28

Fact that object aor multiobject nabelongs to multiset v(“enters v”) is designated by one and the same symbol :av,nav. Set βv=anavis called basis of multiset v.

There are five main operations on multisets, used lower: join, intersection, addition, subtraction, and multiplication by constant [26, 27].

Consider two multisets:

v=n1a1nmam,v=n1a1nmam.E29

Result of their join (recorded as ) is multiset.

vv=aa1ama1amnavnavmaxnnaaa1ama1amnavnaaa1ama1amnavna,E30

where ,anddesignate operations of set-theoretical join, intersection, and subtraction of two sets correspondingly, while designates operation of set-theoretical join of sets determined by underwritten conditions.

Result of v,vmultisets intersection (recorded as ) is multiset.

vv=aa1ama1amnavnavminn,na.E31

Result of v,vmultisets addition (recorded as bold +) is multiset.

v+v=aa1ama1amnavnavn+naaa1ama1amnavnaaa1ama1amnavna.E32

Result of vmultiset subtraction from vmultiset (recorded as bold ) is multiset.

vv=aa1ama1amnavnavn>nnnaaa1ama1amnavna.E33

At last, result of vmultiset multiplication by integer number n (recorded as vn) is multiset.

vn=n×n1a1n×nmamE34

(here integers’ usual multiplication is recorded as ×)

There are also two basic relations on multisets: inclusion () and strict inclusion ().

Multiset v is included to multiset v, that is, vv, if

navnavnn,E35

and multiset v is strictly included to multiset v, that is, vv, if vv&vv.

Example 1. Let v1=3analyst2assistant,v2=4assistant1director, then

v1v2=3analyst4assistant1director,v1v2=2assistant,v1+v2=3analyst6assistant1director,v2v1=2assistant,v12=6analyst4assistant,1analyst2assistantv1,4assistant1directorv2.

All defined operations are known from widespread sources (e.g., aforementioned [26, 27]). At the same time, filtering operations, defined lower, operate sets of multisets (SMS), creating subsets of these sets by selection of multisets, which satisfy some conditions, being operands of these operations.

There are two types of conditions: boundary and optimizing.

Boundary condition may be elementary or concatenated (for short, “chain”). Elementary boundary condition (EBC) may have one of the following forms:

nρa,E36
aρn,E37
a,E38

where aand aare the objects, n is the integer number, and ρ<=. Chain boundary condition (CBC) is constructed from elementary by writing them sequentially:

e1ρ1e2ρ2eiρiei+1emρmem+1,E39

where e1,,em+1are the objects or nonnegative integers, while ρ1,,ρmare the symbols of relations (<,=,).

EBC semantics is following. Let V be set of multisets, and vV. Multiset v satisfies EBC n¯ρa, if naV, and n¯ρnis true. Similarly, v satisfies EBC n¯, if n¯ρnis also true. At last, v satisfies EBC aρa', if nav, nav, and nρn'is true. There is one addition to all listed definitions, concerning particular case, when navn'av, which is equivalent to n=0n'=0.

CBC semantics is defined as follows. CBC (39) is replaced by CBC sequence

e1ρ1e2,e2ρ2e3,,eiρiei+1,,emρmem+1,E40

and vVis considered satisfying CBC (39), if it satisfies all EBC having place in Eq. (40).

Result of application of boundary condition b to SMS V is recorded as Vb.

Example 2. Let V=v1v2,where v1=5analyst3assistant1director,v2=2assistant4director3employee,and boundary conditions are 2analyst4,assistant<employee,1directorassistant3,andanalyst=assistant<5.Table 1 contains result of application of listed boundary conditions to V.

conditionVcondition
2analyst4v2
assistant<employeev2
1directorassistant3v1
analyst=assistant<5

Table 1.

Results of application of boundary conditions.

Optimizing condition has form a = opt, where a is the object, and optminmax. Semantics of this construction is following. Multiset vVsatisfies condition a=min, if for every vV, such that vv, multiplicity n in multiobject navis not greater, than multiplicity nin multiobject nav, that is, nn. Similarly, vVsatisfies condition a=max, if for every vV, such that vv, multiplicity n in multiobject navis not less, than multiplicity nin multiobject nav, that is, nn. If avav, we consider navnav, where n=0n=0.

Filter is join of boundary Fand optimizing Foptsubfilters:

F=FFopt,E41

where Fis set of boundary conditions, and Foptis set of optimizing conditions. Result of filtration of set of multisets Vby filter Fis denoted as VFand is defined by expression

VF=VFFoptE42

where

F=c1ck,E43
Fopt=opt1optl,E44
VF=i=1kVci=V,E45
VFopt=j=1lVoptj,E46

and c1,,ckare EBC. As seen, set Vis filtered by boundary conditions, so there are selected multisets, satisfying all of these conditions, and intermediate result Vis then filtered by optimizing conditions, so, that multisets, satisfying all of them, are included to the final result.

Example 3. Consider set V=v1v2v3v4, where

v1=3analyst2assistant2employee,v2=6assistant2director,v3=1analyst3assistant5director2employee,v4=1analyst2assistant2employee.

Let F=1analyst32directoremployeeanalyst=minassistant=max.Then, according to Eqs. (41)(46),

VF=VFFopt,

where

F=1analyst32directoremployee,Fopt=assistant=minemployee=max.

Filtration is performed as follows:

V1analyst3=v1v3v4,V2director4=v1v2v4,VF=v1v4,v1v4assistant=min=v1,v1v4employee=max=v1v4,VF=v1v1v4=v1.

Due to commutativity of set-theoretic join and intersection operations, filtration inside subfilters may be executed in the arbitrary order.

4. Multiset grammars

As mentioned higher, multiset grammars are tool, providing generation of one multisets from another, or, what is the same, generation sets of multisets.

By analogy with classical grammars, operating strings of symbols [32, 33], we shall define multigrammar as a couple.

S=v0R,E47

where v0is a multiset called kernel, while R, called scheme, is finite set of the so-called rules, which are used for generation of new multisets from already generated. Rule has the form:

vv,E48

where v(left part of the rule) and v(right part of the rule) are multisets, and v.Semantics of rule is as follows. Let v¯be multiset; with that we shall speak, that rule (48) is applicable to v¯, if vv¯, and result of its application is a multiset.

v¯=v¯v+v.E49

Speaking informally, if v¯includes v, then the last is replaced by v. Application of rule rRto multiset v¯is denoted as v¯rv¯, and any sequence v¯rrv¯is called generation chain.

Set of multisets, defined by MGs S=v0R, is denoted as VS. Iterative representation of MG semantics, that is, SMS VSgeneration by application of MG S, is the following:

V0=v0,E50
Vi+1=Viv¯VirRπv¯r,E51
VS=V,E52

where

πv¯vv=v¯v+v,ifvv¯,otherwise.E53

As seen, function (53) implements application of rule vvto multiset v¯as described higher. As a result of i + 1-th step of generation, new SMS is formed by application of all rules rRto all multisets v¯Vi, and it is joined to SMS Vi. If multiset v¯is generated from multiset v¯by some sequence of such steps, it is denoted as v¯v¯.

VSis fixed point of the described process, that is, VS=Vi, where i. If for some finite i Vi=Vi+1, then VS=Vi, and VSis finite. In the introduced notation,

VS=vv0v.E54

VSincludes subset V¯sVsof the so-called terminal multisets (TMS) vV¯ssuch that πvr=for all rR, that is, no one multiset may be generated from terminal multiset. Set V¯Sis called final; final set consists of terminal multisets only.

Example 4. Let S=v0R, where v0=3eur4usd,

R=r1r2, where

r1is 2eur1usd1eur1gbp,

r2is 1eur2usd1eur2gbp.

As seen,

v0=3eur4usdr12eur3usd1gbpr11eur2usd2gbpr21usd4gbp,
2eur3usd1gbpr21a12usd3gbpr21usd5gbp,
3eur4usdr22eur3usd2gbpr11eur2usd3gbpr21usd5gbp,
2eur3usd2gbpr21eur2usd4gbpr21usd6gbp

(for short, identical parts of different generation chains are omitted). So

V¯s=1eur4gbp1usd5gbp1usd6gbp.

By analogy with classical string-generating grammars, multigrammars may be context-sensitive and context-free (CF). In the last one, left parts of all rules have form 1a, while in the first, there are no any limitations on both parts of rules, excluding, that left part must be nonempty multiset.

5. Unitary multiset grammars and metagrammars

Start point for unitary multigrammars (UMGs), developed on the considered basis, is simplified representation of CF rules: instead of

1an1a1nmamE55

they are written as:

an1a1,,nmam.E56

Construction (56) is called unitary rule (UR), object a—its head, and unordered sequence (list) n1a1,,nmam—its body.

Let us consider UMG formal definition and illustrating example. Unitary multigrammar is couple S=a0R, where a is the so-called title object, and R, as in multigrammars, is scheme—set of unitary rules (56).

Iterative representation of UMG semantics, i.e., generation of SMS VS, where S=a0R,is following:

V0=1a0,E57
Vi+1=Viv¯VirRπ¯v¯r,E58
VS=V,E59
V¯S=v¯v¯VS&βv¯A¯s,E60

where

π¯v¯an1a1nmam=v¯na+nn1a1nmam,ifnav¯,otherwise.E61

Here, A¯sis set of the so-called terminal objects, such that aA¯s, if and only if R does not include URs, which head is a (i.e., a has place only in the UR bodies). A¯sis subset of set Asof all objects, having places in scheme R of UMG S. Multiset, generated by UMG S, all objects of which are terminal, is also called terminal multiset (as seen, this notion of TMS does not contradict to the defined higher regarding MGs). In Eq. (61), UR an1a1,,nmamis written in the angle brackets for unambiguity.

As seen, Eq. (59) defines VS—set of all multisets, generated by UMG S,—while Eq. (60) by condition βv¯A¯sprovides selection of V¯S—set of terminal multisets (STMS)—from VS.

Example 5. Consider unitary multigrammar S=companyR, where R includes following unitary rules:

company3group,2analyst,company3analyst,group1analyst,group2analyst.

According to Eqs. (57)(61),

VS=1company3group2analyst3analyst5analyst8analyst,V¯S=3analyst5analyst8analyst.

Filtering unitary multigrammars (FUMGs) are UMG generalization, providing generation of terminal multisets and selection those of them, which satisfy conditions, assembled to filters, which were described higher in Section 3.

FUMGs are triple S=a0RF, where a0, R, and F have the same sense, as above, and set of terminal multisets, generated by S, is defined as follows:

V¯S=V¯a0RF,E62

that is, set of terminal multisets, generated by S, is result of filtering STMS, generated by UMGs a0R, by filter F.

Example 6. Let S=companyRF, where R is as in Example 5, while F=analyst>3analyst=min. Then, according to Eqs. (57)(62),

V¯S=3analyst5a2analyst8analystanalyst>3analyst=min=5analyst8analystanalyst=min=5analyst.

Filtering unitary multigrammars are, in turn, basis for unitary multiset metagrammars, or, for short, multimetagrammars, which are considered at all the rest part of the chapter and are main toolkit for the description and solution of the optimization problems, mentioned in the introduction.

Unitary multimetagrammar S is, as higher, triple a0RF, where a0is the title object, and R is the scheme, containing unitary rules and so-called unitary metarules (UMR), while F is the filter. Consider UMMG syntax and semantics.

Unitary metarule has the form:

aμ1a1,,μmam,E63

where μiis the positive integer number, as in UMGs/FUMGs, or variable γΓ, where Γis the universum of variables. When μiis γiΓ, then it is called multiplicity-variable (MV). As seen, unitary rule is the simplest particular case of unitary metarule with all multiplicities μ1,,μmbeing constants. As in URs, object a in Eq. (55) is called head, while μ1a1,,μmam—body of metarule.

Filter F is set of conditions, which may be of the following forms:

nan,E64
a=opt,E65
nγn,E66

where optmaxmin. As seen, boundary condition (64) and optimizing condition (65) are the same, as in FUMG filters, while boundary condition (65), called variable declaration, defines set of values (domain) of variable γand is denoted lower as Nγ. If F includes subfilter FΓ=n1γ1n1nlγlnl, containing boundary conditions of form (66), then every combination of variable values n¯1Nγ1,,n¯lNγlprovides creation of one unitary multigrammar by substitution of n¯1,,n¯lto all unitary metarules, having places in scheme R, instead of multiplicities-variables being in their bodies; unitary rules, already having place in R, are transferred to new scheme, denoted Rn¯1n¯l, without any transformations. Every such UMGs generates set of terminal multisets, after what all these STMS are joined, and resulting set is filtered by filter F=FFΓ, containing all “FUMG-like” conditions (From the described, it is obvious nature of “multimetagrammar” notion—in mathematical logic, or “metamathematics,” “metalanguage” is language, used for description of another language, so “multimetagrammar” is “unitary-like” multigrammar, used for description of other unitary multigrammars by means of unitary metarules, variables-multiplicities, and boundary conditions, defining their domains.). As may be seen from this informal description, UMMGs are simple unified tool for compact representation of sets of FUMGs (for practically valuable problems, containing very large numbers of elements—millions and greater).

Coming back to Section 2, one can see that Eqs. (6)(20) are set of elements of unitary metamultigrammar: Eqs. (6)(8) and Eqs. (11)(15) are unitary rules, Eqs. (9)(10) are unitary metarules, Eq. (16) is optimizing condition, Eq. (17) is boundary condition, while Eqs. (18)(20) are variable declarations. As seen,

Nm=12345,E67
Nn=123,E68
Nl=123456,E69

so, this one UMMG, consisting of 15 lines, replaces 5×3×5=75filtering unitary multigrammars, each scheme consisting of 10 lines.

Let us now give strict definition of unitary multimetagrammar notion. UMMG S=a0RFdefines set of terminal multisets V¯Sin such a way:

V¯S=S¯SV¯S¯F,E70
S=γ1n1n1γlnlnla0Rγ1γl,E71
Rn¯1n¯l=rn¯1n¯lrR,E72
F=FFΓ,E73
FΓ=i=1lniγini,E74

and, at last, if r is aμ1a1,,μmam,then rn¯1n¯lis unitary rule.

aμ1n¯1n¯la1,,μmn¯1n¯lam,E75

where

μin¯1n¯l=μi,ifμiN,n¯j,ifμiisγjΓ.E76

As seen, according to Eqs. (75) and (76), all multiplicities-variables of unitary metarule aμ1a1,,μmamare replaced by their corresponding values from the tuple n¯1n¯l, while all multiplicities-constants (elements of positive integer numbers set N) remain unchanged. Evidently, if all μ1,,μmare constants, that is, if unitary metarule is UR, it remains unchanged.

Let us note, that multiplicities-variables area of actuality is whole UMMG scheme, that is, if there are n > 1 occurrences of one and the same variable γin different unitary metarules (and, of course, in one and the same unitary metarule), they all are substituted by one and the same value from the applied sequence n¯1n¯l.

Example 7. Let us consider UMMG S=<company,R,F>, where scheme R contains following three unitary metarules:

company2group,γ1analyst,group3analyst,γ2assistant,groupγ1analyst,γ2assistant,

and filter F includes following conditions, the first being boundary, the second—optimizing, while the last two—variable declarations:

2analyst6,assistant=min,0γ11,2γ23.

According to Eqs. (70)(76), this UMMG defines four UMGs:

S0,2=<company,R<0,2>>,S0,3=<company,R<0,3>>,S1,2=<company,R<1,2>>,S1,3=<company,R<1,3>>,

where

R<0,2>={<company2group>,<group3analyst,2assistant>,<group12assistant>},R<0,3>={<company2group>,<group3analyst,3assistant>,<group3assistant>},R<1,2>={<company2group,1analyst>,<group3analyst,2assistant>,<group1analyst,2assistant>},R<1,3>={<company2group,1analyst>,<group3analyst,3assistant>,<group1analyst,3assistant>},

(URs are represented in angle brackets for unambiguity). These UMGs define, respectively, following sets of terminal multisets:

V¯S0,2=6analyst4assistant4assistant,V¯S0,3=6analyst6assistant6assistant,V¯S1,2=7analyst4assistant3analyst4assistant,V¯S1,3=7analyst6assistant3analyst6assistant,V¯S=V¯S0,2V¯S0,3V¯S1,2V¯S1,32analyst6)assistant=min={6analyst4assistant,6analyst6assistant,6assistant,3analyst4assistant,3analyst6assistant}assistant=min=6analyst4assistant3analyst4assistant.

As may be seen, Eqs. (64)(66) define boundary conditions, concerning objects and variables, and optimizing conditions, concerning only objects, that is why from both theoretical and practical points of view, it is reasonable to extend UMMG filters by optimizing conditions, relating variables. By analogy with Eq. (65), such conditions will have the form:

γ=opt.E77

This form defines optimality of the generated terminal multisets through multiplicity-variable values, used while these TMS generation. Eq. (77) semantics is quite clear: select those TMS, which are generated by the help of value of variable γ, which (value) is minimal (maximal) among all other TMS, generated by γapplication. As seen, Eq. (77) extends optimality definition from only multiplicities-constants, having places in TMS, to also multiplicities-variables, having places in unitary metarules, applied while TMS generation.

Most simple formal definition of the verbally described sense of Eq. (77) optimizing condition may be as follows. Let us introduce l auxiliary terminal objects γ¯1,,γ¯lcorresponding variables γ1,,γl, having places in UMMG S=a0RF, i.e., unitary metarules and boundary condition (66). After that, let us add one new unitary metarule:

a01a0,γ1γ¯1,,γkγ¯lE78

to scheme R, thus creating scheme R, which contains Eq. (78) and all elements of R, and substituting all optimizing conditions of the form γ=optby γ¯=optin filter F, thus converting them to the “canonical” form (65)—remember, γ¯is object not variable and, more, terminal object, because there is no any UR or UMR with head γ¯in R. Obtained filter will be denoted as F.

As seen now, UMMG S=a0RFgenerates terminal multisets of the form:

ni1ai1nikaikn¯1γ¯1n¯lγ¯l,E79

where

ni1ai1nilailV¯S,E80

and TMS (79) will be selected to V¯S, if and only if TMS (80) satisfies all conditions, entering F and concerning terminal objects ai1,,aik, as well as TMS n¯1γ¯1n¯lγ¯lsatisfies all optimizing conditions of the form γ¯i=optF, corresponding γi=optF..

It is not difficult to define V¯Sby subtracting from all vV¯Smultisets of the form n¯1γ¯1n¯lγ¯l, but from the practical point of view, it is more useful to consider not V¯Sbut V¯Sas a result of application of unitary multimetagrammar S: it is clear that all vV¯Scontain values n¯1,,n¯lof variables γ1,,γlas terminal objects γ¯1,,γ¯lmultiplicities, which computation is often main purpose of the mentioned application.

Example 8. As may be seen, problem, described in Section 2, is to obtain m quantity of laboratories, as well as n and l quantities of analysts and assistants, respectively, in one laboratory. Although Eqs. (18)(20) do not contain optimizing conditions of the form γ=opt,generating TMS like

100employee115000eur3m2n5lE81

is much more useful than TMS like {100employee, 115,000eur} because of Eq. (81) with greater informativity (here, we use m, n, l instead of n¯,m¯,l¯).

So we shall use V¯Sas a result of S=a0RFunitary multimetagrammar application, even if R does not include variable-containing optimizing conditions.

To finish with syntax and semantics of UMGs/UMMGs, let us note that class of unitary multigrammars is strict subclass of filtering unitary multiset grammars (UMGs FUMGs): every UMGs is FUMGs with empty filter. From the other side, FUMGs are strict subclass of unitary multiset metagrammars (UMGs FUMGs): every FUMGs is UMMGs without variable multiplicities and corresponding variable declarations inside filter.

UMG/UMMG algorithmics and applications are considered in the separate chapter of this book.

© 2018 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution 3.0 License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to cite and reference

Link to this chapter Copy to clipboard

Cite this chapter Copy to clipboard

Igor Sheremet (November 21st 2018). Multiset-Based Knowledge Representation for the Assessment and Optimization of Large-Scale Sociotechnical Systems, Enhanced Expert Systems, Petrică Vizureanu, IntechOpen, DOI: 10.5772/intechopen.81698. Available from:

chapter statistics

139total chapter downloads

More statistics for editors and authors

Login to your personal dashboard for more detailed statistics on your publications.

Access personal reporting

Related Content

This Book

Next chapter

Unitary Multiset Grammars an Metagrammars Algorithmics and Application

By Igor Sheremet

Related Book

First chapter

Expert System for Identification of Sport Talents: Idea, Implementation and Results

By Vladan Papić, Nenad Rogulj and Vladimir Pleština

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.

More About Us