<?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">Modeling Adaptive Behavior with Conceptual Spaces</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Michael</forename><surname>Cebulla</surname></persName>
							<email>mce@cs.tu-berlin.de</email>
							<affiliation key="aff0">
								<orgName type="department">Fakultät für Elektrotechnik und Informatik</orgName>
								<orgName type="institution">Technische Universität Berlin</orgName>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department">Institut für Softwaretechnik und Theoretische Informatik</orgName>
								<address>
									<addrLine>Franklinstr. 28/29</addrLine>
									<postCode>10587</postCode>
									<settlement>Berlin</settlement>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Modeling Adaptive Behavior with Conceptual Spaces</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">C0E0C3471B8E5FC73DDD1245D8B2DDB6</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T08:37+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>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>We discuss a membrane-based calculus for the combination of conceptual spaces during runtime. Since our goal is to support emergent properties of behavior (and due to the fact that it is not possible to define a complete calculus for all situations) we introduce the notion of self-modification. Terms from situational description can evolve according to simple rules thus providing various possibilities for reactions.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">Introduction</head><p>In this paper some of the problems which are connected with context-dependent behavior are developed as a general problem of combining conceptual spaces. Examples from the field of medical workflows are given. The approach which is discussed in this paper relies on the notion of conceptual integration which was developed in the field of cognitive semantics <ref type="bibr" target="#b1">[2]</ref>. This integration can be simulated by the rule-based integration of ontologies.</p><p>The framework described in this paper partly follows previous proposals for the formalization of contextual reasoning. While classifications <ref type="bibr" target="#b0">[1]</ref> heavily rely on universal algebra or category theory <ref type="bibr" target="#b2">[3]</ref> we focus on an operational treatment using membrane computing <ref type="bibr" target="#b3">[4]</ref>.</p><p>In this paper we make an attempt to bridge the gap between highly reactive behavior during runtime and the need for highly abstract and meaningful concepts for contextawareness. Especially we propose to integrate highly abstract forms of common sense reasoning (as proposed by <ref type="bibr" target="#b0">[1]</ref>) with membrane computing (as proposed by <ref type="bibr" target="#b3">[4]</ref>) in order to support a way of runtime reasoning whose robustness is comparable to human reasoning. By this proposal we extend previous suggestions concerning high-level and intuitive specifications (cf. <ref type="bibr" target="#b4">[5]</ref>). Especially we propose to exploit common sense reasoning for the robustness of context-aware behavior in distributed systems.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Context and Behavior</head><p>Simplified models of medical workflows are employed in this paper as examples for the treatment of adaptive behavior.</p><p>Example 1 (Intubation: A Medical Workflow) The activity of intubation is considered with represents a specific part of a medical operation. Although there is certainly a definition of the process (i.e. a pattern) the exact shape of the final activity highly depends on the context in which this pattern is activated. In this paper we propose to represent the definition of the process (the pattern) as well as the situation as input spaces (in the sense of <ref type="bibr" target="#b1">[2]</ref>). We develop an emergent calculus which establishes links between these spaces. ♦</p><p>The Intubation Space. The conceptual space containing the process of intubation contains a constraint-based description of this process (cf. Figure <ref type="figure">2</ref>). The important actions are described with their causal relationships as well as constraints which have to hold in certain states. Especially three subtasks can be identified (Preparation, Laryngoscopy and Introduction) which have different relevance values for the overall process. Since the intubation space contains a pattern which is described in this space there are many variables which have to be bound to actual values from a specific situation. For instance, agents are represented by roles which have to be bound to real agents taken from another conceptual space. In a similar way constraints which are specified over objects or states are applied to elements from other spaces.</p><p>The Situation Space. While the intubation space contains roles for the agents which are responsible for certain actions the situation space is populated by (entities representing) real agents and resources. In addition in this conceptual space specific relations and circumstances can be described which are of informal nature but which heavily influence the shape of the resulting process. As an example a relation of informal hierarchy is given which may hold between an experienced nurse and a less experienced anesthesist. As we will see the background knowledge is used to establish infomorphisms between the conceptual spaces. As we will see there are multiple possibilities to establish these infomorphisms. One of our main points consist in the claim that the adaptive or selfconfiguring capabilities of complex systems (like human teams in the operation theatre) can be simulated by an adequate selection of the best possibility.</p><p>Generally the process of blending results in the creation of a blended space. Due to space restrictions we concentrate on the establishment of vital relations in this paper.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">Operational Treatment of Vital Relations</head><p>Under operational aspects we represent conceptual spaces as P-systems P CS . Basically a conceptual space is enclosed by a membrane. These entities which are contained in the space are mapped to components of P-systems (cf. <ref type="bibr" target="#b3">[4]</ref>). While concepts are mapped to molecules, individuals and relations are mapped to labeled membranes.</p><p>Definition 1 (P-System P CS ) The P-System for the representation of conceptual spaces P CS is defined by the tuple V, L, µ, w i , Rn i where V is the terminology of the classifications (containing concept names) and the label algebra L (containing individuals, situations and the concatenation operator ","). µ is the structure of membranes containing the multi-fuzzy sets w i . The rules contained in Rn i are discussed below. P One of our central goals is to support self-organizational capabilities in the dynamic composition of conceptual spaces. This is especially due to the fact that it is impossible to foresee every possible combination of situations. Since we do not want to define a uniform rigid calculus which is restricted to a certain set of known combinations we take the opposite approach which promises a more flexible solution. This means that we allow the terms to evolve in a solution and to look for possible combinations by themselves. This decentralized approach is robust against local evolutions and to unforeseen changes.</p><p>We proceed in two steps. Firstly we have to map context descriptions to membrane structures. This can be easily done by mapping individuals and situations to labeled membranes and concepts to molecules floating in a solution. In the same way we have to represent ontology morphisms by membrane structures. In a second step we give the rules for the evolution of these structures and for the establishment of valid combinations of contexts.</p><p>Airlock Rules. In our membrane-based approach molecules are enclosed by membranes. In order to make reactions possible however they have be able to leave their membranes. This is defined by the airlock rule. We introduce an extended version (EAL) which enables molecules to cross multiple membranes.</p><formula xml:id="formula_0">(AL) [ a C 1 ] a ⇌ C 1 ¡ a [ a ] a (EAL) [ b C 1 ¡ L,a [ a ] a ] b ⇌ C 1 ¡ L,a,b [ b [ a ] a ] b</formula><p>Intuitively we enable the molecules to travel through the membrane structure keeping track of the membranes they crossed in a list which is an annotation of the airlockoperator.</p><p>Interaction. The main goal is to find and encourage possible interactions. Especially molecules from situations should react with molecules from morphisms. Such reactions are only possible because both situations and morphisms evolve according to the airlock rules. The rule for interaction can be given as follows.</p><formula xml:id="formula_1">(INT) C + 1 ¡ src,mor [ mor [ src ] src ] mor , C − 1 ¡ a,s1 [ s1 [ a ] a ] s1 → [ mor,s1 [ src,s1,a C 1 ] src,s1,a ] mor,s1 [ s1,mor [ a,mor C 1 ] a,mor ] s1,mor</formula><p>Intuitively the reaction between the molecules is recorded by the labels. Thus the labels of the morphism are added to the labels of the situation. In the same way the labels of the morphism are extended. Note that we only treat the matching of the source ontology of the morphism. We presume that the molecules of the morphism are charged negatively while the molecules of the situation are charged positively. Note that there can be many different reactions between situations and morphisms because many copies of the structures are floating in the solution.</p><p>Completing the Infomorphism. An ontology morphism is completely bound when two molecules from two context description have been bound to its source and target ports. Since the knowledge about the creation of the bindings is contained in the labels the information is present which which completes an infomorphism (i.e. the relation between the individuals which is contravariant to the original ontology morphism).</p><p>Compression. Elements from the input spaces which are connected by a vital relation (i.e. infomorphisms) are projected into the blend. The resulting individuals which are created in the blend can be considered a tuple-valued individuals which establish a connection between the original tokens (or es equivalence classes). We cannot deepen these issues due to space restrictions.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Fig. 1 .</head><label>1</label><figDesc>Fig. 1. Conceptual Spaces</figDesc><graphic coords="2,192.24,348.55,267.66,155.18" type="bitmap" /></figure>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4">Outlook</head><p>We discussed a membrane-based calculus for the creation of infomorphisms between conceptual spaces during runtime. We consider this line of research as a contribution to the exploration of adaptive and context-aware behavior in distributed systems. The treatment of infomorphisms is the strategic foundation for the integration of more advanced formal constructs from common sense reasoning.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">Information Flow: the logic of distributed Systems</title>
		<author>
			<persName><forename type="first">J</forename><surname>Barwise</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Seligman</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1997">1997</date>
			<publisher>Cambridge Univ. Press</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<monogr>
		<title level="m" type="main">The Way we Think</title>
		<author>
			<persName><forename type="first">G</forename><surname>Fauconnier</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Turner</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2002">2002</date>
			<publisher>Basic Books</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Information integration in institutions</title>
		<author>
			<persName><forename type="first">J</forename><surname>Goguen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Memorial Volume for Jon Barwise</title>
				<meeting><address><addrLine>Indiana</addrLine></address></meeting>
		<imprint>
			<publisher>Indiana University Press</publisher>
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<title level="m" type="main">Membrane Computing. An Introduction</title>
		<author>
			<persName><forename type="first">G</forename><surname>Pȃun</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2002">2002</date>
			<publisher>Springer</publisher>
			<pubPlace>Berlin</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">From program languages to software languages</title>
		<author>
			<persName><forename type="first">P</forename><surname>Pepper</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Cebulla</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Didrich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Grieskamp</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">The Journal of Systems and Software</title>
		<imprint>
			<biblScope unit="volume">60</biblScope>
			<date type="published" when="2002">2002</date>
		</imprint>
	</monogr>
</biblStruct>

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