umu.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Publications (10 of 54) Show all publications
Morveli-Espinoza, M., Nieves, J. C. & Tacla, C. A. (2019). An Imprecise Probability Approach for Abstract Argumentation Based on Credal Sets. In: Kern-Isberner G., Ognjanović Z (Ed.), Symbolic and Quantitative Approaches with Uncertainty: ECSQARU 2019. Paper presented at 15th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2019), Belgrade, Serbia, 18–20 September, 2019 (pp. 39-49). Springer
Open this publication in new window or tab >>An Imprecise Probability Approach for Abstract Argumentation Based on Credal Sets
2019 (English)In: Symbolic and Quantitative Approaches with Uncertainty: ECSQARU 2019 / [ed] Kern-Isberner G., Ognjanović Z, Springer, 2019, p. 39-49Conference paper, Published paper (Refereed)
Abstract [en]

Some abstract argumentation approaches consider that arguments have a degree of uncertainty, which impacts on the degree of uncertainty of the extensions obtained from an abstract argumentation framework (AAF) under a semantics. In these approaches, both the uncertainty of the arguments and of the extensions are modeled by means of precise probability values. However, in many real life situations the exact probabilities values are unknown and sometimes there is a need for aggregating the probability values of different sources. In this paper, we tackle the problem of calculating the degree of uncertainty of the extensions considering that the probability values of the arguments are imprecise. We use credal sets to model the uncertainty values of arguments and from these credal sets, we calculate the lower and upper bounds of the extensions. We study some properties of the suggested approach and illustrate it with an scenario of decision making.

Place, publisher, year, edition, pages
Springer, 2019
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 11726
Keywords
Abstract argumentation, Imprecise probability, Credal sets
National Category
Computer Systems
Identifiers
urn:nbn:se:umu:diva-163618 (URN)10.1007/978-3-030-29765-7_4 (DOI)978-3-030-29764-0 (ISBN)978-3-030-29765-7 (ISBN)
Conference
15th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2019), Belgrade, Serbia, 18–20 September, 2019
Available from: 2019-09-30 Created: 2019-09-30 Last updated: 2019-10-08Bibliographically approved
Nieves, J. C. (2019). Approximating agreements in formal argumentation dialogues. AI Communications, 32, 335-346
Open this publication in new window or tab >>Approximating agreements in formal argumentation dialogues
2019 (English)In: AI Communications, ISSN 0921-7126, E-ISSN 1875-8452, Vol. 32, p. 335-346Article in journal (Refereed) Published
Abstract [en]

In many real applications, to reach an agreement between the participants of a dialogue, which can be for instance a negotiation, is not easy. Indeed, there are application domains such as the medical domain where to reach a consensus among medical professionals is not feasible and might be even regarded as counterproductive. In this paper, we introduce an approach for expressing qualitative preferences between the goals of a dialogue considering ordered disjunction rules. By applying argumentation semantics and degrees of satisfaction of goals, we introduce the so-called dialogue agreement degree. Moreover, by considering sets of dialogue agreement degrees, we define a lattice of agreement degrees. We argue that a lattice of agreement degrees suggests different approximations between the current state of a dialogue and its aimed goals; hence, a lattice of agreement degrees can help to define different heuristics in the settings of strategic argumentation.

Place, publisher, year, edition, pages
IOS Press, 2019
Keywords
Artificial Intelligence
National Category
Computer Systems
Identifiers
urn:nbn:se:umu:diva-162918 (URN)10.3233/AIC-190622 (DOI)
Available from: 2019-09-02 Created: 2019-09-02 Last updated: 2019-10-14Bibliographically approved
Morveli Espinoza, M., Nieves, J. C., Possebom, A. & Tacla, C. A. (2019). Dealing with Incompatibilities among Procedural Goals under Uncertainty. Inteligencia Artificial. Ibero-American Journal of Artificial Intelligence, 22(64), 47-62
Open this publication in new window or tab >>Dealing with Incompatibilities among Procedural Goals under Uncertainty
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
Keywords
Artificial Intelligence, Formal Argumentation, Autonomous Systems
National Category
Computer Systems
Identifiers
urn:nbn:se:umu:diva-164945 (URN)10.4114/intartif.vol22iss64pp47-62 (DOI)
Available from: 2019-11-05 Created: 2019-11-05 Last updated: 2019-11-19Bibliographically approved
Kampik, T., Nieves, J. C. & Lindgren, H. (2019). Empathic autonomous agents (6ed.). In: Danny Weyns, Viviana Mascardi and Alessandro Ricci (Ed.), Engineering multi-agent systems: 6th international workshop, EMAS 2018, Stockholm, Sweden, July 14-15, 2018, revised selected papers (pp. 181-201). Cham: Springer
Open this publication in new window or tab >>Empathic autonomous agents
2019 (English)In: Engineering multi-agent systems: 6th international workshop, EMAS 2018, Stockholm, Sweden, July 14-15, 2018, revised selected papers / [ed] Danny Weyns, Viviana Mascardi and Alessandro Ricci, Cham: Springer, 2019, 6, p. 181-201Chapter in book (Refereed)
Abstract [en]

