<!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>Web Services and Automated Planning for Intelligent Calendars</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>George Markou</string-name>
          <email>gmarkou@uom.gr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anastasios Alexiadis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ioannis Refanidis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Applied Informatics, University of Macedonia Thessaloniki</institution>
          ,
          <country country="GR">Greece</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper promotes the automated creation of hybrid personal plans, comprising web services and real human activities, to be supported by the next generation of intelligent calendar applications. A prototype work is present-ed, utilizing both atomic web services and composite ones, the latter having been previously generated from a contingent web service composition module, aiming at in-creasing the likelihood of achieving their intended goal. A metric planner generates a plan, giving priority to web service calls over human activities. Then, a scheduler schedules the human activities into the user's calendar, taking into account the ordering constraints that result from the plan. The resulting schedules substitute human activities with web services, thus increasing the user's capacity, his free time, as well as the scheduling options. As a proof of concept we present a case study implementation utilizing existing state-of-theart components.</p>
      </abstract>
      <kwd-group>
        <kwd>web services </kwd>
        <kwd>intelligent calendar </kwd>
        <kwd>personal activities</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Although in the recent past the popularity of paper calendars has steadily declined in
favor of web-based calendar applications like Google Calendar, such applications still
do not provide any means for automated activity scheduling. In that way, users are
forced to decide for themselves whether a particular activity has enough time to be
scheduled alongside another, or whether the distance between the places where the
two activities occur is a prohibiting factor.</p>
      <p>
        This problem was efficiently tackled in our previous work, by SELFPLANNER [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], a
web-based calendar application that combines a rich problem model with a fast
domain-specific scheduler and automatically produces optimized schedules.
SELFPLANNER also uses Google Maps to compute the necessary travelling times
between the activities’ locations, as well as Google Calendar to present the outputted
schedules.
      </p>
      <p>The obvious next step in intelligent calendar applications is to employ planning,
instead of pure scheduling, to achieve the user’s goals. Existing systems, like
SELFPLANNER, rely on the user to select the activities to be included in his plan, with
the system providing only scheduling functionalities. We envision a situation where
intelligent calendar applications (a) support action ontologies, with action descriptions
containing pre-conditions and effects, (b) allow the user to set his goals, (c) know the
user’s state, and (d) employ auto-mated planning to create plans that achieve the
user’s goals.</p>
      <p>An even further step would be to extend intelligent calendar applications so as to
take web services into account. Web services can be considered as normal actions that
can be used to achieve users’ goals or other actions’ preconditions. Incorporating web
services into the action ontology enables the substitution of human activities by web
service calls, thus allowing for more flexible plans, more goals to achieve or just more
free time. As an example of such a setting that is very common in our daily routine
consider this: a person may wish to attend a concert, and for that reason he may insert
a personal activity in his schedule so as to reserve time and remember to buy tickets
for it. To achieve this goal the user is required to physically go to a brick-and-mortar
shop or buy his tickets online: both options re-quire some of his time (obviously,
buying the tickets online requires less time). A more efficient electronic calendar, on the
other hand, would have searched for an alternative - automated - way of achieving
such goals, so as to relieve the user from the burden of manually executing the
necessary actions.</p>
      <p>In this work we propose such an approach; it is based on the integration of web
services with an existing metric planner and an intelligent calendar application,
namely SELFPLANNER. Web services may be simple or composite; in the latter case, a
contingent web service composition module has been used, trying to reduce the
nondeterminism underlying their execution. From the planning perspective, though, web
services are considered deterministic. As a result of the above process, the user’s
schedule contains only the human activities that cannot be completed through the use
of web services, thus relieving him of the extra burden of achieving the rest.</p>
      <p>The rest of the paper is structured as follows: First we present related work; next,
we give a motivating example; then we present our approach and, finally, we
conclude the paper and pose future directions of research.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        SELFPLANNER was the first system to tackle the problem of automated scheduling
personal activities into electronic calendars, using a combination of greedy
optimization algorithm, namely a modified version of the Squeaky Wheel Optimization
(SWO) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], and stochastic local search. SELFPLANNER employs a rich model
supporting temporal domains and preferences, locations, interruptible and periodic activities,
binary constraints and preferences, etc.
      </p>
      <p>
        Bank et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] build directly upon this work, using SWO in addition to a set of
