umu.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Publications (10 of 49) Show all publications
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
Kampik, T., Nieves, J. C. & Lindgren, H. (2018). Coercion and deception in persuasive technologies. In: Robin Cohen, Murat Sensoy, Timothy J. Norman (Ed.), Proceedings of the 20th International Trust Workshop: . Paper presented at 20th International Trust Workshop (co-located with AAMAS/IJCAI/ECAI/ICML 2018), Stockholm, Sweden, 14 July, 2018 (pp. 38-49). CEUR-WS
Open this publication in new window or tab >>Coercion and deception in persuasive technologies
2018 (English)In: Proceedings of the 20th International Trust Workshop / [ed] Robin Cohen, Murat Sensoy, Timothy J. Norman, CEUR-WS , 2018, p. 38-49Conference paper, Published paper (Refereed)
Abstract [en]

Technologies that shape human behavior are of high societal relevance, both when considering their current impact and their future potential. In information systems research and in behavioral psychology, such technologies are typically referred to as persuasive technologies. Traditional definitions like the ones created by Fogg, and Harjumaa and Oinas-Kukkonen, respectively, limit the scope of persuasive technology to non-coercive, non-deceptive technologies that are explicitly designed for persuasion. In this paper we analyze existing technologies that blur the line between persuasion, deception,and coercion. Based on the insights of the analysis, we lay down an updated definition of persuasive technologies that includes coercive and deceptive forms of persuasion. Our definition also accounts for persuasive functionality that was not designed by the technology developers. We argue that this definition will help highlight ethical and societal challenges related to technologies that shape human behavior and encourage research that solves problems with technology-driven persuasion. Finally, we suggest multidisciplinary research that can help address the challenges our definition implies. The suggestions we provide range from empirical studies to multi-agent system theory.

Place, publisher, year, edition, pages
CEUR-WS, 2018
Series
CEUR Workshop Proceedings, ISSN 1613-0073 ; 2154
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-151230 (URN)2-s2.0-85051397631 (Scopus ID)
Conference
20th International Trust Workshop (co-located with AAMAS/IJCAI/ECAI/ICML 2018), Stockholm, Sweden, 14 July, 2018
Available from: 2018-08-30 Created: 2018-08-30 Last updated: 2018-08-30Bibliographically approved
Nieves, J. C. & Osorio, M. (2018). Extending Well-Founded Semantics with Clark's Completion for Disjunctive Logic Programs. Scientific Programming, Article ID 4157030.
Open this publication in new window or tab >>Extending Well-Founded Semantics with Clark's Completion for Disjunctive Logic Programs
2018 (English)In: Scientific Programming, ISSN 1058-9244, E-ISSN 1875-919X, article id 4157030Article in journal (Refereed) Published
Abstract [en]

In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable semantics (STABLE). For normal programs, this semantics is based on suitable integration of the well-founded semantics (WFS) and the Clark's completion. D3-WFS-DCOMhas the following appealing properties: First, it agrees with STABLE in the sense that it never defines a nonminimal model or a nonminimal supported model. Second, for normal programs it extends WFS. Third, every stable model of a disjunctive program.. is a D3-WFS-DCOM model of P. Fourth, it is constructed using transformation rules accepted by STABLE. We also introduce second semantics that we call D2-WFS-DCOMP. We show that D2-WFS-DCOMP is equivalent to D3-WFS-DCOMP for normal programs but this is not the case for disjunctive programs. We also introduce third new semantics that supports the use of implicit disjunctions. We illustrate how these semantics can be extended to programs including explicit negation, default negation in the head of a clause, and a lub operator, which is a generalization of the aggregation operator setof over arbitrary complete lattices.