Identifying and resolving conflicts of interests is a key challenge when designing autonomous agents. For example, such conflicts often occur when complex information systems interact persuasively with humans and are in the future likely to arise in non-human agent-to-agent interaction. We introduce a theoretical framework for an empathic autonomous agent that proactively identifies potential conflicts of interests in interactions with other agents (and humans) by considering their utility functions and comparing them with its own preferences using a system of shared values to find a solution all agents consider acceptable. To illustrate how empathic autonomous agents work, we provide running examples and a simple prototype implementation in a general-purpose programing language. To give a high-level overview of our work, we propose a reasoning-loop architecture for our empathic agent.

Place, publisher, year, edition, pages
Cham: Springer, 2019 Edition: 6
Series
Lecture Notes in Artificial Intelligence
Keywords
Multi-agent systems, Utility theory, Conflicts of interests
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-161633 (URN)10.1007/978-3-030-25693-7_10 (DOI)978-3-030-25693-7 (ISBN)978-3-030-25692-0 (ISBN)
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP)
Available from: 2019-07-16 Created: 2019-07-16 Last updated: 2019-08-19Bibliographically approved
Blusi, M. & Nieves, J. C. (2019). Feasibility and Acceptability of Smart Augmented Reality Assisting Patients with Medication Pillbox Self-Management. Studies in Health Technology and Informatics, 521-525
Open this publication in new window or tab >>Feasibility and Acceptability of Smart Augmented Reality Assisting Patients with Medication Pillbox Self-Management
2019 (English)In: Studies in Health Technology and Informatics, ISSN 0926-9630, E-ISSN 1879-8365, p. 521-525Article in journal (Refereed) Published
Abstract [en]

Complex prescribed medicine regimens require extensive self-management. Handling multiple pills can be confusing; using a pillbox organiser is a common strategy. A smart Medication Coach Intelligent Agent (MCIA) can support patients in handling medicine. The aim of this research was to evaluate the feasibility and acceptability of the MCIA. A prototype was tested with 15 participants, age 17-76, filled a pillbox according to prescription assisted by the MCIA implemented in a Microsoft HoloLens. A quantitative method using questionnaires was applied. Results showed that using the MCIA implemented in an AR-headset, to assist people with prescribed polypharmacy regimen in filling a pillbox, was feasible and acceptable. There was a difference related to age regarding people's willingness to use an AR-headset for medication self-management. People older than 65 felt less comfortable using the technology and were also more hesitant to use the technology than those under 65.

Keywords
Self-Management, Artificial Intelligence, Polypharmacy
National Category
Medical Equipment Engineering
Identifiers
urn:nbn:se:umu:diva-162916 (URN)10.3233/SHTI190277 (DOI)
Available from: 2019-09-02 Created: 2019-09-02 Last updated: 2019-09-03Bibliographically approved
Kampik, T. & Nieves, J. C. (2019). JS-son - A Minimal JavaScript BDI Agent Library. In: EMAS 2019: Accepted Papers. Paper presented at 7th International Workshop on Engineering Multi-Agent Systems (EMAS 2019), May 13-14, 2019. Centre for Autonomous systems technology, University of Liverpool
Open this publication in new window or tab >>JS-son - A Minimal JavaScript BDI Agent Library
2019 (English)In: EMAS 2019: Accepted Papers, Centre for Autonomous systems technology, University of Liverpool , 2019Conference paper, Published paper (Other academic)
Abstract [en]

There is a multitude of agent-oriented software engineering frame-works available, most of them produced by the academic multi-agent systemscommunity. However, these frameworks often impose programming paradigmson their users that are hard to learn for engineers who are used to modern high-level programming languages such as JavaScript and Python. To show how theadoption of agent-oriented programming by the software engineering mainstreamcan be facilitated, we provide an early, simplistic JavaScript library prototype forimplementing belief-desire-intention (BDI) agents. The library focuses on thecore BDI concepts and refrains from imposing further restrictions on the pro-gramming approach. To illustrate its usefulness, we demonstrate how the librarycan be used for multi-agent systems simulations on the web, as well as embeddedin Python-based data science tools.

Place, publisher, year, edition, pages
Centre for Autonomous systems technology, University of Liverpool, 2019
Keywords
Reactive Agents, Belief-Desire-Intention, Multi-agent Systems
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-159932 (URN)
Conference
7th International Workshop on Engineering Multi-Agent Systems (EMAS 2019), May 13-14, 2019
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP)
Available from: 2019-06-10 Created: 2019-06-10 Last updated: 2019-06-13Bibliographically approved
Ingeson, M., Blusi, M. & Nieves, J. C. (2019). Microsoft Hololens: A mHealth Solution for Medication Adherence. In: F. Koch et. al. (Ed.), Koch F. et al. (Ed.), Artificial Intelligence in Health: First International Workshop, AIH 2018, Stockholm, Sweden, 13-14 July, 2018, Revised Selected Papers. Paper presented at Artificial Intelligence in Health, First International Workshop, AIH 2018, Stockholm, Sweden, 13-14 July, 2018 (pp. 99-115). Springer
Open this publication in new window or tab >>Microsoft Hololens: A mHealth Solution for Medication Adherence
2019 (English)In: Artificial Intelligence in Health: First International Workshop, AIH 2018, Stockholm, Sweden, 13-14 July, 2018, Revised Selected Papers / [ed] Koch F. et al., Springer, 2019, p. 99-115Conference paper, Published paper (Refereed)
Abstract [en]

The aim of this paper is to introduce a smart mHealth application based on the augmented reality (AR)-paradigm that can support patients with common problems, related to management of their medication. This smart mHealth application is designed and implemented as a medication coach intelligent agent, called Medication Coach Intelligent Agent (MCIA). The MCIA has to manage different types of information such as the medication plan (medication regime) of the patients, medication restrictions, as well as the patient’s preferences and sensor input data from an AR-headset. Considering all this information, the MCIA leads with holistic decisions in order to offer personalized and unobtrusive interventions, in an autonomous way, to the patients. From a long-term perspective, the MCIA should also evaluate its performance over time and adapt in order to improve its interventions with the patients. To show the feasibility of our approach, a proof-of-concept prototype was implemented and evaluated. In this proof-of-concept prototype, the MCIA has been embodied as a smart augmented reality (AR)-mHealth application in the settings of a Microsoft HoloLens. The results show a high potential for using the MCIA in real settings.

Place, publisher, year, edition, pages
Springer, 2019
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 11326
Keywords
Artificial Intelligence, Public Health, Medicine
National Category
Computer Systems
Identifiers
urn:nbn:se:umu:diva-159332 (URN)10.1007/978-3-030-12738-1_8 (DOI)2-s2.0-85062494937 (Scopus ID)978-3-030-12737-4 (ISBN)978-3-030-12738-1 (ISBN)
Conference
Artificial Intelligence in Health, First International Workshop, AIH 2018, Stockholm, Sweden, 13-14 July, 2018
Available from: 2019-05-24 Created: 2019-05-24 Last updated: 2019-06-17Bibliographically approved
Oetsch, J. & Nieves, J. C. (2019). Stable-Ordered Models for Propositional Theories with Order Operators. In: Francesco Calimeri, Nicola LeoneMarco Manna (Ed.), Calimeri, Francesco; Leone, Nicola; Manna, Marco (Ed.), Logics in Artificial Intelligence: JELIA 2019. Paper presented at 16th European Conference on Logics in Artificial Intelligence, JELIA 2019, Rende, Italy, 7-11 May, 2019 (pp. 794-802). Springer
Open this publication in new window or tab >>Stable-Ordered Models for Propositional Theories with Order Operators
2019 (English)In: Logics in Artificial Intelligence: JELIA 2019 / [ed] Calimeri, Francesco; Leone, Nicola; Manna, Marco, Springer, 2019, p. 794-802Conference paper, Published paper (Refereed)
Abstract [en]

The stable-model semantics has been generalised from logic programs to arbitrary theories. We explore a further generalisation and consider sequences of atoms as models instead of sets. The language is extended by suitable order operators to access this additional information. We recently introduced an extension of classical logic by a single order operator with a temporal interpretation for activity reasoning. The logic envisaged here is a nonmonotonic version thereof. Our definition of what we call stable-ordered models is based on the stable-model semantics for theories due to Ferraris and Lifschitz with the necessary changes. Compared to related nonmonotonic versions of temporal logics, our approach is less costly as checking model existence remains at the second level of the polynomial hierarchy. We demonstrate versatile applications from activity reasoning, combinatorial testing, debugging concurrent programs, and digital forensics.