calendar entity types that they propose; in specific, they discriminate between simple
events, multiple choice events, floating events and tasks. Moreover, they incorporate
elements of psychology into the generation of the schedules, by defining preferences
such as that there should be no wasted travel time between events, or that creative
tasks should be split into multiple segments.
      </p>
      <p>
        La Placa, Pigot and Kabanza [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] follow a different approach, by utilizing
Hierarchical Task Network (HTN) Planning [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and focusing on a specific user target group.
Their approach is directed towards people with cognitive impairments, e.g.,
Alzheimer’s disease, and as such, HTN planning, which decomposes tasks into subtasks,
is well suited as it resembles the way medical professional actually plan for their
patients. Moreover, this degree of granularity is dependent on the specific patient, with
information such as his impairment or personality being taken into account.
      </p>
      <p>
        Finally, Berry et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] present Emma, a personalized calendar management tool,
which simultaneously manages calendars from multiple sources, with the main aims
of facilitating the coordination of groups of people, the negotiation of their meeting
times and the (re)scheduling of various events.
      </p>
      <p>
        In regard to non-deterministic web service composition, Kuzu and Cicekli [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]
present a conversion schema from OWL-S to PDDL and utilize an existing PDDL
planner, namely Simplanner [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], to tackle non-determinism, through interleaving planning
and execution. Zou et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] follow a similar approach, albeit to generate a distributed
plan; first, a web service choreography problem that contains explicit user defined
contingencies is translated into a deterministic planning one and then, either FF [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
or SatPlan06 [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] are employed to solve it.
      </p>
      <p>
        Dacosta et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] on the other hand, opt for a stratified method so as to produce
robust plans, which allow for semantic web services that achieve the same tasks. The
approach generates a graph that contains all the possible contingency plans, with each
path in it being a possible execution path, and each child node comprising an
alternative execution possibility. Redundant operations have been removed from the graph,
and the set of paths is ordered from the best – the one containing the smaller number
of web services – to the worst.
      </p>
      <p>
        In our previous work [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] we implemented MAPPPA, a cost sensitive probabilistic
contingent planning approach specifically targeted for automated semantic web
service composition. MAPPPA produces a contingent plan by integrating alternative
deterministic plans previously computed in an anytime fashion from a determinized
version of the original problem. It does so, however, without disregarding the
information that each web service contains in relation to its execution cost and probability
of alternative outcomes, thus, generating considerably more informed plans than other
determinization approaches.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Motivating Example</title>
      <p>Let us imagine a usual week of a Bob, who uses a web-based calendar application to
organize his time. Due to being self-employed, Bob needs to spend all working hours
at his office, to which he commutes every day from his home. Once every week, he
watches a movie, and although he prefers to go to the cinema, sometimes he watches
the movie at home, depending on his work schedule. However, if the movie’s
duration is such that it will end later than 11 pm, he does not desire to watch a movie at
all, as he has to sleep early. Moreover, this week, he will travel on a business trip
abroad; a day before the trip, the day he usually watches a movie, he has to book his
airplane tickets and hotel, as well as to buy a travel guide for the city he will visit.</p>
      <p>In order to schedule these activities and insert them into a calendar, the user has to
define their temporal domain and, if they are interruptible, the minimum and
maximum allowed duration for their parts. Moreover, for each activity, the user has to
declare whether it is periodic or not, as well as if it is bound to specific locations. For
example, the user should define his daily work as a periodic task, with a temporal
domain from 8 a.m. to 5 p.m., and a minimum and maximum duration of its parts – as
he cannot work continuously, e.g., 30 minutes and 2 hours respectively. Watching a
movie is also periodic but non-interruptible, and has a temporal domain set late in the
evening, with a minimum and maximum duration of 90 minutes and 180 minutes
respectively.</p>
      <p>Since the user’s work requires his physical presence, only a human activity can be
placed in his calendar. However, for the rest of the aforementioned tasks, a
combination of human and web services’ activities can be inserted. The user may have to drive
to the cinema, choose among the available movies there and buy the tickets himself.
Alternatively, he may ask for a list of the available movies to be emailed to him, book
the tickets online and then, having saved considerable time, travel to the cinema later.
Another option altogether would be to rent a movie online and watch it at home. As to
the user’s business trip, again, there are various alternative activities; the user may
visit a single tourist agent to book his tickets and hotel; or prefer an online reseller.
He may also require another trip to a bookstore to purchase his travelling guide or
purchase it online and have it sent at home.</p>
      <p>Since these options create a complex problem, containing a multitude of
