<!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>Applications of Spatial and Temporal Reasoning in Cognitive Robotics</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Esra Erdem</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Sabanci University</institution>
          ,
          <addr-line>Istanbul</addr-line>
          ,
          <country country="TR">Turkiye</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Cognitive Robotics, as described by Levesque and Reiter [1], is “the study of the knowledge representation and reasoning problems faced by an autonomous robot (or agent) in a dynamic and incompletely known world.” In general, it is concerned with endowing agents with a wide variety of higher level cognitive functions that involve reasoning, for example, about goals, perception, actions, the mental states of other agents, collaborative task execution. To achieve these objectives, cognitive robotics requires (re)integrating Artificial Intelligence (AI) and thus hybrid methods. In this talk, I will give examples from four diferent cognitive robotics applications to illustrate the need for (re)integrating spatial and temporal reasoning with robotics methods: service robotics, digital forensics, manipulation planning, and robot construction problems. Missing child scenario Consider a shopping mall where several service robots help people with their inquiries and requests. Suppose that two parents are looking for their missing son in a shopping mall and request help from a robot in a food court. The robot has received sightings of the child at the south or west of the pool, and wants to find out the potential whereabouts of the child. Once the robot receives the sightings of the child, they first check whether this information makes sense or not. This can be done, e.g., by formulating the cardinal directional relations between spatial objects in the shopping mall and the sightings of the child, as constraints in Cardinal Directional Calculus (CDC) [2, 3], and by checking its inconsistency with a Qualitative Spatial Reasoning (QSR) system that supports CDC. After the consistency of the gathered information is verified, the robot tries to find out the possible locations of the child that make sense. For that, the robot also needs to consider relevant commonsense knowledge and assumptions, like the following: “Children are generally around the ice-cream truck. The ice-cream truck is by default in the free areas that are to the north, east or northeast of the movie theater.” To represent such default relations about cardinal directions and to integrate reasoning about defaults with qualitative spatial reasoning, we extend CDC by default CDC constraints (called nCDC) and build a QSR system (called nCDC-ASP [4, 5]) on top of it, by utilizing the foundational and practical methods of Answer Set Programming [6, 7, 8] that support nonmonotonic reasoning over defaults [9]. To be able to infer the relevant missing CDC relations and then to express the possible locations of the child to the parents in an understandable way (like the following: “Your child might be to the southeast of the food court and to the east of the park. That is, to the southeast of where you are now.”), we further extend nCDC by inferred CDC constraints and introduce a method in nCDC-ASP to infer missing CDC relations. This example illustrates the need to extend QSR [10] with nonmonotonic reasoning about defaults and inference of relevant missing relations, in order to involve commonsense knowledge and reasoning. Interrogation of suspects Suppose that a robotic investigator receives some camera images of the crime scene, and the interrogation of the suspects by the police, like the following: “Suspect 2: ... I noticed a suitcase in front of the table. There was a knife on the floor, to the right of the body, and in front of the phone.” Considering the digital evidence and the relevant commonsense knowledge (e.g., the phone is generally on the table), the robot wants to check whether Suspect 2 is truthful or not. To be able to perform reasoning about cardinal directions in 3D, we extend nCDC and nCDC-ASP to 3D (called 3D-nCDC and 3D-nCDC-ASP respectively) [11] in the spirit of [12, 13]. Using the reasoner 3D-nCDC-ASP, the robot can check whether the 3D-nCDC constraint network obtained from Suspect 2's statement, digital evidence and commonsense knowledge is consistent or not [14]. Suppose that 3D-nCDC-ASP finds Suspect 2's statement inconsistent with respect to the digital evidence. The investigator asks: Why? For that, we extend the capabilities of 3D-nCDC-ASP further so that it can generate explanations for inconsistencies [11], like the following: “The knife cannot be both below and to the front of the phone, as it is to the right of the body according to the digital evidence.” This example illustrates the need to extend QSR with explanation generation, for trustworthiness.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Manipulation planning Consider, for instance, a robot manipulator (as depicted in the figure below) that
