umu.sePublications
Change search
Refine search result
12 1 - 50 of 53
CiteExportLink to result list
Permanent 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
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Baskar, Jayalakshmi
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Janols, Rebecka
    Umeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Medicine, Department of Community Medicine and Rehabilitation.
    Guerrero, Esteban
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    A Multipurpose Goal Model for Personalised Digital Coaching2017In: Agents and Multi-Agent Systems for Health Care: 10th International Workshop, A2HC 2017, São Paulo, Brazil, May 8, 2017, and International Workshop, A-HEALTH 2017, Porto, Portugal, June 21, 2017, Revised and Extended Selected Papers, Springer, 2017, Vol. 10685, p. 94-116Conference paper (Refereed)
    Abstract [en]

    Supporting human actors in daily living activities for improving health and wellbeing is a fundamental goal for assistive technology. The personalisation of the support provided by assistive technology in the form of digital coaching requires user models that handle potentially conflicting goals and motives. The aim of this research is to extend a motivational model implemented in an assistive technology, into a multipurpose motivational model for the human actor who is to be supported, which can be translated into a multipurpose goal model for a team of assistive agents. A team of assistive agents is outlined with supplementary goals following the human’s different properties. A method for generating multipurpose arguments relating to different motives were developed, and implemented in a human-agent dialogue system. The results are exemplified based on a use case from an earlier pilot user study of the assistive technology. Future work includes user studies to validate the model.

  • 2.
    Blusi, Madeleine
    et al.
    Umeå University, Faculty of Medicine, Department of Community Medicine and Rehabilitation. Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Feasibility and Acceptability of Smart Augmented Reality Assisting Patients with Medication Pillbox Self-Management2019In: Studies in Health Technology and Informatics, ISSN 0926-9630, E-ISSN 1879-8365, p. 521-525Article in journal (Refereed)
    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.

  • 3. Confalonieri, Roberto
    et al.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Osorio, Mauricio
    Vazquez-Salceda, Javier
    Dealing with explicit preferences and uncertainty in answer set programming2012In: Annals of Mathematics and Artificial Intelligence, ISSN 1012-2443, E-ISSN 1573-7470, Vol. 65, no 2-3, p. 159-198Article in journal (Refereed)
    Abstract [en]

    In this paper, we show how the formalism of Logic Programs with Ordered Disjunction (LPODs) and Possibilistic Answer Set Programming (PASP) can be merged into the single framework of Logic Programs with Possibilistic Ordered Disjunction (LPPODs). The LPPODs framework embeds in a unified way several aspects of common-sense reasoning, nonmonotonocity, preferences, and uncertainty, where each part is underpinned by a well established formalism. On one hand, from LPODs it inherits the distinctive feature of expressing context-dependent qualitative preferences among different alternatives (modeled as the atoms of a logic program). On the other hand, PASP allows for qualitative certainty statements about the rules themselves (modeled as necessity values according to possibilistic logic) to be captured. In this way, the LPPODs framework supports a reasoning which is nonmonotonic, preference- and uncertainty-aware. The LPPODs syntax allows for the specification of (1) preferences among the exceptions to default rules, and (2) necessity values about the certainty of program rules. As a result, preferences and uncertainty can be used to select the preferred uncertain default rules of an LPPOD and, consequently, to order its possibilistic answer sets. Furthermore, we describe the implementation of an ASP-based solver able to compute the LPPODs semantics.

  • 4. Espinoza, Angelina
    et al.
    Penya, Yoseba
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ortega, Mariano
    Pena, Aitor
    Rodriguez, Daniel
    Supporting Business Workflows in Smart Grids: An Intelligent Nodes-Based Approach2013In: IEEE Transactions on Industrial Informatics, ISSN 1551-3203, E-ISSN 1941-0050, Vol. 9, no 3, p. 1384-1397Article in journal (Refereed)
    Abstract [en]

    This paper presents an application of business intelligence (BI) for electricity management systems in the context of the Smart Grid domain. Combining semantic web technologies (SWT) and elements of grid computing (GC), we have designed a distributed architecture of intelligent nodes, which are called power grid distributed nodes (PGDINs). This distributed architecture supports the majority of the grid management activities in an intelligent and collaborative way by means of distributed processing of semantic data. A node collaborative scheme is defined based on logical states that each node presents according to the events occurring in the grid. A specific BPEL business-workflow is formally defined for each logical state, based on the node's knowledge base (an electrical model) and the distributed data. The introduced core workflows allow the potential grid behavior to be predefined when a business requirement is triggered. Thus, this approach supports the grid to react and reach over again a stable state, which is defined as a working state that facilitates the provision of the required business tasks. We have validated our approach with the simulation of a well-known use case, the energy balancing verification, fed with real data from the Spanish electrical grid.

  • 5.
    Gaggl, Sarah Alice
    et al.
    Technische Universität Dresden, Germany.
    Nieves, Juan CarlosUmeå University, Faculty of Science and Technology, Department of Computing Science.Strass, HannesUniversity of Leipzig, Germany.
    Arg-LPNMR 2016 proceedings: First International Workshop on Argumentation in Logic Programming and Non-Monotonic Reasoning2016Collection (editor) (Refereed)
    Abstract [en]

    This volume contains the papers presented at Arg-LPNMR 2016: First International Workshop on Argumentation in Logic Programming and Nonmonotonic Reasoning held on July 8-10, 2016 in New York City, NY.

  • 6.
    Gaggl, Sarah Alice
    et al.
    Technische Universität Dresden, Germany.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Strass, Hannes
    Leipzig University, Germany.
    Torroni, Paolo
    University of Bologna, Italy.
    Preface: Argumentation and Logic Programming (Revised Selected Papers of ArgLP 2015)2017In: Fundamenta Informaticae, ISSN 0169-2968, E-ISSN 1875-8681, Vol. 155, no 3Article in journal (Other academic)
  • 7. Garcia-Gasulla, Dario
    et al.
    Poch, Mane
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Cortes, Ulises
    Turon, Claudia
    A logic-based environmental decision support system for the management of horizontal subsurface constructed wetlands2012In: Ecological Engineering: The Journal of Ecotechnology, ISSN 0925-8574, E-ISSN 1872-6992, Vol. 47, p. 44-55Article in journal (Refereed)
    Abstract [en]

    The use of Horizontal Subsurface Constructed Wetlands (HSCWs) for treating wastewaters in small communities has increased in the last years due to HSCW's ecological singularities. Unfortunately, the same singularities that differentiate HSCWs complicate any attempt to develop models and produce generic decision-support systems for them. Classical mathematical and statistical approaches used in other Wastewater Treatment Plants do not properly fit the particularities of HSCW and provide little insight in the domain of HSCW. We introduce a novel approach based on logic-based declarative specifications, i.e. non-monotonic causal logic, to capture explicit and implicit knowledge about HSCWs. By expressing all the relevant aspects of a HSCW in a declarative way, we produce a logic-based model which captures features that other approaches fail to formalize. At the end, we produce a complete decision-support system based on that model and test it against a set of realistic scenarios validated by experts. We discuss in which aspects this approach performs better than the most commonly proposed solutions in the bibliography and why it does so. (C) 2012 Elsevier B.V. All rights reserved.

  • 8.
    Guerrero, Esteban
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    ALI, an ambient assisted living system for supporting behavior change2013In: VIII Workshop on Agents Applied in Health Care (A2HC 2013), 2013, p. 81-92Conference paper (Refereed)
  • 9.
    Guerrero, Esteban
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    ALI, an Assisted Living System Based on a Human-Centric Argument-Based Decision Making Framework2013In: 13th Workshop on Computational Models of Natural Arguments (CMNA 2013), 2013, p. 46-51Conference paper (Refereed)
  • 10.
    Guerrero, Esteban
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    ALI: an assisted living system for persons with mild cognitive impairment2013In: 2013 IEEE 26th International symposium on computer-based medical systems (CBMS), 2013, p. 526-527Conference paper (Refereed)
    Abstract [en]

    We introduce the Assisted Living system ALI, which is a novel approach to providing assistance and support in activities of daily life. We integrate a human behavior theory with a default reasoning decision making framework. This integration allows us to model a decision making problem from a human activity centric point of view and at the same time, formalize these elements using a possibilistic argumentation theory. ALI sends personalized notifications suggesting the most suitable activities to perform and determines what activities were performed during a time period.

  • 11.
    Guerrero, Esteban
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    ALI: an Assisted Living System for Persons with Mild Cognitive Impairment2013In: 26th IEEE International Symposium on Computer-Based Medical Systems (CBMS 2013), IEEE Computer Society, 2013, p. 526-527Conference paper (Refereed)
    Abstract [en]

    We introduce the Assisted Living system ALI, which is a novel approach to providing assistance and support in activities of daily life. We integrate a human behavior theory with a default reasoning decision making framework. This integration allows us to model a decision making problem from a human activity centric point of view and at the same time, formalize these elements using a possibilistic argumentation theory. ALI sends personalized notifications suggesting the most suitable activities to perform and determines what activities were performed during a time period.

  • 12.
    Guerrero, Esteban
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    An activity-centric argumentation framework for assistive technology aimed at improving health2016In: Argument & Computation, ISSN 1946-2174, Vol. 7, no 1, p. 5-33Article in journal (Refereed)
    Abstract [en]

    Tailoring assistive systems for guiding and monitoring an individual in daily living activities is a complex task. This paper presents ALI, an assistive system combining a formal possibilistic argumentation system and an informal model of human activity: the Cultural-Historic Activity Theory, facilitating the delivery of tailored advices to a human actor. We follow an activity-centric approach, taking into consideration the human’s motives, goals and prioritized actions. ALI tracks a person in order to I) determine what activities were performed over a period of time (activity recognition tracking), and II) send personalized notifications suggesting the most suitable activities to perform (decision-making monitoring). The ALI system was evaluated in a formative pilot study related to promote social activities and physical exercise.

  • 13.
    Guerrero, Esteban
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Arguing through the well-founded semantics: an argumentation engine2014Article in journal (Refereed)
  • 14.
    Guerrero, Esteban
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Semantic-based construction of arguments: an answer set programming approach2015In: International Journal of Approximate Reasoning, ISSN 0888-613X, E-ISSN 1873-4731, Vol. 64, p. 54-74Article in journal (Refereed)
    Abstract [en]

    In this paper, we introduce an argumentation approach which takes an extended logic program as input and gives a set of arguments with the respective disagreements among them as output. We establish the notion of an argument under the Well-Founded semantics and Stable semantics inferences, allowing us to identify arguments with stratified programs as support, even when the input for the argument engine is a non-stratified program. We propose a set of rationality postulates for argument-based systems under extended logic programs, which are based on a definition of closure for a set of clauses that consider the well-known Gelfond-Lifschitz reduction. We establish the conditions under which our approach satisfies these principles. In addition, we present a standalone argumentation-tool based on the XSB system which implements our argumentation approach.

  • 15.
    Guerrero, Esteban
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Sandlund, Marlene
    Umeå University, Faculty of Medicine, Department of Community Medicine and Rehabilitation, Physiotherapy.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Activity qualifiers in an argumentation framework as instruments for agents when evaluating human activity2016In: Advances in Practical Applications of Scalable Multi-agent Systems. The PAAMS Collection: 14th International Conference, PAAMS 2016, Sevilla, Spain, June 1-3, 2016, Proceedings / [ed] Yves Demazeau, Takayuki Ito, Javier Bajo, Maria José Escalona, Springer, 2016, Vol. 9662, p. 133-144Conference paper (Other academic)
    Abstract [en]

    Theoretical frameworks have been developed for enabling software agents to evaluate simple activities such as walking and sitting. However, such frameworks typically do not include methods for how practically dealing with uncertain sensor information. We developed an argument-based method for evaluating complex goal-based activities by adapting two qualifiers: Performance and Capacity defined in the health domain. The first one evaluates what a person does, and the second one how "well" or "bad" an activity is executed. Our aim is to deal with uncertainty and inconsistent information; generate consistent hypotheses about the activity execution; and resemble an expert therapist judgment, where an initial hypothesis assessment can be retracted under new evidence. We conducted a pilot test in order to evaluate our approach using a Physiotherapy assessment test as a goal-based activity. Results show that skeptic argumentation semantics are may be useful for discriminating individuals without physical issues by considering Performance and Capacity; conversely, credulous semantics may be suitable for obtaining information in the evaluation of activity, which an intelligent agent may use for providing personalized assistance in an ambient assisted living environment.

  • 16.
    Guerrero, Esteban
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Sandlund, Marlene
    Umeå University, Faculty of Medicine, Department of Community Medicine and Rehabilitation, Physiotherapy.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Activity qualifiers using an argument-based construction2018In: Knowledge and Information Systems, ISSN 0219-1377, E-ISSN 0219-3116, Vol. 54, no 3, p. 633-658Article in journal (Refereed)
    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.

  • 17.
    Ingeson, Martin
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Blusi, Madeleine
    Umeå University, Faculty of Medicine, Department of Community Medicine and Rehabilitation.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Microsoft Hololens: A mHealth Solution for Medication Adherence2019In: 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 (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.

  • 18.
    Kampik, Timotheus
    et al.
    Umeå University.
    Nieves, Juan Carlos
    Umeå University.
    JS-son - A Minimal JavaScript BDI Agent Library2019In: EMAS 2019: Accepted Papers, Centre for Autonomous systems technology, University of Liverpool , 2019Conference 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.

  • 19.
    Kampik, Timotheus
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Coercion and deception in persuasive technologies2018In: Proceedings of the 20th International Trust Workshop / [ed] Robin Cohen, Murat Sensoy, Timothy J. Norman, CEUR-WS , 2018, p. 38-49Conference 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.

  • 20.
    Kampik, Timotheus
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Empathic autonomous agents2019In: 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.

  • 21.
    Kampik, Timotheus
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Implementing Argumentation-enabled Empathic Agents2018In: 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.

    The full text will be freely available from 2020-01-01 00:00
  • 22.
    Kampik, Timotheus
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Towards empathic autonomous agents2018In: / [ed] Viviana Mascardi, Alessandro Ricci, Danny Weyns, 2018Conference paper (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 work towards a theoretical framework for an empathic autonomous agent that proactively identifies potential conflicts of interests in interactions with other agents (and humans) byl earning 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 provide a high-level overview of our work, we propose a reasoning-loop architecture to address the problem in focus. To realize specific components of the architecture, we suggest applying existing concepts in argumentation and utility theory. Reinforcement learning methods can be used by the agent to learn from and interact with its environment.

  • 23.
    Lindgren, Helena
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Baskar, Jayalakshmi
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Guerrero, Esteban
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Janols, Rebecka
    Umeå University, Faculty of Medicine, Department of Community Medicine and Rehabilitation.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Towards a Multipurpose Goal Model for Personalised Digital Coaching2017In: Agents and Multi-Agent Systems for Health Care: 10th International Workshop, A2HC 2017, São Paulo, Brazil, May 8, 2017, and International Workshop, A-HEALTH 2017, Porto, Portugal, June 21, 2017, Revised and Extended Selected Papers, Springer, 2017, p. 94-116Conference paper (Refereed)
    Abstract [en]

    Supporting human actors in daily living activities for improv- ing health and wellbeing is a fundamental goal for assistive technology. The personalization of the support provided by assistive technology in the form of digital coaching requires user models that handle potentially conflicting goals and motives. The aim of this research is to extend a motivational model implemented in an assistive technology, and outline a team of assistive agents with supplementary goals following the human’s different properties, orchestrated by a companion agent based on the multipurpose motivational model for the human actor who is to be supported. The multi- purpose motivational model and supportive arguments relating to different motives are exemplified based on a use case from an earlier pilot user study of the assistive technology. Future work includes user studies to validate the model.

  • 24.
    Lindgren, Helena
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Baskar, Jayalakshmi
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Guerrero, Esteban
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nilsson, Ingeborg
    Umeå University, Faculty of Medicine, Department of Community Medicine and Rehabilitation.
    Yan, Chunli
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Computer-Supported Assessment for Tailoring Assistive Technology2016In: DH'16: PROCEEDINGS OF THE 2016 DIGITAL HEALTH CONFERENCE, New York: Association for Computing Machinery (ACM), 2016, p. 1-10Conference paper (Refereed)
    Abstract [en]

    The main purpose of assistive technology is to support an individual's daily activities, in order to increase ability, autonomy, relatedness and quality of life. The aim for the work presented in this article is to develop automated methods to tailor the behavior of the assistive technology for the purpose to provide just-in-time, adaptive interventions targeting multiple domains. This requires methods for representing and updating the user model, including goals, preferences, abilities, activity and its situation. We focus the assessment and intervention tasks typically performed by therapists and provide knowledge-based technology for supporting the process. A formative evaluation study was conducted as a part of a participatory action research process, involving two rehabilitation experts, two young individuals and one senior individual as end-user participants, in addition to knowledge engineers. The main contribution of this work is a theory-based method for assessing the individual's goals, preferences, abilities and motives, which is used for building a holistic user model. The user model is continuously updated and functions as the base for tailoring the system's assistive behavior during intervention and follow-up.

  • 25.
    Mariela, Morveli-Espinoza
    et al.
    Federal University of Technology - Paraná (UTFPR), Curitiba, Brazil.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ayslan, Trevizan
    Federal University of Technology - Paraná (UTFPR), Curitiba, Brazil.
    J., Puyol-Gruart
    Artificial Intelligence Research Institute (IIIA-CSIC), Barcelona, Spain.
    Cesar, Tacla
    Federal University of Technology - Paraná (UTFPR), Curitiba, Brazil.
    An Argumentation-based Approach for Identifying and Dealing with Incompatibilities among Procedural Goals2019In: International Journal of Approximate Reasoning, ISSN 0888-613X, E-ISSN 1873-4731, Vol. 105, p. 1-26Article in journal (Refereed)
    Abstract [en]

    During the first step of practical reasoning, i.e. deliberation, an intelligent agent generates a set of pursuable goals and then selects which of them he commits to achieve. An intelligent agent may in general generate multiple pursuable goals, which may be incompatible among them. In this paper, we focus on the definition, identification and resolution of these incompatibilities. The suggested approach considers the three forms of incompatibility introduced by Castelfranchi and Paglieri, namely the terminal incompatibility, the instrumental or resources incompatibility and the superfluity. We characterize computationally these forms of incompatibility by means of arguments that represent the plans that allow an agent to achieve his goals. Thus, the incompatibility among goals is defined based on the conflicts among their plans, which are represented by means of attacks in an argumentation framework. We also work on the problem of goals selection; we propose to use abstract argumentation theory to deal with this problem, i.e. by applying argumentation semantics. We use a modified version of the “cleaner world” scenario in order to illustrate the performance of our proposal.

  • 26.
    Morveli Espinoza, Mariela
    et al.
    UTFPR, Curitiba, Brazil.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Possebom, Ayslan T.
    UTFPR, Curitiba, Brazil.
    Puyol-Gruart, Josep
    IIIA-CSIC, Barcelona, Spain.
    Tacla, Cesar Augusto
    UTFPR, Curitiba, Brazil.
    Resolving Incompatibilities between Procedural Goals: An Argumentation-based Approach2018In: / [ed] Riccardo De Masellis, Valentin Goranko, 2018Conference 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.

  • 27. Morveli-Espinoza, Mariela
    et al.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Possebom, Ayslan
    Tacla, Cesar Augusto
    Resolving Incompatibilities among Procedural Goals under Uncertainty2018In: / [ed] Viviana Mascardi, Alessandro Ricci, Danny Weyns, 2018Conference 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.

  • 28.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Approximating agreements in argumentation dialogues2018In: 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 (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.

  • 29.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Approximating agreements in formal argumentation dialogues2019In: AI Communications, ISSN 0921-7126, E-ISSN 1875-8452Article in journal (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 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.

  • 30.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Argumentation Inference as Logic Programming Inference: an Extended Abstract2014Conference paper (Other academic)
    Abstract [en]

    In this extended abstract, we present a small survey of recent results in the study of argumentation theory as logic programming. In particular, we survey recent characterizations of eight argumentation semantics, i.e., Ground, Stable, Preferred, Complete, Semi-stable, Ideal, CF2, Stage, as logic programming semantics with negation as failure. These results consolidate the strong relationship between argumentation semantics and logic programming semantics with negation as failure.

  • 31.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Expansion and equivalence relations on argumentation frameworks based on logic programs2017In: Multi-agent systems and agreement technologies: 14th European conference, EUMAS 2016, and 4th international conference, AT 2016, Valencia, Spain, December 15-16, 2016, revised selected papers / [ed] Criado Pacheco N., Carrascosa C., Osman N., Julián Inglada V., Cham: Springer, 2017, p. 375-389Conference paper (Refereed)
    Abstract [en]

    Expansion and equivalence relations have been explored in the settings of abstract argumentation. However, in terms of structured arguments, expansion and equivalence relations have not been explored in the settings of structured arguments based on logic programs. In this paper, we draw connections between resulting argumentation frameworks from logic programs considering expansion and equivalence relations. We show that by considering different methods for constructing arguments and defining attack relations, one can define different expansion and equivalence relations between the resulting argumentation frameworks from logic programs. Moreover, we extended results from abstract argumentation into structured arguments based on logic programs.

  • 32.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Andrade, Daniel
    Guerrero, Esteban
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    MAIoT: An IoT Architecture with Reasoning and Dialogue Capability2017In: Applications for Future Internet: International Summit, AFI 2016, Puebla, Mexico, May 25-28, 2016, Revised Selected Papers / [ed] Enrique Sucar, Oscar Mayora, Enrique Munoz de Cote, Cham: Springer, 2017, p. 109-113Conference paper (Refereed)
    Abstract [en]

    This paper describes MAIoT, a Multiagent-based Architecture which aims to coordinate Internet of Things (IoT) devices. MAIoT is distinguished by its capabilities for allowing dialogues between IoT devices. To support theses dialogue capabilities, the IoT devices are wrapped into rational agents with reasoning and dialogue capabilities.

  • 33.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Espinoza, Angelina
    Penya, Yoseba K.
    Ortega de Mues, Mariano
    Pena, Aitor
    Intelligence distribution for data processing in smart grids: a semantic approach2013In: Engineering applications of artificial intelligence, ISSN 0952-1976, E-ISSN 1873-6769, Vol. 26, no 8, p. 1841-1853Article in journal (Refereed)
    Abstract [en]

    The smart grid vision demands both syntactic interoperability in order to physically be able to interchange data and semantic interoperability to properly understand and interpret its meaning. The IEC and the EPRI have backed to this end the harmonization of two widely used industrial standards, the CIM and the IEC 61850, as the global unified ontology in the smart grid scenario. Still, persisting such a huge general ontology in each and every one of the members of a distributed system is neither practical nor feasible. Moreover, the smart grid will be a heterogeneous conglomerate of legacy and upcoming architectures that will require first the possibility of representing all the existing assets in the power network as well as new unknown ones, and second, the collaboration of different entities of the system in order to deploy complex activities. Finally, the smart grid presents diverse time span requirements, such as real-time, and all of them must be addressed efficiently but use resources sparingly. Against this background, we put forward an architecture of intelligent nodes spread all over the smart grid structure. Each intelligent node only has a profile of the global ontology. Moreover, adding reasoning abilities, we achieve simultaneously the required intelligence distribution and local decision making. Furthermore, we address the aforementioned real-time and quasi-real-time requirements by integrating stream data processing tools within the intelligent node. Combined with the knowledge base profile and the reasoning capability, our intelligent architecture supports semantic stream reasoning. We have illustrated the feasibility of this approach with a prototype composed of three substations and the description of several complex activities involving a number of different entities of the smart grid. Moreover, we have also addressed the potential extension of the unified ontology. (C) 2013 Elsevier Ltd. All rights reserved.

  • 34.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Guerrero, Esteban
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Baskar, Jayalakshmi
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Deliberative Argumentation for Smart Environments2014In: PRIMA 2014: Principles and Practice of Multi-Agent Systems / [ed] Hoa Khanh Dam, Jeremy Pitt, Yang Xu, Guido Governatori, Takayuki Ito, Springer International Publishing , 2014, p. 141-149Conference paper (Refereed)
    Abstract [en]

    In this paper, an argumentation-based deliberative approach for fusing contextual information obtained from heterogeneous sources using a multi-agent system is introduced. The system is characterized by three different agents: an Environment Agent, an Activity Agent and a Coach Agent. These agents consider data from heterogenous sources of data. As a method for aggregating data and supporting decision-making, so-called agreement rules are instrumental in the argumentation-based deliberative method. The aggregation rules will be associated to specific beliefs related to the services of each agent.

  • 35.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Guerrero, Esteban
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Reasoning about human activities: an argumentative approach2013In: 12th Scandinavian Conference on Artificial Intelligence (SCAI 2013), IOS Press, 2013, p. 195-204Conference paper (Refereed)
    Abstract [en]

    Recognizing and supporting human activities is an important challenge for ambient assisted living. In this paper we introduce a novel argumentation-based approach for dealing with human activity recognition. By considering a model of the world and a set of observations of the world, hypothetical fragments of activities are built. The hypothetical fragments of activities will be goal-oriented actions and they will be considered defeasible. Therefore we consider extension-based argumentation semantics for local selection of hypothetical fragments of activities. By considering degrees of fulfillment of activities and local selection, a global selection of hypothetical fragments of the activities is defined. Therefore, we can make explicit statements about why one hypothetical activity was performed.

  • 36.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Haeusler, Edward Hermann
    Pontifícia Universidade Católica do Rio de Janeiro, Brazil.
    Lopes, Bruno
    Universidade Federal Fluminense, Brazil.
    Editorial: Thematic issue: Advances in Logic-based Methods for Intelligent Systems2017In: Journal of Computacion y Sistemas, ISSN 1405-5546, Vol. 21, no 3, p. 399-400Article in journal (Other academic)
    Abstract [en]

    This issue presents 14 papers, among them the first six papers present to the readers advances in Logic-based Methods for Intelligent Systems.

  • 37.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Deliberative argumentation for service provision in smart environments2015In: Multi-agent systems (EUMAS 2014), Springer, 2015, p. 388-397Conference paper (Refereed)
    Abstract [en]

    In this paper, we introduce an inquiry dialogue approach for supporting decision making in a smart environment setting. These inquiry dialogues have as topic either agreement atoms or agreement rules, which capture services in a smart environment. These services are provided and supported by three rational agents with different roles: Environment Agent, Activity Agent and Coach Agent. These three agents have different capabilities and represent different data sources; however, they have to collaborate in order to deliver services in a smart environment. The knowledge base of each agent is captured by extended logic programs. Therefore, the construction of arguments is supported by the Well-Founded Semantics (WFS). The outcome of the inquiry dialogues is supported by well-known argumentation semantics.

  • 38.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Merging Deductive and Abductive Knowledge Bases: An Argumentation Context Approach2013In: POLIBITS Research Journal on Computer Science and Computer Engineering With Applications, ISSN 1870-9044, Vol. 48, p. 39-46Article in journal (Refereed)
    Abstract [en]

    The consideration of heterogenous knowledge sources for supporting decision making is key to accomplish informed decisions, e.g., about medical diagnosis. Consequently, merging different data from different knowledge bases is a key issue for providing support for decision-making. In this paper, we explore an argumentation context approach, which follows how medical professionals typically reason, in order to merge two basic kinds of reasoning approaches based on logic programs: deductive and abductive inferences. In this setting, we introduce two kinds of argumentation frameworks: deductive argumentation frameworks and abductive argumentation frameworks. For merging these argumentation frameworks, we follow an approach based on argumentation context systems. We illustrate the approach by considering two different declarative specifications of evidence-based medical knowledge into logic programs in order to support informed medical decisions.

  • 39.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Possibilistic Nested Logic Programs2012In: Technical Communications of the 28th International Conference on Logic Programming (ICLP'12), 2012, p. 267-276Conference paper (Refereed)
    Abstract [en]

    We introduce the class of possibilistic nested logic programs. These possibilistic logic programsallow us to use nested expressions in the bodies and the heads of their rules. By considering apossibilistic nested logic program as a possibilistic theory, a construction of a possibilistic logicprograming semantics based on answer sets for nested logic programs and the proof theory ofpossibilistic logic is defined. We show that this new semantics for possibilistic logic programsis computable by means of transforming possibilistic nested logic programs into possibilistic disjunctivelogic programs. The expressiveness of the possibilistic nested logic programs is illustratedby scenarios from the medical domain. In particular, we exemplify how possibilistic nested logicprograms are expressive enough for capturing medical guidelines which are pervaded of vaguenessand qualitative information.

  • 40.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Possibilistic nested logic programs and strong equivalence2015In: International Journal of Approximate Reasoning, ISSN 0888-613X, E-ISSN 1873-4731, Vol. 59, p. 1-19Article in journal (Refereed)
    Abstract [en]

    In this paper, the class of possibilistic nested logic programs is introduced. These possibilistic logic programs allow us to use nested expressions in the bodies and heads of their rules. By considering a possibilistic nested logic program as a possibilistic theory, a construction of a possibilistic logic programing semantics based on answer sets for nested logic programs and the proof theory of possibilistic logic is defined. In order to define a general method for computing the possibilistic answer sets of a possibilistic nested program, the idea of equivalence between possibilistic nested programs is explored. By considering properties of equivalence between possibilistic programs, a process of transforming a possibilistic nested logic program into a possibilistic disjunctive logic program is defined. Given that our approach is an extension of answer set programming, we also explore the concept of strong equivalence between possibilistic nested logic programs. To this end, we introduce the concept of poss SE-models. Therefore, we show that two possibilistic nested logic programs are strong equivalents whenever they have the same poss SE-models.

    The expressiveness of the possibilistic nested logic programs is illustrated by a scenario from the medical domain. In particular, we exemplify how possibilistic nested logic programs are expressive enough for capturing medical guidelines which are pervaded by vagueness and qualitative information.

  • 41.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Cortés, Ulises
    A Qualitative Medical Diagnosis Approach based on Observer and Validating Agents2012In: Proceedings of Agents Applied to Health Care (A2HC) 2012, 2012, p. 151-160Conference paper (Refereed)
    Abstract [en]

    In this paper we introduce a multi-agent approach designed to deal with medical qualitative diagnosis. This approachis based on BDI-agents which are called Observer and Validating agents. The Observer agents are supported by adeductive inference process and the Validating agents are supported by an abductive inference process. The knowledge bases of these agents are captured by a class of possibilistic logic programs. Hence these agents are able to deal with qualitative information. In order to manage an interaction between Observer and Validating agents, a deliberation dialogue process is defined. The approach is illustrated byreal scenarios from diagnosing dementia disease.

  • 42.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Cortés, Ulises
    Agent-based reasoning in medical planning and diagnosis combining multiple strategies2014In: International journal on artificial intelligence tools, ISSN 0218-2130, Vol. 23, no 01, Special issue, p. 1440004-Article in journal (Refereed)
    Abstract [en]

    Medical reasoning describes a form of qualitative inquiry that examines the cognitive (thought) processes involved in making medical decision. In this field the goal for diagnostic reasoning is assessing causes of observed conditions in order to make informed choices about treatment. In order to design a diagnostic reasoning method we merge ideas from a hypothetic-deductive method and the Domino model. In this setting, we introduce the so called Hypothetic-Deductive-Domino (HD-D) algorithm. In addition, a multi-agent approach is presented, which takes advantage of the HD-D algorithm for illuminating different standpoints in a diagnostic reasoning and assessment process, and for reaching a well-founded conclusion. This multi-agent approach is based on the so called Observer and Validating agents. The Observer agents are supported by a deductive inference process and the Validating agents are supported by an abductive inference process.  The knowledge bases of these agents are captured by a class of possibilistic logic programs. Hence, these agents are able to deal with qualitative information. The approach is illustrated by a real scenario from diagnosing dementia diseases.

  • 43.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Marcial-Romero, José Raymundo
    Preface2015In: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 315, no 9, p. 1-2Article in journal (Other academic)
  • 44.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Osorio, Mauricio
    Extending Well-Founded Semantics with Clark's Completion for Disjunctive Logic Programs2018In: Scientific Programming, ISSN 1058-9244, E-ISSN 1875-919X, article id 4157030Article in journal (Refereed)
    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.

  • 45.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Osorio, Mauricio
    Ideal Extensions as Logical Programming Models2016In: Journal of logic and computation (Print), ISSN 0955-792X, E-ISSN 1465-363X, Vol. 26, no 5, p. 1361-1393Article in journal (Refereed)
    Abstract [en]

    We show that the ideal sets of an argumentation framework can be characterized by two kinds of logical models: ideal models (2-valued logical models) and p-stable models (2-valued logical models). We also show that the maximal ideal set of an argumentation framework can be characterized by the well-founded+ model (a 3-valued logical model). These results argue for  the logical foundations of the ideal sets of an argumentation framework. Moreover, these results  consolidate the strong relationship between argumentation semantics and logic programming semantics with negation as failure. More accurately, we prove that the five argumentation semantics suggested by Dung etal, grounded, stable, preferred, complete and ideal semantics, can be characterized by the well-founded model, stable-model, p-stable, Clark's completion and well-founded+ model semantics, respectively by using a unique mapping from argumentation frameworks into logic programs. We observe that the labellings of these argumentation semantics can be inferred by the logical models of a logic program.

  • 46.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Osorio, Mauricio
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Managing Inconsistent Possibilistic Knowledge Bases by An Argumentation Approach2012In: The 27th annual workshop of the Swedish Artificial Intelligence Society (SAIS), 14–15 May 2012 / [ed] Lars Karlsson, Julien Bidot, 2012, p. 17-24Conference paper (Refereed)
    Abstract [en]

    Inconsistent knowledge bases usually are regarded as an epistemic hell that have to be avoided at all costs. However, many times it is dicult or impossible to stay away of managing inconsistent knowledge bases. In this paper, we introduce an argumentation-based approach in order to manage inconsistent possibilistic knowledge bases. This approach will be exible enough for managing inconsistent possibilistic models and the non-existence of possibilistic models of a possibilistic logic program.

  • 47.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Partonia, Saeed
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Guerrero, Esteban
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    A Probabilistic Non-Monotonic Activity Qualifier2015In: The 6th International Conference on Ambient Systems, Networks and Technologies (ANT-2015), the 5th International Conference on Sustainable Energy Information Technology (SEIT-2015) / [ed] Elhadi Shakshuki, Elsevier, 2015, Vol. 52, p. 420-427Conference paper (Refereed)
    Abstract [en]

    The International Classification of Functioning, Disability and Health (ICF) defines Functioning and Disability as the results of the interaction between the health conditions of a person and his/her environment. It considers a set of components and qualifiers to evaluate activity and participation. In this paper, we interpret a performance quantifier under a human activity recognition process. To this end, we introduce a novel definition of an activity which is based on ICF guidelines. This definition gives place to a probabilistic non-monotonic activity qualifier. In order to recognize an activity according to our novel activity's definition, we explore non-monotonic reasoning technics to capture domain knowledge in terms of action specification languages. By considering an action specification language, called CTAID, and Answer Set Programming, we propose and develop a system called ActRec system which takes background information into consideration and recognize activities according to our suggested definition. Moreover, we show that by aggregating our probabilistic non-monotonic activity qualifier, we are able of detecting complex activities, e.g., long-term activities. We illustrate our approach in the context of an ambient assisted living environment called As-A-Pal.

  • 48.
    Nieves, Juan Carlos
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Surie, Dipak
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Modeling Actions Based on a Situative Space Model for Recognizing Human Activities2012In: Artificial Intelligence: Methodology, Systems, and Applications, Springer, 2012, p. 266-275Conference paper (Refereed)
    Abstract [en]

    Human activities usually have a motive and are driven bygoal directed sequence of actions. Recognizing and supporting humanactivities is an important challenge for ambient assisted living of elderlyin their home environment. By understanding an activity as a sequence ofactions, we explore action specification languages for recognizing humanactivities. In this setting, we analyze the role of the situative space modelfor modeling indoor human activities in terms of an action specificationlanguage.

  • 49.
    Oetsch, Johannes
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Stable-Ordered Models for Propositional Theories with Order Operators2019In: Logics in Artificial Intelligence: JELIA 2019 / [ed] Calimeri, Francesco; Leone, Nicola; Manna, Marco, Springer, 2019, p. 794-802Conference 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.

  • 50. Osorio, Mauricio
    et al.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Range-based argumentation semantics as two-valued models2017In: Theory and Practice of Logic Programming, ISSN 1471-0684, E-ISSN 1475-3081, Vol. 17, no 1, p. 75-90Article in journal (Refereed)
    Abstract [en]

    Characterizations of semi-stable and stage extensions in terms of two-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are logic programming counterparts of the notion of range which is an established concept in argumentation semantics.

12 1 - 50 of 53
CiteExportLink to result list
Permanent 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