constraints and preferences, a schedule manually created by a human is usually highly
inefficient. Applications such as SELFPLANNER tackle this problem; however, they
only deal with human activities and, as such, they cannot take advantage of the
opportunities that are offered by the use of web services. In the aforementioned scenario,
since a human activity requires the user to first purchase a movie ticket himself, in
certain situations he may not have had the time to do so, and he would have had to
watch it at home instead. Even worse, if he had to visit a travel agent and a bookstore,
he may not have even had the time to watch a movie at home.</p>
      <p>With the introduction of web services, the user saves the time needed to perform
the actual action of purchasing these services and to travel between locations.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Proposed Approach</title>
      <p>
        This work assumes that web services are semantically annotated and that their
descriptions are present in an online registry; in previous work, we presented such a
registry [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], which, furthermore, provides a translation of each web service to a
PDDL action. Moreover, this registry also contains composite web services fortified
against non-determinism, having been generated by MAPPPA prior to the start of the
scheduling process. Thus, the composite web services used comprise multiple
execution paths achieving the same result, and for this reason can only fail when all the
execution paths fail.
      </p>
      <p>
        Fig. 1 presents the proposed system’s architecture. Initially, we employ an existing
metric planner, namely LPG-td [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]; this step is necessary in order to automate the
planning process as the activities in SELFPLANNER are normally entered by the users.
Instead, in this case, in order to obtain the set of activities that achieve the desired
goal a planner has to be utilized. LPG-td receives as input a planning problem
containing both web services and human activities.
      </p>
      <p>This problem comprises of the translation of the web services from the registry, as
well as a simplified version of the human activities; that is, the locations, durations
and temporal domains of the activities, along with any preferences and constraints in
regard to them are removed. The metric planner does not differentiate between the
two types of activities; as a result, it also treats all web services as deterministic ones,
i.e., as if their intended output (the most probable one) is always outputted. Moreover,
the planner has to take into account that web services are preferred to their human
activities’ counterpart. This is achieved by setting the cost of human activities higher
than that of web services.</p>
      <p>LPG-td is capable of generating a sequence of alternative plans, each being an
improvement – in terms of the specified metric – compared to the previous one; the
plans generated by LPG-td allow for parallel actions and, thus, are very similar to
partial order ones.</p>
      <p>We feed the best generated plan by LPG-td to SELFPLANNER so as to create a
detailed schedule. In case a feasible plan does not exist, the rest of the previously
generated alternative partial order plans are attempted to be scheduled in a similar process.
In order to schedule the activities of the partial order plan, SELFPLANNER employs the
information concerning temporal constraints and preferences (loaded from a separate
activity definition file for a given problem instance), as well as the actual distances
between the activities’ locations as returned by the Google Maps Distance Matrix
API.1 Web services are considered to have an open temporal domain and are not
related to a specific location, as they can be executed at any time and place. Moreover,
they can be scheduled in parallel to human activities. SELFPLANNER can generate
multiple alternative plans; the human activities of the best schedule are uploaded into
the user’s Google calendar.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Future Work</title>
      <p>This paper presents the first steps towards the next generation of intelligent calendar
applications. We propose an approach comprising a contingent web-service
composition system, a partial order metric planner and a scheduler to insert human activities
into a user’s web calendar. The contingent planner is used to create composite web
services, able to achieve complex goals with high probability of success; the metric
planner is used to select an optimized set of activities to achieve a user’s goal,
favoring web service calls than real activities; and, finally, the scheduler automatically
produces an optimized plan based on the user’s constraints and preferences.</p>
      <p>The paper also presents a motivating example along with a – still under work –
implementation. We aim to further improve this implementation, first by providing a
graphical interface, as well as by integrating it with a web service execution platform.
Also, we propose to perform an exploratory evaluation, by providing the - users with
two schedules, one consisting solely of human activities and an equivalent one
comprising both human and web service activities, and having them rate each one online.</p>
      <p>Finally, various research and implementation issues are still open; for example, we