aims to move an object from the right hand side of the table to the left hand side of the table, without colliding
with any obstacle. Once the pick and place actions are described in a planning language, a task plan can be found
by a planner as follows: first pick the object from the right hand side of the table (this action is possible since the
robot’s gripper is empty), and then place it on the left hand side of the table (this action is possible since the left
hand side of the table is clear). However, this plan is not feasible: if the robot proceeds with executing this plan
then it will collide with the obstacles above and the plan will fail.</p>
      <p>
        We introduce a hybrid method [
        <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
        ] to integrate task planning (where the actions are described in a discrete
state space) with feasibility checks (where the motions are described in a continuous configuration space), utilizing
ASP languages and solvers [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] that support semantic attachments [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] on the one hand and the state-of-the-art
feasibility checkers on the other hand. The idea is to embed feasibility checks in action descriptions by semantic
attachments (called external atoms, in ASP) so that the feasibility of actions can be checked externally and as
needed. In the example above, we embed reachability checks as external atoms in the preconditions of a placing
action, that call a motion planner to find out whether there is a collision-free continuous trajectory that the robot
can follow to reach the left hand side of the table from its current state (i.e., while holding the object).
      </p>
      <p>
        We present soundness and completeness results for this hybrid planning method [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], under the connectivity
assumption that relates transitions in the discrete space with trajectories in the continuous space. We illustrate
the applicability and usefulness of this hybrid planning method in various robotic manipulation problems, ranging
from cognitive factories [
        <xref ref-type="bibr" rid="ref20 ref21">20, 21</xref>
        ] to housekeeping [
        <xref ref-type="bibr" rid="ref19 ref22 ref23">22, 23, 19</xref>
        ] and construction [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]. We extend this hybrid
reasoning methodology further to prediction, diagnostic reasoning, explanation generation, and replanning in
the context of execution monitoring of robotic plans under partial observability [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ].
      </p>
      <p>This example (and the applications mentioned above) illustrate the need to integrate temporal reasoning over
states and actions (like task planning), with feasibility checks (like reachability checks via motion planning), for
feasible and safe robotic plan execution.</p>
      <p>Robotic construction Given an initial configuration of blocks of diferent sizes on a table, some goal conditions
(e.g., build a bridge) and an upper bound on a makespan, the robot construction problem asks for (i) a final stable
configuration of blocks stacked on each other that satisfy some specified goal conditions, and (ii) a feasible stack
rearrangement plan to obtain that final configuration from a specified initial configuration of the blocks. The
ifgure below illustrates an example [ 24, Scenario 13], where an initial state is given and a bridge (along with
a plan) is computed. Note that these problems ask for not only a feasible plan but also a feasible goal state.</p>
      <p>M3
M2
M1</p>
      <p>7 units
Initial State</p>
      <p>M7</p>
      <p>M6
M5
M4</p>
      <p>C3
C4
C5</p>
      <p>C1
C2
C6</p>
      <p>C3
C1
M1</p>
      <p>C2
M2</p>
      <p>M7
M3</p>
      <p>M6
7 units
Final State</p>
      <p>C5
M5</p>
      <p>
        C6
C4
M4
Therefore, they require not only reachability checks but also stability checks, and not only for preconditions of
pick and place actions but also for states. Also, these problems ask for plans that make sense in the spirit of [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ],
e.g., that allows concurrency and subassembly construction and manipulation (instead of manipulating one block
at a time) and temporary counterweight and scafolding (for stability of intermediate configurations).
      </p>
      <p>
        We introduce a hybrid method to solve robotic construction problems [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] using ASP, that allows such complex
actions and embeds stability checks (by external atoms via physics engines) in the domain description. A wide
range of benchmark instances are also provided to further future studies in robotic construction, planning, and
kowledge representation.
      </p>
      <p>These examples illustrate the need to extend temporal reasoning over states and actions to allow complex
but commonsensical actions, and to embed stability checks (via simulations by physics engines) in logic-based
representations of actions and change, for feasible and safe robotic construction.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>H.</given-names>
            <surname>Levesque</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Reiter</surname>
          </string-name>
          ,
          <article-title>High-level robotic control: Beyond planning</article-title>
          ,
          <source>in: Working notes of AAAI Spring Symposium on Integrating Robotics Research</source>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>R. K.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Egenhofer</surname>
          </string-name>
          ,
          <article-title>The direction-relation matrix: A representation for directions relations between extended spatial objects, The annual assembly and the summer</article-title>
          retreat of University Consortium for Geographic
          <source>Information Systems Science</source>
          <volume>3</volume>
          (
          <year>1997</year>
          )
          <fpage>95</fpage>
          -
          <lpage>102</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Skiadopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Koubarakis</surname>
          </string-name>
          ,
          <article-title>Composing cardinal direction relations</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>152</volume>
          (
          <year>2004</year>
          )
          <fpage>143</fpage>
          -
          <lpage>171</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Izmirlioglu</surname>
          </string-name>
          , E. Erdem,
          <article-title>Qualitative reasoning about cardinal directions using answer set programming</article-title>
          ,
          <source>in: Proc. of AAAI</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>1880</fpage>
          -
          <lpage>1887</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Izmirlioglu</surname>
          </string-name>
          , E. Erdem,
          <article-title>Qualitative reasoning about 2d cardinal directions using answer set programming</article-title>
          ,
          <source>J. Artif. Intell. Res</source>
          .
          <volume>77</volume>
          (
          <year>2023</year>
          )
          <fpage>1371</fpage>
          -
          <lpage>1453</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>V.</given-names>
            <surname>Marek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Truszczyński</surname>
          </string-name>
          ,
          <article-title>Stable models and an alternative logic programming paradigm</article-title>
          ,
          <source>in: The Logic Programming Paradigm: a 25-Year Perspective</source>
          , Springer Verlag,
          <year>1999</year>
          , pp.
          <fpage>375</fpage>
          -
          <lpage>398</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>I. Niemelä</surname>
          </string-name>
          ,
          <article-title>Logic programs with stable model semantics as a constraint programming paradigm</article-title>
          ,
          <source>Annals of Mathematics and Artificial Intelligence</source>
          <volume>25</volume>
          (
          <year>1999</year>
          )
          <fpage>241</fpage>
          -
          <lpage>273</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lifschitz</surname>
          </string-name>
          ,
          <article-title>Answer set programming and plan generation</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>138</volume>
          (
          <year>2002</year>
          )
          <fpage>39</fpage>
          -
          <lpage>54</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Gelfond</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lifschitz</surname>
          </string-name>
          ,
          <article-title>The stable model semantics for logic programming</article-title>
          ,
          <source>in: Proc. of ICLP</source>
          ,
          <year>1988</year>
          , pp.
          <fpage>1070</fpage>
          -
          <lpage>1080</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A. G.</given-names>
            <surname>Cohn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Renz</surname>
          </string-name>
          ,
          <article-title>Qualitative spatial representation and reasoning, Handbook of Knowledge Representation (</article-title>
          <year>2008</year>
          )
          <fpage>551</fpage>
          -
          <lpage>596</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Izmirlioglu</surname>
          </string-name>
          , E. Erdem,
          <article-title>Reasoning about cardinal directions between 3-dimensional extended objects using answer set programming</article-title>
          ,
          <source>Theory Pract. Log. Program</source>
          .
          <volume>20</volume>
          (
          <year>2020</year>
          )
          <fpage>942</fpage>
          -
          <lpage>957</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          , D. Liu,
          <string-name>
            <given-names>H.</given-names>
            <surname>Jia</surname>
          </string-name>
          ,
          <string-name>
            <surname>C. Zhang,</surname>
          </string-name>
          <article-title>Cardinal direction relations in 3d space</article-title>
          ,
          <source>in: Proc. of KSEM</source>
          ,
          <year>2007</year>
          , pp.
          <fpage>623</fpage>
          -
          <lpage>629</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>R.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <article-title>Reasoning with cardinal directions in 3d space based on block algebra</article-title>
          ,
          <source>DEStech Transactions on Computer Science and Engineering</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Izmirlioglu</surname>
          </string-name>
          , E. Erdem,
          <article-title>Qualitative spatial reasoning for digital forensics: A cardinal directional calculus approach using answer set programming</article-title>
          ,
          <source>in: Proc. of the International Workshop on Applications of AI</source>
          to Forensics (AI2Forensics
          <year>2020</year>
          ),
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>E.</given-names>
            <surname>Erdem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Haspalamutgil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Palaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Patoglu</surname>
          </string-name>
          , T. Uras,
          <article-title>Combining high-level causal reasoning with low-level geometric reasoning and motion planning for robotic manipulation</article-title>
          ,
          <source>in: Proc. of ICRA</source>
          ,
          <year>2011</year>
          , pp.
          <fpage>4575</fpage>
          -
          <lpage>4581</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>E.</given-names>
            <surname>Erdem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Patoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Schüller</surname>
          </string-name>
          ,
          <article-title>A systematic analysis of levels of integration between high-level task planning and low-level feasibility checks</article-title>
          ,
          <source>AI Commun</source>
          .
          <volume>29</volume>
          (
          <year>2016</year>
          )
          <fpage>319</fpage>
          -
          <lpage>349</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>T.</given-names>
            <surname>Eiter</surname>
          </string-name>
          , G. Ianni,
          <string-name>
            <given-names>R.</given-names>
            <surname>Schindlauer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Tompits</surname>
          </string-name>
          ,
          <article-title>A uniform integration of higher-order reasoning and external evaluations in answer-set programming</article-title>
          ,
          <source>in: Proc. of IJCAI</source>
          ,
          <year>2005</year>
          , pp.
          <fpage>90</fpage>
          -
          <lpage>96</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>R. W.</given-names>
            <surname>Weyhrauch</surname>
          </string-name>
          ,
          <article-title>Prolegomena to a theory of mechanized formal reasoning</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>13</volume>
          (
          <year>1980</year>
          )
          <fpage>133</fpage>
          -
          <lpage>170</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A.</given-names>
            <surname>Nouman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Patoglu</surname>
          </string-name>
          , E. Erdem,
          <article-title>Hybrid conditional planning for robotic applications</article-title>
          ,
          <source>Int. J. Robotics Res</source>
          .
          <volume>40</volume>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Z. G.</given-names>
            <surname>Saribatur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Patoglu</surname>
          </string-name>
          , E. Erdem,
          <article-title>Finding optimal feasible global plans for multiple teams of heterogeneous robots using hybrid reasoning: an application to cognitive factories</article-title>
          ,
          <source>Autonomous Robots</source>
          <volume>43</volume>
          (
          <year>2019</year>
          )
          <fpage>213</fpage>
          -
          <lpage>238</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>M.</given-names>
            <surname>Rizwan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Patoglu</surname>
          </string-name>
          , E. Erdem,
          <article-title>Human robot collaborative assembly planning: An answer set programming approach</article-title>
          ,
          <source>Theory Pract. Log. Program</source>
          .
          <volume>20</volume>
          (
          <year>2020</year>
          )
          <fpage>1006</fpage>
          -
          <lpage>1020</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>E.</given-names>
            <surname>Erdem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Aker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Patoglu</surname>
          </string-name>
          ,
          <article-title>Answer set programming for collaborative housekeeping robotics: representation, reasoning, and execution</article-title>
          ,
          <source>Intell. Serv. Robotics</source>
          <volume>5</volume>
          (
          <year>2012</year>
          )
          <fpage>275</fpage>
          -
          <lpage>291</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>G.</given-names>
            <surname>Havur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Ozbilgin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Erdem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Patoglu</surname>
          </string-name>
          ,
          <article-title>Geometric rearrangement of multiple movable objects on cluttered surfaces: A hybrid reasoning approach</article-title>
          ,
          <source>in: Proc. of ICRA</source>
          , IEEE,
          <year>2014</year>
          , pp.
          <fpage>445</fpage>
          -
          <lpage>452</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>F.</given-names>
            <surname>Ahmad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Patoglu</surname>
          </string-name>
          , E. Erdem,
          <article-title>Hybrid planning for challenging construction problems: An answer set programming approach</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>319</volume>
          (
          <year>2023</year>
          )
          <fpage>103902</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>G.</given-names>
            <surname>Coruhlu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Erdem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Patoglu</surname>
          </string-name>
          ,
          <article-title>Explainable robotic plan execution monitoring under partial observability</article-title>
          ,
          <source>IEEE Trans. Robotics</source>
          <volume>38</volume>
          (
          <year>2022</year>
          )
          <fpage>2495</fpage>
          -
          <lpage>2515</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Fahlman</surname>
          </string-name>
          ,
          <article-title>A planning system for robot construction tasks</article-title>
          ,
          <source>Artificial intelligence 5</source>
          (
          <year>1974</year>
          )
          <fpage>1</fpage>
          -
          <lpage>49</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>