umu.sePublications
Change search
Refine search result
12 51 - 56 of 56
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.
  • 51.
    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.

  • 52. 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.

  • 53. Osorio, Mauricio
    et al.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Santoyo, Alejandro
    Complete Extensions as Clark's Completion Semantics2013In: 2013 MEXICAN INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE (ENC 2013), IEEE, 2013, p. 81-88Conference paper (Refereed)
    Abstract [en]

    According to Dung, the sets of arguments which can be considered as admissible from an argumentation framework can be regarded as logical models of a given logic program. Clark's completions defines a basic logic programming semantics which has influenced modern non-monotonic semantics such as Answer Set Semantics. The Complete Semantics is a fundamental argumentation semantics which identifies a set of admissible sets which contains the grounded, stable, preferred and ideal semantics. In this paper we introduce a characterization of the complete semantics in terms of logical models using Clark's completions. Given that we use a unique mapping which characterizes the grounded, stable, preferred and ideal semantics, our characterization argues for a strong bridge between argumentation semantics and logic programming semantics with negation as failure. This paper also seeks to draw attention to the correspondence between the complete semantics of argumentation frameworks and models of Clark's completion, since this correspondence also allows us to identify the possibility of computing argumentation frameworks based on integer programming.

  • 54. Penya, Yoseba K.
    et al.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Espinoza, Angelina
    Borges, Cruz E.
    Peña, Aitor
    Ortega, Mariano
    Distributed Semantic Architecture for Smart Grids2012In: Energies, ISSN 1996-1073, E-ISSN 1996-1073, Vol. 5, no 11, p. 4824-4843Article in journal (Refereed)
    Abstract [en]

    The smart grid revolution demands a huge effort in redesigning and enhancing current power networks, as well as integrating emerging scenarios such as distributed generation, renewable energies or the electric vehicle. This novel situation will cause a huge flood of data that can only be handled, processed and exploited in real-time with the help of cutting-edge ICT (Information and Communication Technologies). We present here a new architecture that, contrary to the previous centralised and static model, distributes the intelligence all over the grid by means of individual intelligent nodes controlling a number of electric assets. The nodes own a profile of the standard smart grid ontology stored in the knowledge base with the inferred information about their environment in RDF triples. Since the system does not have a central registry or a service directory, the connectivity emerges from the view of the world semantically encoded by each individual intelligent node (i.e., profile + inferred information). We have described a use-case both with and without real-time requirements to illustrate and validate this novel approach.

  • 55.
    Yan, Chunli
    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.
    A Dialogue-Based Approach for Dealing with Uncertain and Conflicting Information in Medical Diagnosis2018In: Autonomous Agents and Multi-Agent Systems, ISSN 1387-2532, E-ISSN 1573-7454, Vol. 32, no 6, p. 861-885Article in journal (Refereed)
    Abstract [en]

    In this paper, we propose a multi-agent framework to deal with situations involving uncertain or inconsistent information located in a distributed environment which cannot be combined into a single knowledge base. To this end, we introduce an inquiry dialogue approach based on a combination of possibilistic logic and a formal argumentation-based theory, where possibilistic logic is used to capture uncertain information, and the argumentation-based approach is used to deal with inconsistent knowledge in a distributed environment. We also modify the framework of earlier work, so that the system is not only easier to implement but also more suitable for educational purposes. The suggested approach is implemented in a clinical decision-support system in the domain of dementia diagnosis. The approach allows the physician to suggest a hypothetical diagnosis in a patient case, which is verified through the dialogue if sufficient patient information is present. If not, the user is informed about the missing information and potential inconsistencies in the information as a way to provide support for continuing medical education. The approach is presented, discussed, and applied to one scenario. The results contribute to the theory and application of inquiry dialogues in situations where the data are uncertain and inconsistent.

  • 56.
    Yan, Chunli
    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.
    A Multi-agent System for Nested Inquiry Dialogues2014In: Advances in Practical Applications of Heterogeneous Multi-Agent Systems: The PAAMS Collection : 12th International Conference, PAAMS 2014, Salamanca, Spain, June 4-6, 2014. Proceedings / [ed] Demazeau, Yves; Zambonelli, Franco; Corchado, JuanM.; Bajo, Javier, Springer, 2014, Vol. 8473, p. 303-314Chapter in book (Refereed)
    Abstract [en]

    Generating and evaluating arguments are two important aspects in argumentation-based dialogue systems. In current research, however, generating and evaluating arguments are normally treated separately. Also, there are rarely implementations of the approaches in real applications. In this paper, we generate inquiry dialogues and evaluate arguments during the dialogue procedure simultaneously. Furthermore, we have implemented this approach in a real medical domain and demonstrated a practical example extracted from this application.

12 51 - 56 of 56
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