Place, publisher, year, edition, pages
Springer, 2019
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 11468
Keywords
Artificial intelligence, Formal methods, Logic, Stable-model semantics, Temporal logic, Nonmonotonic reasoning, Knowledge representation
National Category
Computer Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-159333 (URN)10.1007/978-3-030-19570-0_51 (DOI)2-s2.0-85065965824 (Scopus ID)978-3-030-19569-4 (ISBN)978-3-030-19570-0 (ISBN)
Conference
16th European Conference on Logics in Artificial Intelligence, JELIA 2019, Rende, Italy, 7-11 May, 2019
Available from: 2019-05-24 Created: 2019-05-24 Last updated: 2019-06-13Bibliographically approved
Guerrero, E., Nieves, J. C., Sandlund, M. & Lindgren, H. (2018). Activity qualifiers using an argument-based construction. Knowledge and Information Systems, 54(3), 633-658
Open this publication in new window or tab >>Activity qualifiers using an argument-based construction
2018 (English)In: Knowledge and Information Systems, ISSN 0219-1377, E-ISSN 0219-3116, Vol. 54, no 3, p. 633-658Article in journal (Refereed) Published
Abstract [en]

Based on an argumentation theory approach, we present a novel method for evaluating complex goal-based activities by generalizing a notion of qualifier defined in the health domain. Three instances of the general qualifier are proposed: Performance, Actuation and Capacity; the first one evaluates what a person does, the second how an individual follows an action plan, and the third one how "well" or "bad" an activity is executed. Qualifiers are intended to be used by autonomous systems for evaluating human activity. We exemplify our approach using a health domain assessment protocol. Main results of this test show a partial correlation between ambiguities assessed by experts and our argument-based approach; and a multi-dimensional perspective how an activity is executed when a combined evaluation of qualifiers is used. This last outcome was interesting for some therapists consulted. Results also show differences between values of qualifiers using different argumentation semantics; two scenarios were proposed by therapist for using different semantics: preliminary activity screening and time-span follow-up evaluation.

Place, publisher, year, edition, pages
Springer, 2018
Keywords
Human activity, Argumentation theory, Logic programming, Performance Capacity, Activity evaluation
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-141040 (URN)10.1007/s10115-017-1112-7 (DOI)000425010800006 ()
Available from: 2017-10-23 Created: 2017-10-23 Last updated: 2018-06-09Bibliographically approved
Nieves, J. C. (2018). Approximating agreements in argumentation dialogues. In: Francesco Belardinelli, Estefanía Argente (Ed.), Francesco Belardinelli, Estefanía Argente (Ed.), Multi-agent systems and agreement technologies: 15th European conference, EUMAS 2017, and 5th international conference, AT 2017, Evry, France, December 14-15, 2017, revised selected papers. Paper presented at 15th European Conference, EUMAS 2017, and 5th International Conference, AT 2017, Evry, France, December 14-15, 2017 (pp. 501-515). Springer
Open this publication in new window or tab >>Approximating agreements in argumentation dialogues
2018 (English)In: Multi-agent systems and agreement technologies: 15th European conference, EUMAS 2017, and 5th international conference, AT 2017, Evry, France, December 14-15, 2017, revised selected papers / [ed] Francesco Belardinelli, Estefanía Argente, Springer, 2018, p. 501-515Conference paper, Published paper (Refereed)
Abstract [en]

In many real applications, to reach an agreement between the participants of a dialogue, which can be for instance a negotiation, is not easy. Indeed, there are application domains such as the medical domain where to have a consensus among medical professionals is not feasible and might even be regarded as counterproductive. In this paper, we introduce an approach for expressing goals of a dialogue considering ordered disjunction rules. By applying argumentation semantics and degrees of satisfaction of goals, we introduce the so-called dialogue agreement degree. Moreover, by considering sets of dialogue agreement degrees, we define a lattice of agreement degrees. We argue that a lattice of agreement degrees suggests different approximations between the current state of a dialogue and its aimed goals. Indeed, a lattice of agreement degrees can show evidence about whether or not it is acceptable to dismiss goals in order to maximize agreements regarding other goals.

Place, publisher, year, edition, pages
Springer, 2018
Series
Lecture Notes in Computer Science, ISSN 0302-9743
Keywords
Formal Argumentation, non-monotonic reasoning, autonomous agents
National Category
Computer Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-152766 (URN)10.1007/978-3-030-01713-2_35 (DOI)978-3-030-01712-5 (ISBN)978-3-030-01713-2 (ISBN)
Conference
15th European Conference, EUMAS 2017, and 5th International Conference, AT 2017, Evry, France, December 14-15, 2017
Available from: 2018-10-22 Created: 2018-10-22 Last updated: 2019-01-16Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0003-4072-8795

Search in DiVA

Show all publications