<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Project EVER: Extraction and Processing of Procedural Experience Knowledge in Workflows</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ralph Bergmann</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mirjam Minor</string-name>
          <email>minor@informatik.uni-frankfurt.de</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gilbert Mu¨ller</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pol Schumacher</string-name>
          <email>p.schumacher@celonis.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Celonis SE 81373 Mu ̈nchen</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Goethe University, Department of Informatics 60629 Frankfurt/Main</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Trier</institution>
          ,
          <addr-line>Business Information Systems II 54286 Trier</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <fpage>137</fpage>
      <lpage>146</lpage>
      <abstract>
        <p>The goal of the EVER project (Extraction and Processing of Procedural Experience Knowledge in Workflows), funded by the German Research Foundation, is to investigate new methods in Process-Oriented Case-Based Reasoning and related fields for extracting, representing, and processing procedural experiential knowledge in Internet communities. This paper summarizes the main achievements of the first funding period of this project. The main research addressed the extraction of workflows from textual sources in Internet Communities, the similarity-based retrieval of workflows for a particular goal of a user, and the automatic adaptation of retrieved workflows.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        Today’s Social Web allows people in a community of practice to post their own
experiences in a diversity of content repositories such as blogs, forums, or Q&amp;A websites
[
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. However, today there is no automated support for reusing these rich collections of
personal experience. Current search functions available merely consider experience as
text to be indexed as any other text and searched as any other document. The objective
of the EVER project (Extraction and Processing of Procedural Experience Knowledge
in Workflows) is the analysis, the development, and the experimental application and
evaluation of new knowledge-based methods, particularly from process-oriented
casebased reasoning (POCBR) [
        <xref ref-type="bibr" rid="ref13 ref7 ref8">7,8,13</xref>
        ], information extraction, and machine learning.
      </p>
      <p>The EVER project is funded by the German Research Foundation (DFG) and led
by the Universities of Trier and Frankfurt. During the first funding period from 2011
– 2016, the project focused on the reuse of procedural experiences published by
private people in Internet Communities such as cooking web sites. In this regard, it was
investigated whether workflow technology and POCBR can help to analyze and reuse
Copyright © 2017 for this paper by its authors. Copying permitted for private and
academic purpose. In Proceedings of the ICCBR 2017 Workshops. Trondheim, Norway
procedural experiential knowledge from these Internet communities. In the course of
this project, several significant contributions to POCBR research have been made,
particular in the fields of workflow extraction from text, workflow retrieval, and workflow
adaptation. The methods have been consistently evaluated in the domain of cooking
recipes. This paper presents a summary of those achievements and shows, how they are
connected to draw an overall picture of POCBR.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Architecture for POCBR</title>
      <p>
        The overall architecture of our POCBR approach in the EVER project is illustrated in
Fig. 1. First, procedural experience is gathered from Internet communities (or
alternatively from repositories of workflows in the Business Process Model and Notation
(BPMN) format) and stored in a suitable representation. More precisely, a case base of
semantic workflows is constructed by extracting workflows from textual sources. The
workflows in this repository can be reused, i.e., for a particular problem situation a
suitable process represented as workflow can be suggested. This is primarily achieved by
retrieving the best matching workflow from the repository. If required, the workflow
is automatically adapted according to the requirements and restriction in the
particular scenario. The required adaptation knowledge is automatically learned from the case
base. In addition to these steps (which basically correspond to the phases of the R4-CBR
cycle [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]) we also include specific methods for user interaction, enabling a
conversational POCBR approach [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ]. In the following section, we will summarize our research
related to various components of the architecture.
      </p>
      <p>User</p>
      <p>Query
Questions
Solution</p>
      <p>Ontologies
n
o
it
c
a
Itr
e
n
r
e
s
U</p>
      <p>Sources for
Workflows
Extraction
Case Base
of Semantic
Workflows
Retrieval
Adaptation</p>
      <p>Learning
Adaptation
Knowledge
• Operators
• Generalizations
• Sub-workflows</p>
      <p>Lehrstuhl für
Wirtschaftsinformatik II Fig. 1. EVER archi-t1e-cture for POCBR.</p>
    </sec>
    <sec id="sec-3">
      <title>Semantic Workflows as Case Representation</title>
      <p>In order to formalize procedural experience, we employed semantic workflows as case
representation. Broadly speaking, a workflow consists of a set of activities (also called
tasks) combined with control-flow structures like sequences, parallel (AND) or
alternative (XOR) branches, as well as repeated execution (LOOP). In addition, tasks consume
and produce certain data items, or objects, depending on the workflow domain (e.g.,
ingredients in the cooking domain). Tasks, data items, and relationships between the two
form the dataflow. For the given application domain, a cooking workflow describes the
preparation steps required and ingredients used in order to prepare a particular dish.
Here, the tasks represent the cooking steps and the data items refer to the ingredients
being processed by the cooking steps. An example cooking workflow for a sandwich
recipe is illustrated in Fig. 2.</p>
      <p>
        As a basis for the project, we developed a graph-based representation of semantic
workflows that further enables to compute similarities between two workflows [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. In
a semantic workflow the individual workflow elements are annotated with ontological
information. In particular, tasks and data nodes are linked into domain-specific task and
data ontology and can be further specified by properties, e.g. to represent context factors
or resources. In the cooking domain a taxonomy of cooking ingredients and cooking
steps is consequently constructed. Within the developed POCBR system CAKE
ontologies are represented in an object-oriented fashion while a (partial) transformation into
OWL has been developed.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Automatic Workflow Extraction from Text</title>
      <p>
        Prior to reasoning with procedural knowledge, the available experience is transformed
into a suitable and formal process representation. More precisely, we developed a novel
framework for automated workflow extraction [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], which transforms textual
descriptions of processes into semantic workflows. Here, from the textual description the
mayonnaise ketchup tabasco sandwich
      </p>
      <p>sauce
grate
+</p>
      <p>mix
slice
open
sandwich</p>
      <p>dish
+ spread
add
layer
sprinkle</p>
      <p>bake
baguette
salami
cucumber
cheese
data- ow edge control- ow edge control- ow node data node task node</p>
      <p>Fig. 2. Example workflow from the domain of cooking.
4
preparation step (saute) and the ingredients consumed (onion, green pepper) are
identified and transformed into a workflow fragment. A stepwise extraction of the entire
process description thereby constructs a complete workflow.</p>
      <p>
        The developed extraction methods are able to identify the activities of the process
[
        <xref ref-type="bibr" rid="ref27">27</xref>
        ], organizing them in a control flow [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ], and enriching the control flow by data
flow information [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. For the latter, we additionally investigated an alternative
approach to complete missing data-flow information [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] by learning completion
operators from a set of revised workflows within the repository. The framework implements
a pipe-and-filters architecture. Different extraction steps can be implemented as
independent components (filters), which can be composed to an extraction sequence (pipe).
Consequently, this allows the flexible reuse and exchange of filters. For the basic
linguistic analysis of the textual descriptions, methods from natural language processing
have been applied. We used the developed framework to extract a repository of
cooking workflows from 35,000 online recipes. The source code of the workflow extraction
framework as well as the repository are available for download under open source
licenses1.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Similarity-based Workflow Retrieval</title>
      <p>
        For reusing the extracted procedural experiences, the workflow repository is searched
for the best matching workflow using similarity-based retrieval methods. In order to
capture the scenario or problem situation, a specific workflow query language POQL
[
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] was developed. The query may include single workflow elements as well as entire
workflow fragments (e.g., sub-workflows), which are either marked as desired or
undesired. Furthermore, also generalized workflow elements such as generalized tasks and
generalized data items can be specified.
      </p>
      <p>
        POQL can then be used to trigger a similarity-based retrieval for the workflow best
matching the requirements and restrictions defined, for which several methods have
been developed. Most basically, we developed a semantic similarity measure for
semantic workflows [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] which is based on a workflow ontology. The semantic similarity
of workflows is defined as an optimization problem for the mapping of workflow
elements from the query to the mostly similar elements of case workflow. Various search
algorithms and respective heuristics have been developed to efficiently compute this
similarity [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. As an alternative approach to the developed semantic similarity
measures, we investigated similarity measures based on the trace index of a workflow [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ].
A trace index is created by analyzing all potential execution traces. Similarity of
workflows is then computed by comparing the trace indices of workflows.
      </p>
      <p>
        Moreover, several methods have been developed aiming at improving the efficiency
of similarity search within the repository, which is particularly important when the
workflow repository grows. For this purpose, a two-level retrieval method has been
developed [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Additionally, we investigated new methods for workflow clustering based
on the developed semantic similarity measures [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In particular, we developed various
algorithms that explore this cluster structure as an index structure for retrieval [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
1 www.wi.informatik.uni-frankfurt.de/index.php?option=com content&amp;
view=article&amp;id=126
5
      </p>
    </sec>
    <sec id="sec-6">
      <title>Automatic Workflow Adaptation</title>
      <p>We aim at supporting the users in situations in which the best matching workflow from
the case base does not sufficiently fulfill the query. This requires that the workflow is
automatically adapted according to the given restrictions and requirements, i.e., workflow
elements or fragments are added or deleted according to the particular needs.</p>
      <p>
        For that purpose, we developed several workflow adaptation methods. Since such
adaptation methods usually require a significant amount of domain-specific adaptation
knowledge, we additionally developed new methods that allow to automatically learn
the required adaptation knowledge from the workflow repository. Hence, we distinguish
between a learning phase of adaptation knowledge and a problem solving phase in
which for a given query the best matching workflow is adapted such that it matches the
particular problem scenario at best (see Fig. 3). The developed adaptation methods can
mostly be classified into transformational adaptation, compositional adaptation and
adaptation by generalization [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>
        More precisely, we developed two transformational adaptation methods, which
differ in the representation of the adaptation knowledge. In both approaches, adaptation of
workflow cases is performed by chaining several transformation steps w !1 w1 !2
: : : !n wn = w0 which iteratively transform the retrieved workflow w towards the
adapted workflow w0. This process is a search process with the goal to achieve an
adapted workflow which is as similar as possible to the query. Thus adaptation is
considered an optimization problem. In case-based adaptation [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] the individual
transformation steps are represented as so called adaptation cases which are learned automatically
from the workflow repository [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. An adaptation case represents a particular previous
adaptation scenario by capturing the information about how to transform a particular
Query
Abstrac on
Available
workflows
      </p>
      <sec id="sec-6-1">
        <title>Learning Phase</title>
      </sec>
      <sec id="sec-6-2">
        <title>Problem</title>
      </sec>
      <sec id="sec-6-3">
        <title>Solving</title>
      </sec>
      <sec id="sec-6-4">
        <title>Phase</title>
        <p>General.</p>
        <p>Abstract
workflows
General.
workflows
Available
workflows
RWeoproksflitoowry R
Learning
Adapta on</p>
        <p>Cases
Learning
Adapta on
Operators
Retrieved
Workflow
Adapta on</p>
        <p>Cases
Workflow
Streams
Adapta on
Operators</p>
      </sec>
      <sec id="sec-6-5">
        <title>Adapta on</title>
      </sec>
      <sec id="sec-6-6">
        <title>Knowledge A</title>
        <p>
          Adapta on
6
origin workflow to a corresponding goal workflow. It can be applied if it matches at a
certain position within the workflow to be adapted. The operator-based adaptation [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]
represents the individual transformation steps as so called workflow adaptation
operators. They are denoted in a STRIPS-like manner, i.e., by specifying a fraction of the
workflow to be deleted and a fraction to be added to the workflow. A learning algorithm
was also developed that allows to automatically acquire adaptation operators from pairs
of similar cases from the workflow repository.
        </p>
        <p>
          In addition, we developed a method for compositional and hierarchical adaptation.
It is based on the idea that each workflow can be decomposed into meaningful
subworkflows called workflow streams [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. Such workflow streams can be automatically
discovered from the workflow repository. Workflow streams represent valuable
adaptation knowledge which is used as “chunks” that can be inserted or used as
replacement during compositional adaptation. Compositional adaptation is also implemented
as a search process, but it replaces larger portions of a workflow than the
transformational adaptation approaches. In addition, workflow streams provide a means for
abstraction. An abstracted workflow, is a structurally simplified workflow, i.e., containing
fewer nodes or edges. Abstraction is achieved by replacing each discovered workflow
stream in a case by a single abstract task. As further background knowledge for
abstraction, domain-specific abstraction rules have been introduced, describing how to map a
sub-workflow to a domain-specific abstract task linked with an appropriate semantic
description from the domain ontology. The abstraction rules consist of elementary
abstractions such as sequential abstraction, block abstraction, and elimination. Abstraction
can be performed hierarchically, i.e., a rule can abstract also non-primitive tasks. During
problem solving, abstract cases (which are also stored in the workflow repository) can
be retrieved and reused by refining the occurring abstract tasks, e.g. by using workflow
streams as refinement operators, best suited to the current query.
        </p>
        <p>
          Finally, generalization and specialization was investigated as a third adaptation
approach [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. A generalized workflow is structurally identical to the base workflow but
the semantic descriptions of task and data items are generalized. We generalize a
workflow by considering a set of similar workflows as training samples and employ the
ontology as generalization hierarchy from which generalized semantic descriptions are
selected. The computed generalized cases are added to the workflow repository.
During problem solving, adaptation is performed by specializing a previously generalized
workflow in a manner, best suited to the current query.
        </p>
        <p>
          The adaptation methods just described have also been integrated [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] as shown in
Fig. 3. In particular adaptation cases and adaptation operators can be learned not only
from the available concrete-level cases, but also from cases resulting from abstraction
or generalization. Also, case generalization can be performed on top of abstraction. As
a consequence, a large spectrum of possible ways arise for learning adaptation
knowledge. As a result of the integrated learning process, the workflow repository R consists
of four type of cases: 1. the available concrete cases, 2. generalized cases, 3. abstracted
cases, and 4. generalized abstract cases. The adaptation knowledge A consists of
adaptation operators, adaptation cases, and streams. During problem solving, i.e., when a
new workflow for a given new query must be determined, the most similar
(generalized/abstract) workflow from the workflow repository R is retrieved. Then, during
adaptation the available adaptation knowledge from A is applied in a local search
process in order to achieve an adapted workflow which is most similar to the query.
        </p>
        <p>
          The availability of the previously introduced adaptation methods changes the
utility of the workflows stored within the repository. A workflow with a lower similarity
value during retrieval might more likely be adaptable to the particular problem situation.
Hence, we developed a novel approach for the adaptation-guided retrieval of workflows
[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], aiming at identifying the workflow which can at best be adapted to the particular
situation during retrieval. The approach basically assesses the adaptability of the
workflows by performing several example adaptations.
7
        </p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Implementation and Experimental Evaluation</title>
      <p>
        The approaches developed throughout the whole project have been continuously
integrated in a prototype system called CookingCAKE2 for participation in the Computer
Cooking Contest in 2011 [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ], 2012 [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], 2014 [
        <xref ref-type="bibr" rid="ref15 ref28">15,28</xref>
        ] and 2015 [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Using the
previously sketched retrieval and adaptation methods, CookingCAKE demonstrates the
generation of sandwich recipes considering ingredients and preparation steps that are
desired or undesired. A large number of experimental evaluations have been performed
which are reported in the papers describing the individual methods. In the following,
we show some preliminary experimental results of a preparatory study we performed in
the process of the preparation of a more comprehensive systematic trial. In this
experiment we used a case base of 60 extracted pasta recipe workflows that have been further
improved manually. In a study with human users of CookingCAKE we elaborated 16
realistic queries representing the user’s desires for cooking. CookingCAKE was used
in various conditions (pure retrieval, use of all adaptation methods in isolation, and the
combined adaptation approach) to produce the desired recipe workflow. We compared
the system (see Fig. 4) in the various conditions a) by assessing the similarity of the
resulting solution workflow to the query and b) by asking the users to assess query
fulfillment and quality of the resulting recipes on a 5-point Likert scale. The indicated
values for workflow quality and query fulfillment are the difference resulting from
adaptation, compared to pure retrieval, thus indicating the impact of adaptation. These initial
results indicate that the adaptation methods improve the workflow w.r.t. the degree to
which the requirements in the query are fulfilled. On the other hand, workflow quality
is decreased to a certain degree. Overall, the combined approach performs best and in
particular only leads to a minimal reduction of the quality. These results look
promising, but a final assessment and a clear view of the various benefits and shortcomings of
the methods can only become substantiated after the final trial is completed.
8
      </p>
    </sec>
    <sec id="sec-8">
      <title>Future Work</title>
      <p>The EVER project is currently in its second funding phase (2017 – 2020). During this
phase, we aim at working on four novel issues.
2 https://www.uni-trier.de/index.php?id=40545
8
Overall Impact on Workflow Quality</p>
      <p>and Query Fulfillment
Adaptation
Approach</p>
      <p>
        Combined
Stream-based
Operator-based
Generalization
– Adaptation Quality: While in our previous research, we developed methods that
enable the automatic adaptation of workflows by using adaptation knowledge
auLtoehmrsatuthiclfaülrly acquired by machine lear-n2i-ng methods from workflow repositories, the
WirtschaftsinforomfatitkhIIe adapted workflows is difficult to control. Therefore, we aim at
inquality
vestigating new methods for assessing the quality of automatically adapted
workflows as well as methods to assess the impact of each piece of learned adaptation
knowledge on the resulting workflow quality. This allows to better control which
adaptation knowledge to retain and which to discard.
– Interactivity: The retrieval and adaptation methods developed so far are fully
automatic, i.e., they adapted a retrieved workflow according to a specified change
request (or goal) without further user interaction. However, specifying a workflow
goal or even a change request for an existing workflow in sufficient detail turned out
to be quite difficult. Therefore, we aim at developing new methods for
conversational POCBR [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ] that enable fully interactive problem solving involving retrieval
and adaptation of workflows.
– Transfer Learning: The adaptation methods investigated so far require existing
procedural knowledge of significant volume in order to learn enough adaptation
knowledge. This makes it difficult to address small or newly emerging domains
in which procedural knowledge is still sparse. Therefore, we aim at investigating
whether transfer learning methods can be used to improve learning of adaptation
knowledge by transferring knowledge from a different, but related domain with
substantial procedural knowledge [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
– Exploring New Application Domains: So far, we demonstrated our methods
primarily in the domain of cooking workflows. In the second funding period, we aim
at broadening the experimental basis for the whole project by exploring workflow
and business process model repositories available in existing repository collections.
Furthermore, we will expore the field of scientific text mining workflows in more
detail.
      </p>
      <p>Acknowledgements. This work was funded by the German Research Foundation
(DFG), project numbers BE 1373/3-1, BE 1373/3-3, MI 1455/1-1, MI 1455/2-3.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Aamodt</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Plaza</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Case-based reasoning: foundational issues, methodological variations, and system approaches</article-title>
          .
          <source>AI Communications</source>
          <volume>7</volume>
          (
          <issue>1</issue>
          ),
          <fpage>39</fpage>
          -
          <lpage>59</lpage>
          (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bergmann</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gil</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Similarity Assessment and Efficient Retrieval of Semantic Workfows</article-title>
          .
          <source>Information Systems</source>
          <volume>40</volume>
          ,
          <fpage>115</fpage>
          -
          <lpage>127</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bergmann</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Minor</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schumacher</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Islam</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <source>Cooking CAKE. Presentation and Demonstration at the Computer Cooking Contest at ICCBR</source>
          <year>2012</year>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Bergmann</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , Mu¨ller, G.,
          <string-name>
            <surname>Wittkowsky</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Workflow clustering using semantic similarity measures</article-title>
          .
          <source>In: Timm, I. (ed.) KI 2013: Advances in Artificial Intelligence - 36th Annual German Conference on AI. Lecture Notes in Computer Science</source>
          , vol.
          <volume>8077</volume>
          , pp.
          <fpage>13</fpage>
          -
          <lpage>24</lpage>
          . Springer (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Bergmann</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , Mu¨ller, G.,
          <string-name>
            <surname>Zeyen</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manderscheid</surname>
          </string-name>
          , J.:
          <article-title>Retrieving adaptable cases in process-oriented case-based reasoning</article-title>
          . In: Markov,
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Russell</surname>
          </string-name>
          , I. (eds.)
          <source>Proceedings of the Twenty-Ninth International Florida Artificial Intelligence Research Society Conference, FLAIRS</source>
          <year>2016</year>
          ,
          <string-name>
            <given-names>Key</given-names>
            <surname>Largo</surname>
          </string-name>
          , Florida, May
          <volume>16</volume>
          -18,
          <year>2016</year>
          . pp.
          <fpage>419</fpage>
          -
          <lpage>424</lpage>
          . AAAI Press (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Bergmann</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stromer</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>MAC/FAC retrieval of semantic workflows</article-title>
          . In: BoonthumDenecke,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Youngblood</surname>
          </string-name>
          , G.M. (eds.)
          <source>Proceedings of the Twenty-Sixth International Florida Artificial Intelligence Research Society Conference, FLAIRS</source>
          <year>2013</year>
          ,
          <article-title>St</article-title>
          . Pete Beach,
          <source>Florida. May 22-24</source>
          ,
          <year>2013</year>
          . AAAI Press (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Dufour-Lussier</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ber</surname>
            ,
            <given-names>F.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lieber</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nauer</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Automatic case acquisition from texts for process-oriented case-based reasoning</article-title>
          .
          <source>Inf. Syst</source>
          .
          <volume>40</volume>
          ,
          <fpage>153</fpage>
          -
          <lpage>167</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Kendall-Morwick</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leake</surname>
            ,
            <given-names>D.B.</given-names>
          </string-name>
          :
          <article-title>Facilitating representation and retrieval of structured cases: Principles and toolkit</article-title>
          .
          <source>Inf. Syst</source>
          .
          <volume>40</volume>
          ,
          <fpage>106</fpage>
          -
          <lpage>114</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Lopez</surname>
            <given-names>Mantaras</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>McSherry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Bridge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Leake</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Smyth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Craw</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Faltings</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Maher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.L.</given-names>
            ,
            <surname>Cox</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.T.</given-names>
            ,
            <surname>Forbus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Keane</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Aamodt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Watson</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          :
          <article-title>Retrieval, reuse, revision and retention in case-based reasoning</article-title>
          .
          <source>The Knowledge Engineering Review</source>
          <volume>20</volume>
          (
          <issue>03</issue>
          ),
          <fpage>215</fpage>
          -
          <lpage>240</lpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Minor</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bergmann</surname>
          </string-name>
          , R., G o¨
          <article-title>rg, S.: Case-based adaptation of workflows</article-title>
          .
          <source>Information Systems</source>
          <volume>40</volume>
          ,
          <fpage>142</fpage>
          -
          <lpage>152</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Minor</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bergmann</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , Mu¨ller,
          <string-name>
            <given-names>J.M.</given-names>
            ,
            <surname>Spt</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>On the Transferability of Process-oriented Cases</article-title>
          . In: Goel,
          <string-name>
            <given-names>A.K.</given-names>
            ,
            <surname>Diaz-Agudo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Roth-Berghofer</surname>
          </string-name>
          ,
          <source>T. (eds.) Case-Based Reasoning Research and Development - 24nd International Conference, ICCBR</source>
          <year>2016</year>
          ,
          <article-title>Atlanta</article-title>
          , USA.
          <source>Proceedings. Lecture Notes in Artificial Intelligence</source>
          , vol.
          <volume>9969</volume>
          , pp.
          <fpage>281</fpage>
          -
          <lpage>294</lpage>
          . Springer (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Minor</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , Go¨rg, S.:
          <article-title>Acquiring Adaptation Cases for Scientific Workflows</article-title>
          .
          <source>In: Case-Based Reasoning. Research and Development, 19th International Conference on Case-Based Reasoning, ICCBR 2011. LNCS</source>
          , vol.
          <volume>6880</volume>
          , pp.
          <fpage>166</fpage>
          -
          <lpage>180</lpage>
          . Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Minor</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montani</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Recio-Garc´ıa,
          <string-name>
            <surname>J.A.</surname>
          </string-name>
          :
          <article-title>Process-oriented case-based reasoning</article-title>
          .
          <source>Inf. Syst</source>
          .
          <volume>40</volume>
          ,
          <fpage>103</fpage>
          -
          <lpage>105</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. Mu¨ller, G.,
          <string-name>
            <surname>Bergmann</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>A cluster-based approach to improve similarity-based retrieval for Process-Oriented Case-Based Reasoning</article-title>
          .
          <source>In: 20th European Conference on Artificial Intelligence (ECAI</source>
          <year>2014</year>
          ), IOS Press. pp.
          <fpage>639</fpage>
          -
          <lpage>644</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15. Mu¨ller, G.,
          <string-name>
            <surname>Bergmann</surname>
          </string-name>
          , R.:
          <article-title>Compositional Adaptation of Cooking Recipes using Workflow Streams</article-title>
          . In: Computer Cooking Contest,
          <source>Workshop Proceedings ICCBR 2014</source>
          . Springer (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16. Mu¨ller, G.,
          <string-name>
            <surname>Bergmann</surname>
          </string-name>
          , R.:
          <article-title>Workflow Streams: A Means for Compositional Adaptation in Process-Oriented Case-Based Reasoning</article-title>
          .
          <source>In: Case-Based Reasoning. Research and Development, 22th International Conference on Case-Based Reasoning</source>
          ,
          <string-name>
            <surname>ICCBR</surname>
          </string-name>
          <year>2014</year>
          . pp.
          <fpage>315</fpage>
          -
          <lpage>329</lpage>
          . LNCS 8766, Springer (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17. Mu¨ller, G.,
          <string-name>
            <surname>Bergmann</surname>
          </string-name>
          , R.:
          <article-title>CookingCAKE: A Framework for the adaptation of cooking recipes represented as workflows</article-title>
          . In: Computer Cooking Contest,
          <source>Workshop Proceedings ICCBR 2015</source>
          . Springer (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18. Mu¨ller, G.,
          <string-name>
            <surname>Bergmann</surname>
          </string-name>
          , R.:
          <article-title>Generalization of Workflows in Process-Oriented Case-Based Reasoning</article-title>
          .
          <source>In: Proceedings of the Twenty-Eighth International Florida Artificial Intelligence Research</source>
          Society Conference,
          <string-name>
            <surname>FLAIRS</surname>
          </string-name>
          <year>2015</year>
          . pp.
          <fpage>391</fpage>
          -
          <lpage>396</lpage>
          . AAAI Press, Hollywood (Florida),
          <source>USA</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19. Mu¨ller, G.,
          <string-name>
            <surname>Bergmann</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Learning and Applying Adaptation Operators in Process-Oriented Case-Based Reasoning</article-title>
          .
          <source>In: Case-Based Reasoning. Research and Development, 23th International Conference on Case-Based Reasoning</source>
          ,
          <string-name>
            <surname>ICCBR</surname>
          </string-name>
          <year>2015</year>
          . pp.
          <fpage>259</fpage>
          -
          <lpage>274</lpage>
          . LNCS 9343, Springer (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20. Mu¨ller, G.,
          <string-name>
            <surname>Bergmann</surname>
          </string-name>
          , R.: POQL:
          <article-title>A new query language for process-oriented case-based reasoning</article-title>
          . In: Bergmann,
          <string-name>
            <surname>R.</surname>
          </string-name>
          , Go¨rg,
          <string-name>
            <surname>S.</surname>
          </string-name>
          , Mu¨ller, G. (eds.)
          <source>Proceedings of the LWA</source>
          <year>2015</year>
          <article-title>Workshops: KDML, FGWM, IR, and</article-title>
          <string-name>
            <surname>FGDB</surname>
          </string-name>
          , Trier, Germany, October 7-
          <issue>9</issue>
          ,
          <year>2015</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>1458</volume>
          , pp.
          <fpage>247</fpage>
          -
          <lpage>255</lpage>
          . CEUR-WS.org (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21. Mu¨ller, G.,
          <string-name>
            <surname>Bergmann</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Case completion of workflows for process-oriented case-based reasoning</article-title>
          . In: Goel,
          <string-name>
            <surname>A.K.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D</given-names>
            <surname>´</surname>
          </string-name>
          ıaz-Agudo,
          <string-name>
            <given-names>M.B.</given-names>
            ,
            <surname>Roth-Berghofer</surname>
          </string-name>
          ,
          <source>T. (eds.) Case-Based Reasoning Research and Development - 24th International Conference, ICCBR</source>
          <year>2016</year>
          ,
          <article-title>Atlanta</article-title>
          ,
          <string-name>
            <surname>GA</surname>
          </string-name>
          , USA,
          <source>October 31 - November 2</source>
          ,
          <year>2016</year>
          ,
          <source>Proceedings. Lecture Notes in Computer Science</source>
          , vol.
          <volume>9969</volume>
          , pp.
          <fpage>295</fpage>
          -
          <lpage>310</lpage>
          . Springer (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Plaza</surname>
          </string-name>
          , E.:
          <article-title>Semantics and experience in the future web</article-title>
          . In: Althoff,
          <string-name>
            <given-names>K.D.</given-names>
            ,
            <surname>Bergmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Minor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Hanft</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <source>Advances in case-based reasoning, 9th European conference, ECCBR 2008. Lecture Notes in Artificial Intelligence</source>
          , vol.
          <volume>5239</volume>
          , pp.
          <fpage>44</fpage>
          -
          <lpage>58</lpage>
          . Springer, Berlin (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Schumacher</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Workflow extraction from textual process descriptions</article-title>
          .
          <source>Ph.D. thesis</source>
          , Goethe University Frankfurt am Main (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Schumacher</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Minor</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Extracting control-flow from text</article-title>
          .
          <source>In: Proc. of the 2014 IEEE 15th International Conference on Information Reuse and Integration</source>
          . pp.
          <fpage>203</fpage>
          -
          <lpage>210</lpage>
          . IEEE, San Francisco, California, USA (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Schumacher</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Minor</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Towards a Trace Index Based Workflow Similarity Function</article-title>
          . In: Lutz,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Thielscher</surname>
          </string-name>
          , M. (eds.)
          <source>KI 2014: Advances in Artificial Intelligence - 37th Annual German Conference on AI. LNCS</source>
          , vol.
          <volume>8736</volume>
          , pp.
          <fpage>225</fpage>
          -
          <lpage>230</lpage>
          . Springer (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Schumacher</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Minor</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schulte-Zurhausen</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Extracting and enriching workflows from text</article-title>
          .
          <source>In: Information Reuse and Integration (IRI)</source>
          ,
          <year>2013</year>
          IEEE 14th International Conference on. pp.
          <fpage>285</fpage>
          -
          <lpage>292</lpage>
          . IEEE (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Schumacher</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Minor</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Walter</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bergmann</surname>
          </string-name>
          , R.:
          <article-title>Extraction of Procedural Knowledge from the Web</article-title>
          .
          <source>In: Proc. of the 21st World Wide Web Conference, WWW</source>
          <year>2012</year>
          , Lyon, France,
          <source>April 16-20</source>
          ,
          <year>2012</year>
          (Companion Volume). pp.
          <fpage>739</fpage>
          -
          <lpage>747</lpage>
          . ACM, New York (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28. Spa¨t, A.,
          <string-name>
            <surname>Keppler</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidt</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kohlhase</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lauritzen</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schumacher</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>GoetheShaker - Developing a rating score for automatedevaluation of cocktail recipes</article-title>
          .
          <source>In: Proceedings of the Computer Cooking Contest Workshop at the International Conference on Case-Based Reasoning (ICCBR)</source>
          . pp.
          <fpage>101</fpage>
          -
          <lpage>108</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Walter</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Minor</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bergmann</surname>
          </string-name>
          , R.:
          <article-title>Workflow Extraction from Cooking Recipes</article-title>
          . In: DiazAgudo,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Cordier</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the Computer Cooking Contest Workshop at the International Conference on Case-Based Reasoning (ICCBR</source>
          <year>2011</year>
          ). pp.
          <fpage>207</fpage>
          -
          <lpage>216</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Zeyen</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , Mu¨ller, G.,
          <string-name>
            <surname>Bergmann</surname>
          </string-name>
          , R.:
          <source>Conversational Process-Oriented Case-Based Reasoning. In: Case-Based Reasoning Research and Development - 25th International Conference, ICCBR</source>
          <year>2017</year>
          ,
          <article-title>Trondheim, Norway</article-title>
          .
          <source>Proceedings. Lecture Notes in Artificial Intelligence</source>
          , Springer, accepted for publication (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>