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
Dealing with Incompatibilities among Procedural Goals under Uncertainty
(Federal University of Technology of Paraná (UTFPR), Curitiba, Brazil.)
Umeå University, Faculty of Science and Technology, Department of Computing Science.ORCID iD: 0000-0003-4072-8795
Federal Institute of Parana, Brazil.
Federal University of Technology of Paraná (UTFPR), Curitiba, Brazil.
2019 (English)In: Inteligencia Artificial. Ibero-American Journal of Artificial Intelligence, ISSN 1137-3601, E-ISSN 1988-3064, Vol. 22, no 64, p. 47-62Article in journal (Refereed) Published
Abstract [en]

By considering rational agents, we focus on the problem of selecting goals out of a set of incompatible ones. We consider three forms of incompatibility introduced by Castelfranchi and Paglieri, namely the terminal, the instrumental (or based on resources), and the superfluity. We represent the agent's plans by means of structured arguments whose premises are pervaded with uncertainty. We measure the strength of these arguments in order to determine the set of compatible goals. We propose two novel ways for calculating the strength of these arguments, depending on the kind of incompatibility thatexists between them. The first one is the logical strength value, it is denoted by a three-dimensional vector, which is calculated from a probabilistic interval associated with each argument. The vector represents the precision of the interval, the location of it, and the combination of precision and location. This type of representation and treatment of the strength of a structured argument has not been defined before by the state of the art. The second way for calculating the strength of the argument is based on the cost of the plans (regarding the necessary resources) and the preference of the goals associated with the plans. Considering our novel approach for measuring the strength of structured arguments, we propose a semantics for the selection of plans and goals that is based on Dung's abstract argumentation theory. Finally, we make a theoretical evaluation of our proposal.

Place, publisher, year, edition, pages
IBERAMIA , 2019. Vol. 22, no 64, p. 47-62
Keywords [sv]
Artificial Intelligence, Formal Argumentation, Autonomous Systems
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:umu:diva-164945DOI: 10.4114/intartif.vol22iss64pp47-62OAI: oai:DiVA.org:umu-164945DiVA, id: diva2:1367934
Available from: 2019-11-05 Created: 2019-11-05 Last updated: 2019-11-19Bibliographically approved

Open Access in DiVA

fulltext(1483 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 1483 kBChecksum SHA-512
70423637fa02866c6b25285532ee2cc90ded4e4bbafa413f94344e80a5721ffd2ad34f973f0b612a63d19d4c04e3be456de91bf2decfe110b50bc99e005c20b4
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Nieves, Juan Carlos

Search in DiVA

By author/editor
Nieves, Juan Carlos
By organisation
Department of Computing Science
In the same journal
Inteligencia Artificial. Ibero-American Journal of Artificial Intelligence
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
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

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 26 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