<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05242142</id>
  <dt>a</dt>
  <an>05242142</an>
  <augroup>
    <au>Garc{\'\i}a, Diego R.</au>
    <au>Garc{\'\i}a, Alejandro J.</au>
    <au>Simari, Guillermo R.</au>
  </augroup>
  <ti>Defeasible reasoning and partial order planning.</ti>
  <so>Hartmann, Sven (ed.) et al., Foundations of information and knowledge systems. 5th international symposium, FoIKS 2008, Pisa, Italy, February 11--15, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-77683-3/pbk). Lecture Notes in Computer Science 4932, 311-328 (2008).</so>
  <py>2008</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-540-77684-0_21</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This problem affects every aspect of a planning process. We will present an argumentation-based formalism that an agent could use for constructing plans starting from a previously introduced formalism. In such a formalism, agents represent their knowledge about their environment in Defeasible Logic Programming, and have a set of actions they can execute to affect their environment. These actions are defined in combination with a defeasible argumentation formalism. We will analyze the interplay of arguments and actions when constructing plans using Partial Order Planning techniques.</ab>
    <rv></rv>
  </abgroup>
</item>