umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Resolving Incompatibilities between Procedural Goals: An Argumentation-based Approach
UTFPR, Curitiba, Brazil.
Umeå University, Faculty of Science and Technology, Department of Computing Science.
UTFPR, Curitiba, Brazil.
IIIA-CSIC, Barcelona, Spain.
Show others and affiliations
2018 (English)In: / [ed] Riccardo De Masellis, Valentin Goranko, 2018Conference paper, Published paper (Refereed)
Abstract [en]

During the deliberation phase in practical reasoning, an intelligent agent generates a set of pursuable goals (or desires) and then selects which of them he commits to achieve (intentions). When several pursuable goals are generated, it may cause that some incompatibilities arise between them. In this work, we focus on the denition, identication and resolution of these incompatibilities. The suggested approach considers the three forms of incompatibility introduced by Castelfranchi and Paglieri, namely the terminal incompatibility, the resources incompatibility and the superuity. We characterise computationally these forms of incompatibility by means of arguments that represent the plans that allow an agent to achieve his goals. The incompatibility between goals is dened based on the conicts between their plans, which are represented by means of attacks in an argumentation framework. For the goals selection, we propose to use abstract argumentation theory by applying argumentation semantics.

Place, publisher, year, edition, pages
2018.
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:umu:diva-152009OAI: oai:DiVA.org:umu-152009DiVA, id: diva2:1250302
Conference
Pre-AAMAS2018 Workshop on Formal Methods and Logical Aspects of Multi-Agent Systems (FMLAMAS 2018), 10 July 2018, Stockholm, Sweden
Available from: 2018-09-23 Created: 2018-09-23 Last updated: 2018-09-26Bibliographically approved

Open Access in DiVA

fulltext(303 kB)23 downloads
File information
File name FULLTEXT01.pdfFile size 303 kBChecksum SHA-512
0f569456be678214f9e3e1a215eca1cee69936fa27e675fdb7fdba12eb17368c76cbba43fd212216679ffd924c6d153578d7b0dcdf2cc56afaa63261fef8c462
Type fulltextMimetype application/pdf

Other links

URL

Authority records BETA

Nieves, Juan Carlos

Search in DiVA

By author/editor
Nieves, Juan Carlos
By organisation
Department of Computing Science
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 23 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 131 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf