The present work deals with Description Logics (DLs), a class of knowledge representation formalisms used to represent and reason about classes of individuals and relations between such classes in a formally well-defined way. We provide novel results in three main directions. (1) Tractable reasoning revisited: in the 1990s, DL research has largely answered the question for practically relevant yet tractable DL formalisms in the negative. Due to novel application domains, especially the Life Sciences, and a surprising tractability result by Baader, we have re-visited this question, this time looking in a new direction: general terminologies (TBoxes) and extensions thereof defined over the DL EL and extensions thereof. As main positive result, we devise EL++(D)-CBoxes as a tractable DL formalism with optimal expressivity in the sense that every additional standard DL constructor, every extension of the TBox formalism, or every more powerful concrete domain, makes reasoning intractable. (2) Non-standard inferences for knowledge maintenance: non-standard inferences, such as matching, can support domain experts in maintaining DL knowledge bases in a structured and well-defined way. In order to extend their availability and promote their use, the present work extends the state of the art of non-standard inferences both w.r.t. theory and implementation. Our main results are implementations and performance evaluations of known matching algorithms for the DLs ALE and ALN, optimal non-deterministic polynomial time algorithms for matching under acyclic side conditions in ALN and sublanguages, and optimal algorithms for matching w.r.t. cyclic (and hybrid) EL-TBoxes. (3) Non-standard inferences over general concept inclusion (GCI) axioms: the utility of GCIs in modern DL knowledge bases and the relevance of non-standard inferences to knowledge maintenance naturally motivate the question for tractable DL formalism in which both can be provided. As main result, we propose hybrid EL-TBoxes as a solution to this hitherto open question.

gekürzte Fassung: Coalgebren wurden sowohl in der Mathematik (seit den 70er Jahren) als auch in der theoretischen Informatik (seit den 90er Jahren) untersucht. In der Mathematik sind Coalgebren dual zu universellen Algebren definiert. Sie bestehen aus einer Trägermenge A zusammen mit Cofunktionen ? : A ? , die A in die n-fache disjunkte Vereinigung von sich selbst abbilden. Das Ziel der Forschung ist hier vor allem, duale Versionen von Definitionen und Resultaten aus der universellen Algebra für die Welt der Coalgebren zu finden. Die theoretische Informatik betrachtet Coalgebren von kategorieller Seite aus. Für einen gegebenen Funktor F : C ? C sind Coalgebren als Paare (S,"alpha") definiert, wobei S ein Objekt von C und "alpha" : S ? F(S) ein Morphismus in C ist. Somit stellt der obige Ansatz mit Cofunktionen einen Spezialfall dar. Begriffe wie Homomorphismus oder Bisimularität lassen sich auf einfache Weise ausdrücken und handhaben. Solche Coalgebren modellieren eine große Anzahl von dynamischen Systemen. Das liefert eine kanonische und vereinheitlichende Sicht auf diese Systeme. Die vorliegende Dissertation führt beide genannten Forschungsrichtungen der Coalgebren weiter: Teil I beschäftigt sich mit "klassischen" Coalgebren, also solchen, wie sie in der universellen Algebra untersucht werden. Insbesondere wird das Verhältnis zur Klontheorie erforscht. Teil II der Arbeit widmet sich dem kategoriellen Ansatz aus der theoretischen Informatik. Von speziellem Interesse ist hier die Anwendung von Coalgebren zur Spezifikation von Systemen. Coalgebren und Klontheorie In der universellen Algebra spielen Systeme von Funktionen eine bedeutende Rolle, u.a. in der Klontheorie. Dort betrachtet man Funktionen auf einer festen gegebenen Grundmenge. Klone von Funktionen sind Mengen von Funktionen, die alle Projektionen enthalten und die gegen Superposition (d.h. Einsetzen) abgeschlossen sind. Extern lassen sich diese Klone als Galois-abgeschlossene Mengengzgl. der Galois-Verbindung zwischen Funktionen und Relationen darstellen. Diese Galois-Verbindung wird durch die Eigenschaft einer Funktion induziert, eine Relation zu bewahren. Dual zu Klonen von Funktionen wurde von B. Csákány auch Klone von Cofunktionen untersucht. Folglich stellt sich die Frage, ob solche Klone ebenfalls mittels einer geeigneten Galois-Verbindung charakterisiert werden können. Die vorliegende Arbeit führt zunächst den Begriff von Corelationen ein. Es wird auf kanonische Weise definiert, was es heißt, daß eine Cofunktion eine Corelation bewahrt. Dies mündet in einer Galois-Theorie, deren Galois-abgeschlossene Mengen von Cofunktionen tatsächlich genau die Klone von Cofunktionen sind. Überdies entsprechen die Galois-abgeschlossenen Mengen von Corelationen genau den Klonen von Corelationen. Die Galois-Theorien von Funktionen und Relationen einerseits und Cofunktionen und Corelationen anderseits sind sich sehr ähnlich. Das wirft die Frage auf, welche Voraussetzungen allgemein nötig sind, um solche und ähnliche Galois-Theorien aufzustellen und die entsprechenden Galois-abgeschlossenen Mengen zu charakterisieren. Das Ergebnis ist eine Metatheorie, bei der die Gemeinsamkeiten in den Charakterisierungen der Galois-abgeschlossenen Mengen herausgearbeitet sind. Bereits bekannte Galois-Theorien erweisen sich als Spezialfälle dieser Metatheorie, und zwar die Galois-Theorien von partiellen Funktionen und Relationen, von mehrwertigen Funktionen und Relationen und von einstelligen Funktionen und Relationen....

Es wird die Axiomatisierbarkeit einer Klasse von temporalen Prädikatenlogiken über verzweigenden Strukturen gezeigt. Entscheidbarkeitsresultate folgen für diverse Fragmente dieser Logiken. Anwendungen werden diskutiert.

An abstract knowledge representation of cognitive robots - as used for reasoning and planning - typically relies on symbols denoting objects of the world and states of affairs. The process of creating and maintaining the correct connection between a symbol denoting an object and its corresponding perceptual image (called percept), both referring to the same physical object, is called symbol anchoring. Most current cognitive systems implement an ad hoc solution which may work for the specific, intended application under certain conditions. Conversely, we suggest a formal and general approach to the symbol anchoring problem, which enhances previous approaches in terms of flexibility, applicability and expressiveness, and which completely automates the process of determining and maintaining all plausible hypotheses of correspondences between object symbols and perceptual images of physical objects. Based on the first-order logical Fluent Calculus, our approach inherits its rich expressiveness with respect to knowledge representation and reasoning. Implementing all required symbol anchoring functionalities, our approach also complies with fundamental concepts of phenomenalism, representationalism and the sense-data theory of philosophy of cognition.

I Sverige har vi flera stora idrottsevenemang som var för sig lockar tiotusentals deltagare varje år. Arrangörerna av dessa idrottsevenemang har i uppgift att leva upp till varje deltagares (kunds) förväntningar och tillfredsställa deras behov. Kundvärde är ett centralt begrepp inom både kvalitetsutveckling och marknadsföring och kundvärdeskapande anses vara en viktig framgångsfaktor för alla organisationer. Inte minst i framtiden då konsumenterna allt mer vill vara med och utforma produkterna de köper. Syftet med studien var att uppnå ökad förståelse för kundvärdeskapande inom idrottsevenemang genom att undersöka hur arrangörer arbetar idag och vill arbeta i framtiden för att främja ett högt upplevt kundvärde hos sina deltagare. Empiri samlades in genom fem intervjuer med arrangörer av idrottsevenemang. Analys av datamaterialet visade att arrangörerna som ingick i studien idag använder strategier och aktiviteter inom 12 olika teman med syfte att främja ett högt upplevt kundvärde. Efter analys drogs slutsatsen att arrangörerna idag erbjuder sina deltagare möjlighet till samskapande av kundvärde framförallt genom att tillföra de tre förutsättningarna dialog, riskbedömning och transparens. Inför framtiden identifierades tre områden för fortsatt utveckling och förbättring kring kundvärdeskapande: utökad/differentierad dialog med deltagarna, fler samarbeten och ett tydligt socialt ansvar samt att ge deltagarna mer mandat att vara med och driva utveckling och vara delaktiga i utformningen av evenemangen. / In Sweden we have several major sports events and each of them attracts tens of thousands of participants each year. The organizers of these sporting events have the task of meeting the expectations of each participant (customer) and satisfy their needs. Customer value is a key concept in both Total Quality Management (TQM) and marketing and customer value creation is considered an important success factor for all organizations. Not least in the future when consumers increasingly want to be involved in designing the products they buy. The aim of the study was to achieve increased understanding of customer value creation in sports events by examining how organizers work todayand want to work in the future to promote a high level of customer value for their participants. Data was collected through five interviews with organizers of sports events. Analysis of the data showed that the organizers today use strategies and activities within 12 different themes with the aim of promoting a high level of customer value. A conclusion from the analysis was that organizers today offer their participants the opportunity to co-create customer value by adding the three building blocks dialogue, risk assessment and transparency. For future improvements and continued development in customer value creation three areas were identified: expanded/differentiated dialogue with participants, more collaborations and clear social responsibility and giving participants more mandate to participate in development and participate in the design of the events. / <p>2018-06-27</p>

Many social workers that are working within the current healthcare system, feel that their profession is being marginalized, and they are worried that the social perspective might be lost, which would affect both the healthcare system and the patient in an undesirable way. This is a situation that is described by the social workers that were interviewed for the work of this assay. There is a proposition about a special legitimisation for social workers within the healthcare system. The main aim of this proposition is to secure the patient safety.  A second aim is to secure that the social perspective will remain with in the healthcare system.   The governance of the public sector of today, focuses on increasing the efficiency by control and review of measurable goals, which has affected the professionals' use of their skills and lead to de-professionalization. In today's knowledge management, measurable treatment through manuals is seemingly more important than professional competence, which has weakened the curators' profession role in healthcare. This picture is clearly stated in this essay's empirical study and is confirmed by the literature studied.   The trust delegation has the task to develop a reform that will better use the employees' skills so that the Swedish citizens receive their needed services through trust-based governance. The proposed introduction of legitimisation and the work of the trust delegation can both lead to changes for the social workers and the social perspective. For the social workers, the proposal raises hope. A legitimisation might strengthen their occupational role and at the same time indicate that the social perspective in healthcare is a specific and necessary area, which can lead to the development of the profession's jurisdiction.

Denna rapport går igenom utvecklingen av spelet Metal in Your Brain som skickas in som ett bidrag till Swedish Game Awards (SGA), nordens största spelutvecklar-tävling och hur den artificiella intelligensen är uppbyggd och funktionerar. Den artificiella intelligensen är konstruerad på två sätt: fuzzy logic som står bakom de handlingar som en icke spelande karaktär (NPC) tar beroende på vilken situation den befinner sig i och A*-sökning som används för att en NPC ska kunna söka sig fram till ett mål och ta den kortaste vägen eller fly från spelaren för att gömma sig bakom närmsta skydd. Metal in Your Brain är ett 2D top-down shooter för Windowsdatorer där man tillsammans med två andra spelare ska överleva en rad vågor av fiender och möjligen samtidigt utföra ett antal uppdrag beroende på vilken bana det är. / This report reviews the development of the game Metal inYour Brain that will be submitted to Swedish Game Awards (SGA), Scandinavia's largest game developer competition and how the artificial intelligence is structured and functions. The artificial intelligence is constructed in two ways: fuzzy logic that decides the actions for a non-player character (NPC) will take depending on the situation it find itself in, and A * search that is used for a NPC to be able to seek out a goal and take the shortest route to get there or flee from the player and take cover behind the nearest shelter. Metal In Your Brain is a 2D top-down shooter for Windows computers where you, together with two other players aim to survive a series of waves of enemies and possibly simultaneously perform a number of tasks depending on what level one is at. 1

Borderlands. Swedish youth care in the intersections of care and punishment This dissertation concerns staff working in special residential homes, or secure units, for boys and young men and, less specifically, the compulsory care of problematic teenagers. The study is based on interviews with staff members and participatory observations of daily practices at a compulsorycare institution. The empirical material is complemented by observations of learning situations and interviews with students and teachers in education of social pedagogy. The aim of the thesis is to map out and to analyse understandings of, and motivations for, compulsory care that is produced and sustained through articulations of residing teenagers, treatment practices and institutional staff in the daily work, and in staff narratives, at a secure unit for compulsory care. Three aspects of compulsory care are analysed: constructions of teenagers, of treatment practices and of subject positions or identity of staff. Concepts and ideas from a post-structural framework are used as theoretical tools to conduct analysis of the interviews and observations. Discourse, as well as a three-fold concept of logics, is central for the analysis. As a theoretical complement to the main analytical framework, perspectives from symbolic interactionism are used. The results of the thesis show that tensions and ambivalence characterise compulsory care for adolescents. Aspects of care as well as of punishment, for example, are both evident parts of the institutional work and narratives studied. The teenagers are alternately being constructed as children in need and as manipulative criminals: articulations that are made part of either a logic of care or a logic of punishment. Other tensions that are analysed as significant parts of institutional practices and subject positions are those of the biological and the social, theory and practice, and power and powerlessness. Age, gender and class are all significant parts in constructing subject positions for both teenagers and staff and in creating a division between the two groups. Such categorisations are articulated together in various ways in the different logics identified. These subject positions also have consequences for institutional interactions and for the institutional care provided in secure units.

Results of psychological experiments have shown that humans make assumptions, which are not necessarily valid, that they are influenced by their background knowledge and that they reason non-monotonically. These observations show that classical logic does not seem to be adequate for modeling human reasoning. Instead of assuming that humans do not reason logically at all, we take the view that humans do not reason classical logically. Our goal is to model episodes of human reasoning and for this purpose we investigate the so-called Weak Completion Semantics. The Weak Completion Semantics is a Logic Programming approach and considers the least model of the weak completion of logic programs under the three-valued Łukasiewicz logic. As the Weak Completion Semantics is relatively new and has not yet been extensively investigated, we first motivate why this approach is interesting for modeling human reasoning. After that, we show the formal correspondence to the already established Stable Model Semantics and Well-founded Semantics. Next, we present an extension with an additional context operator, that allows us to express negation as failure. Finally, we propose a contextual abductive reasoning approach, in which the context of observations is relevant. Some properties do not hold anymore under this extension. Besides discussing the well-known psychological experiments Byrne’s suppression task and Wason’s selection task, we investigate an experiment in spatial reasoning, an experiment in syllogistic reasoning and an experiment that examines the belief-bias effect. We show that the results of these experiments can be adequately modeled under the Weak Completion Semantics. A result which stands out here, is the outcome of modeling the syllogistic reasoning experiment, as we have a higher prediction match with the participants’ answers than any of twelve current cognitive theories. We present an abstract evaluation system for conditionals and discuss well-known examples from the literature. We show that in this system, conditionals can be evaluated in various ways and we put up the hypothesis that humans use a particular evaluation strategy, namely that they prefer abduction to revision. We also discuss how relevance plays a role in the evaluation process of conditionals. For this purpose we propose a semantic definition of relevance and justify why this is preferable to a exclusively syntactic definition. Finally, we show that our system is more general than another system, which has recently been presented in the literature. Altogether, this thesis shows one possible path on bridging the gap between Cognitive Science and Computational Logic. We investigated findings from psychological experiments and modeled their results within one formal approach, the Weak Completion Semantics. Furthermore, we proposed a general evaluation system for conditionals, for which we suggest a specific evaluation strategy. Yet, the outcome cannot be seen as the ultimate solution but delivers a starting point for new open questions in both areas.

Quasi-hom-Lie algebras (qhl-algebras) were introduced by Larsson and Silvestrov (2004) as a generalisation of hom-Lie algebras, which are a deformation of Lie algebras. Lie algebras are defined by an operation called bracket, [·,·], and a three-term Jacobi identity. By the theorem from Hartwig, Larsson, and Silvestrov (2003), this bracket and the three-term Jacobi identity are deformed into a new bracket operation, &lt;·,·&gt;, and a six-term Jacobi identity, making it a quasi-hom-Lie algebra. Throughout this thesis we deform the Lie algebra sl2(F), where F is a field of characteristic 0. We examine the quasi-deformed relations and six-term Jacobi identities of the following polynomial algebras: F[t], F[t]/(t2), F[t]/(t3), F[t]/(t4), F[t]/(t5), F[t]/(tn), where n is a positive integer ≥2, and F[t]/((t-t0)3). Larsson and Silvestrov (2005) and Larsson, Sigurdsson, and Silvestrov (2008) have already examined some of these cases, which we repeat for the reader's convenience. We further investigate the following σ-twisted derivations, and how they act in the different cases of mentioned polynomial algebras: the ordinary differential operator, the shifted difference operator, the Jackson q-derivation operator, the continuous q-difference operator, the Eulerian operator, the divided difference operator, and the nilpotent imaginary derivative operator. We also introduce a new, general, σ-twisted derivation operator, which is σ(t) as a polynomial of degree k.