Place, publisher, year, edition, pages
Hindawi Publishing Corporation, 2018
National Category
Computer Systems
Identifiers
urn:nbn:se:umu:diva-146463 (URN)10.1155/2018/4157030 (DOI)000427608000001 ()
Available from: 2018-04-10 Created: 2018-04-10 Last updated: 2018-06-09Bibliographically approved
Kampik, T., Nieves, J. C. & Lindgren, H. (2018). Implementing Argumentation-enabled Empathic Agents. In: Slavkovik, Marija (Ed.), Marija Slavkovik (Ed.), Multi-Agent Systems: 16th European Conference, EUMAS 2018, Bergen, Norway, December 6–7, 2018, Revised Selected Papers. Paper presented at EUMAS 2018 (pp. 140-155). Paper presented at EUMAS 2018. Springer Berlin/Heidelberg
Open this publication in new window or tab >>Implementing Argumentation-enabled Empathic Agents
2018 (English)In: Multi-Agent Systems: 16th European Conference, EUMAS 2018, Bergen, Norway, December 6–7, 2018, Revised Selected Papers / [ed] Slavkovik, Marija, Springer Berlin/Heidelberg, 2018, p. 140-155Chapter in book (Refereed)
Abstract [en]

In a previous publication, we introduced the core concepts of empathic agents as agents that use a combination of utility-based and rule-based approaches to resolve conflicts when interacting with other agents in their environment. In this work, we implement proof-of-concept prototypes of empathic agents with the multi-agent systems development framework Jason and apply argumentation theory to extend the previously introduced concepts to account for inconsistencies between the beliefs of different agents. We then analyze the feasibility of different admissible set-based argumentation semantics to resolve these inconsistencies. As a result of the analysis we identify the maximal ideal extension as the most feasible argumentation semantics for the problem in focus.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2018
Series
Lecture Notes in Artificial Intelligence ; 11450
Keywords
Agent Architectures, Agent-oriented Software Engineering, Argumentation
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-156655 (URN)10.1007/978-3-030-14174-5 (DOI)978-3-030-14174-5 (ISBN)
Conference
EUMAS 2018
Available from: 2019-02-21 Created: 2019-02-21 Last updated: 2019-02-22Bibliographically approved
Morveli-Espinoza, M., Nieves, J. C., Possebom, A. & Tacla, C. A. (2018). Resolving Incompatibilities among Procedural Goals under Uncertainty. In: Viviana Mascardi, Alessandro Ricci, Danny Weyns (Ed.), : . Paper presented at 6th International Workshop on Engineering Multi-Agent Systems (EMAS 2018), 14–15 July 2018, Stockholm, Sweden.
Open this publication in new window or tab >>Resolving Incompatibilities among Procedural Goals under Uncertainty
2018 (English)In: / [ed] Viviana Mascardi, Alessandro Ricci, Danny Weyns, 2018Conference paper, Published paper (Refereed)
Abstract [en]

By considering rational agents, we focus on the problem of selecting goals out of a set of incompatible ones. We consider two forms of incompatibility introduced by Castelfranchi and Paglieri, namely the terminal 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 such arguments in order to determine the set of compatible goals. In this settings, we represent a novel strength value defined by a three-dimensional vector determined 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. 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.

Keywords
argumentation, goals selection, uncertainty
National Category
Computer Systems
Identifiers
urn:nbn:se:umu:diva-152008 (URN)
Conference
6th International Workshop on Engineering Multi-Agent Systems (EMAS 2018), 14–15 July 2018, Stockholm, Sweden
Available from: 2018-09-23 Created: 2018-09-23 Last updated: 2018-09-26Bibliographically approved
Morveli Espinoza, M., Nieves, J. C., Possebom, A. T., Puyol-Gruart, J. & Tacla, C. A. (2018). Resolving Incompatibilities between Procedural Goals: An Argumentation-based Approach. In: Riccardo De Masellis, Valentin Goranko (Ed.), : . Paper presented at Pre-AAMAS2018 Workshop on Formal Methods and Logical Aspects of Multi-Agent Systems (FMLAMAS 2018), 10 July 2018, Stockholm, Sweden.
Open this publication in new window or tab >>Resolving Incompatibilities between Procedural Goals: An Argumentation-based Approach
Show others...
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.

National Category
Computer Systems
Identifiers
urn:nbn:se:umu:diva-152009 (URN)
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
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0003-4072-8795

Search in DiVA

Show all publications