assume that the user’s schedule should only contain the human activities that cannot
be substituted by web services; this is achieved through setting the cost of human
activities higher than that of web services. However, in some cases this may not be
true; employing a web service may incur a (financial) cost that the user does not
prefer over the benefit of not employing the respective human activity. Moreover, a web
service activity may not always provide exactly the same functionality or satisfaction
as its human counterpart; such a case is present in our motivating example, in which a
user prefers to go to the cinema to watch a movie, than watching it at home through
streaming. In this case, however, if the problem is modeled so as to favor the human
activity, it could be impossible to include it in the plan, thus providing the use of a
web service as an alternative plan. Such problems require further investigation.
1 https://developers.google.com/maps/documentation/distancematrix/
Acknowledgment. This research has been co-financed by the European Union
(European Social Fund – ESF) and Greek national funds through the Operational Program
“Education and Lifelong Learning” of the National Strategic Reference Framework
(NSRF) - Research Funding Program: Heracleitus II. Investing in knowledge society
through the European Social Fund.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Refanidis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alexiadis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Deployment and evaluation of SELFPLANNER, an automated individual task management system</article-title>
          .
          <source>Comput. Intell</source>
          .
          <volume>27</volume>
          (
          <issue>1</issue>
          ),
          <fpage>41</fpage>
          -
          <lpage>59</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Joslin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clements</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Squeaky wheel optimization</article-title>
          .
          <source>J. Artif. Intell. Res</source>
          .
          <volume>10</volume>
          ,
          <fpage>353</fpage>
          -
          <lpage>373</lpage>
          (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bank</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cain</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shoham</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suen</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ariely</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Turning personal calendars into scheduling assistants</article-title>
          .
          <source>In: Extended Abstracts of the 30th CHI Conference on Human Factors in Computing Systems</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>La</given-names>
            <surname>Placa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Pigot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Kabanza</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>Assistive planning for people with cognitive impairments</article-title>
          .
          <source>In: Proceedings of the Workshop on Intelligent Systems for Assisted Cognition hosted by the 21st International Joint Conference on Artificial Intelligence</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ghallab</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nau</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Traverso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <source>Automated Planning: Theory and Practice</source>
          . Morgan Kaufmann (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Berry</surname>
            ,
            <given-names>P. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Donneau-Golencer</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duong</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gervasio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peintner</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yorke-Smith</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          :
          <article-title>Evaluating user-adaptive systems: Lessons from experiences with a personalized meeting scheduling assistant</article-title>
          .
          <source>In: Proceedings of the 21st Innovative Applications of Artificial Intelligence Conference</source>
          , pp.
          <fpage>40</fpage>
          -
          <lpage>46</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kuzu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cicekli</surname>
          </string-name>
          , N.:
          <article-title>Dynamic planning approach to automated web service composition</article-title>
          .
          <source>Appl. Artif. Intell</source>
          .
          <volume>36</volume>
          (
          <issue>1</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>28</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Onaindia</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sapena</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sebastia</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marzal</surname>
          </string-name>
          , E.:
          <article-title>SimPlanner: An execution-monitoring system for replanning in dynamic worlds</article-title>
          .
          <source>In: Proceedings of the 10th Portuguese Conference on Artificial Intelligence</source>
          , pp.
          <fpage>393</fpage>
          -
          <lpage>400</lpage>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Zou</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xiang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Towards automated choreographing of web services using planning</article-title>
          .
          <source>In: Proceedings of the 26th AAAI Conference on Artificial Intelligence</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Hoffmann</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>FF: The Fast-Forward Planning System</article-title>
          .
          <source>AI Mag</source>
          .
          <volume>22</volume>
          (
          <issue>3</issue>
          ).
          <fpage>57</fpage>
          -
          <lpage>62</lpage>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Kautz</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Selman</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hoffmann</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>SatPlan: Planning as Satisfiability</article-title>
          .
          <source>In: Proceedings of the 5th International Planning Competition</source>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Dacosta</surname>
            ,
            <given-names>L.A.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pires</surname>
            ,
            <given-names>P.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mattoso</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Automatic Composition of Web Services with Contingency Plans</article-title>
          .
          <source>In: Proceedings of the 2nd International Conference on Web Services Workshop</source>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Markou</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Refanidis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Anytime planning for web service composition via alternative plan merging</article-title>
          .
          <source>In: Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence</source>
          , pp.
          <fpage>91</fpage>
          -
          <lpage>98</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Markou</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Refanidis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Composing semantic web services online and an evaluation framework</article-title>
          .
          <source>Int. J. on Adv. in Internet Tech</source>
          .
          <volume>6</volume>
          (
          <issue>3-4</issue>
          ),
          <fpage>114</fpage>
          -
          <lpage>131</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Gerevini</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saetti</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Serina</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toninelli</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Fast Planning in Domains with Derived Predicates: An Approach Based on Rule-Action Graphs and Local Search</article-title>
          .
          <source>In: Proceedings of the 20th AAAI National Conference on Artificial Intelligence</source>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>