Au travers d'une étude de cas unique et interprétative de la profession médicale, cette thèse propose d'étudier l'usage des artefacts dans la dynamique conjointe des logiques institutionnelles. Pour comprendre la façon dont le changement s'opère, nous avons suivi l'institutionnalisation d'une nouvelle logique émergente. Des médecins généralistes légitiment leur rôle dans le champ médical par la création d'un mouvement social à la croisée de plusieurs mondes : une logique professionnelle et une logique basée sur l'évidence. Après avoir rassemblé les différents objets épistémiques mobilisés (Knorr -Cetina, 2001), une analyse biographique d'une cinquantaine de médecins a été réalisée par le biais du cycle herméneutique (Bleicher, 1980 ; Myers, 2013). L'originalité de ce travail se fonde sur l'approche socio-matérielle des pratiques (Orlikowski, 2005) perçues à la fois comme des traceurs du changement et comme des "performateurs" du changement. Dans le premier cas, d'un point de vue méthodologique, il est possible de faire émerger plusieurs logiques institutionnelles (Friedland, 2012) en analysant l'évolution des objets utilisés par les médecins dans le temps (Gherardi, 2012) pour comprendre l'agencement des acteurs au cours du changement institutionnel (Lounsbury & Crumley, 2007). Dans le second cas, et à portée théorique, la compréhension de la performativité des objets fournit des explications conceptuelles quant à la propagation d'une logique (Orlikowski & Scott, 2008). Nous explicitons le rôle des énoncés performatifs d'Austin (1962) dans le changement de choix de logique chez les individus à travers une nouvelle notion : le déclic. / This research is in depth interpretative case study looking at the raised of contesting practices in the medical profession. In the 1970s, a social movementemerged in France defending the return of professional values that have been absorbed by the prevalent managerial logic. Actors shaped an innovative ‘hybrid’logic (Reay & Hinings, 2009) setting in between professional and evidence - based of medicine logic (Mendel & Scott, 2010). This study explains how a social movement have challenged successfully the dominant logic, and how the vision came to be incorporated into the field configuration. A large amount of qualitative datawere collected via interviews, archives, and ethnography, and analysed withhermeneutics cycles methodology (Bleicher, 1980; Myers, 2013). I created fifty biographies and focused on the different epistemic objects professionals were using to defend and diffuse the project (Knorr-Cetina, 2001). The contribution of analysing sociomateriality in the process of change is twofold. Theoretically it explained the performative dimensions of a transformation of logic (Orlikowski, 2005). Methodologically it offers new possibilities for identifying institutional logics in a field (Thornton et al., 2012). Findings allow me to illustrate the Austinian perspective of performativity which highlights the formal cooperation between actors (Austin, 1965).

Det råder debatter och diskussioner om att ökad effektivitet, produktivitet och digitalisering krävs för att lyckas med välfärdsuppdraget. Begreppen är central och det finns få individnära forskning om vad dessa begrepp står för och innebär i det dagliga arbetet för olika yrkesverksamma personer inom välfärdenstjänster såsom hälso- och sjukvård och äldreomsorg. Syftet med föreliggande studie är att ta del av hur begreppen uppfattas av ett mindre antal personer som verkar på olika nivåer inom välfärdenstjänster. Denna kvalitativa studie med fenomenografisk ansats baseras på informanters uppfattningar. För analys av insamlade data används konventionell innehållsanalys. Studiens teoretiska ramverk med koppling till gränser mellan ekonomi- och demokrativärden, motsättningen mellan olika rationalitet och stridande logiker utvecklas i samband med analys av det empiriska materialet. Resultatet visar att även om informanters medvetenhet om välfärdens utmaningar är i varierande grad, finns det en generell uppfattning av att en välfungerande hälso-och sjukvård och äldreomsorg kräver rätt och tillräcklig kompetens. Det finns en uppfattning bland informanter att beslutfattarna måste skjuta till mer resurser. Resultatet pekar också på en uppfattning av att välfärden kan upprätthållas om tillräckliga åtgärder görs åt konsekvenserna som befolkningsutvecklingen medför. När det kommer på tal om åtgärderna som krävs, uppstår spänningar och konflikter i uppfattningar kring begreppen effektivitet/produktivitet, digitalisering, uppgiftsväxling och kvalitet i relation till resurser. Det kan ha sin grund i förekomst av olika gränsdragningsproblematik med olika rationalitet och stridande logiker som följd. / There are debates and discussions around that increased efficiency, productivity and digitalization are required to succeed with the welfare mission. The concepts are central and there is little individual based research on what these concepts stand for and mean in the daily work of various professionals in welfare services such as health and medical care and elderly care. The purpose of the present study is to take part of how the concepts are perceived by a small number of people who work at different levels in welfare services. This qualitative study with a phenomenographic approach is based on informants' perceptions. Conventional content analysis is used for analysis of collected data. The study's theoretical framework with connection to boundaries between economic and democratic values, the opposition between different rationality and conflicting logics is developed in associated with the analysis of the empirical material. The results show that although informants' awareness of the challenges of welfare varies, there is a general perception that a well-functioning health care and care for the elderly requires the right and sufficient competence. There is a general perception among informants that decision-makers need to invest more resources. The results also point to a perception that welfare can be maintained if sufficient measures are taken for the consequences that population development entails. When it comes to the measures required, tensions and conflicts arise in perceptions around the concepts of efficiency / productivity, digitization, task exchange and quality in relation to resources. These tensions and conflicts might be because of the existence of problems with different boundaries, problems with different rationality and conflicting logics.

Formal language theory, originally developed to model and study our natural spoken languages, is nowadays also put to use in many other fields. These include, but are not limited to, the definition and visualization of programming languages and the examination and verification of algorithms and systems. Formal languages are instrumental in proving the correct behavior of automated systems, e.g., to avoid that a flight guidance system navigates two airplanes too close to each other. This vast field of applications is built upon a very well investigated and coherent theoretical basis. It is the goal of this dissertation to add to this theoretical foundation and to explore ways to make formal languages and their models more expressive. More specifically, we are interested in models that are able to model quantitative features of the behavior of systems. To this end, we define and characterize weighted automata over structures with hierarchical information and over graphs. In particular, we study infinite nested words, operator precedence languages, and finite and infinite graphs. We show Büchi-like results connecting weighted automata and weighted monadic second order (MSO) logic for the respective classes of weighted languages over these structures. As special cases, we obtain Büchi-type equivalence results known from the recent literature for weighted automata and weighted logics on words, trees, pictures, and nested words. Establishing such a general result for graphs has been an open problem for weighted logics for some time. We conjecture that our techniques can be applied to derive similar equivalence results in other contexts like traces, texts, and distributed systems.

Description logics (DLs) are used to represent knowledge of an application domain and provide standard reasoning services to infer consequences of this knowledge. However, classical DLs are not suited to represent vagueness in the description of the knowledge. We consider a combination of DLs and Fuzzy Logics to address this task. In particular, we consider the t-norm-based semantics for fuzzy DLs introduced by Hájek in 2005. Since then, many tableau algorithms have been developed for reasoning in fuzzy DLs. Another popular approach is to reduce fuzzy ontologies to classical ones and use existing highly optimized classical reasoners to deal with them. However, a systematic study of the computational complexity of the different reasoning problems is so far missing from the literature on fuzzy DLs. Recently, some of the developed tableau algorithms have been shown to be incorrect in the presence of general concept inclusion axioms (GCIs). In some fuzzy DLs, reasoning with GCIs has even turned out to be undecidable. This work provides a rigorous analysis of the boundary between decidable and undecidable reasoning problems in t-norm-based fuzzy DLs, in particular for GCIs. Existing undecidability proofs are extended to cover large classes of fuzzy DLs, and decidability is shown for most of the remaining logics considered here. Additionally, the computational complexity of reasoning in fuzzy DLs with semantics based on finite lattices is analyzed. For most decidability results, tight complexity bounds can be derived.

Description logics knowledge bases are a popular approach to represent terminological and assertional knowledge suitable for computers to work with. Despite that, the practicality of description logics is impaired by the difficulties one has to overcome to construct such knowledge bases. Previous work has addressed this issue by providing methods to learn valid terminological knowledge from data, making use of ideas from formal concept analysis. A basic assumption here is that the data is free of errors, an assumption that can in general not be made for practical applications. This thesis presents extensions of these results that allow to handle errors in the data. For this, knowledge that is "almost valid" in the data is retrieved, where the notion of "almost valid" is formalized using the notion of confidence from data mining. This thesis presents two algorithms which achieve this retrieval. The first algorithm just extracts all almost valid knowledge from the data, while the second algorithm utilizes expert interaction to distinguish errors from rare but valid counterexamples.

Ontology-based data access (OBDA) augments classical query answering in databases by including domain knowledge provided by an ontology. An ontology captures the terminology of an application domain and describes domain knowledge in a machine-processable way. Formal ontology languages additionally provide semantics to these specifications. Systems for OBDA thus may apply logical reasoning to answer queries; they use the ontological knowledge to infer new information, which is only implicitly given in the data. Moreover, they usually employ the open-world assumption, which means that knowledge not stated explicitly in the data or inferred is neither assumed to be true nor false. Classical OBDA regards the knowledge however only w.r.t. a single moment, which means that information about time is not used for reasoning and hence lost; in particular, the queries generally cannot express temporal aspects. We investigate temporal query languages that allow to access temporal data through classical ontologies. In particular, we study the computational complexity of temporal query answering regarding ontologies written in lightweight description logics, which are known to allow for efficient reasoning in the atemporal setting and are successfully applied in practice. Furthermore, we present a so-called rewritability result for ontology-based temporal query answering, which suggests ways for implementation. Our results may thus guide the choice of a query language for temporal OBDA in data-intensive applications that require fast processing, such as context recognition.

Building and mantaining large-scale ontologies is an error-prone task. It is thus not uncommon to find unwanted or unexpected consequences that follow implicitely from the restrictions in the ontology. To understand and correct these consequences, it is helpful to find the specific portions of the ontology that are responsible for them. Axiom-pinpointing is the task of finding minimal subontologies that entail a given consequence, also called MinAs. In this work we look at the task of computing all the MinAs by means of modified decision procedures. We first show that tableaux- and automata-based decision procedures can be transformed into pinpointing algorithms that output a (compact) representation of the set of all MinAs. We then explore the complexity of the problem.

Büchi, Elgot and Trakhtenbrot provided a seminal connection between monadic second-order logic and finite automata for both finite and infinite words. This BET- Theorem has been extended by Lautemann, Schwentick and Thérien to context-free languages by introducing a monadic second-order logic with an additional existentially quantified second-order variable. This new variable models the stack of pushdown au- tomata. A fundamental study by Cohen and Gold extended the context-free languages to infinite words. Our first main result is a second-order logic in the sense of Lautemann, Schwentick and Thérien with the same expressive power as ω-context-free languages. For our argument, we investigate Greibach normal forms of ω-context-free grammars as well as a new type of Büchi pushdown automata, the simple pushdown automata. Simple pushdown automata do not use e-transitions and can change the stack only by at most one symbol. We show that simple pushdown automata of infinite words suffice to accept all ω-context-free languages. This enables us to use Büchi-type results recently developed for infinite nested words. In weighted automata theory, many classical results on formal languages have been extended into a quantitative setting. Weighted context-free languages of finite words trace back already to Chomsky and Schützenberger. Their work has been extended to infinite words by Ésik and Kuich. As in the theory of formal grammars, these weighted ω-context-free languages, or ω-algebraic series, can be represented as solutions of mixed ω-algebraic systems of equations and by weighted ω-pushdown automata. In our second main result, we show that (mixed) ω-algebraic systems can be trans- formed into Greibach normal form. We then investigate simple pushdown automata in the weighted setting. Here, we give our third main result. We prove that weighted simple pushdown automata of finite words recognize all weighted context-free languages, i.e., generate all algebraic series. Then, we show that weighted simple ω-pushdown automata generate all ω-algebraic series. This latter result uses the former result together with the Greibach normal form that we developed for ω-algebraic systems. As a fourth main result, we prove that for weighted simple ω-pushdown automata, Büchi-acceptance and Muller-acceptance are expressively equivalent. In our fifth main result, we derive a Nivat-like theorem for weighted simple ω- pushdown automata. This theorem states that the behaviors of our automata are precisely the projections of very simple ω-series restricted to ω-context-free languages. The last result, our sixth main result, is a weighted logic with the same expressive power as weighted simple ω-pushdown automata. To prove the equivalence, we use a similar result for weighted nested ω-word automata and apply our present result of expressive equivalence of Muller and Büchi acceptance.

Great challenges often require the combined strength of various actors. Especially in areas that are shaped by fast technological development such as the application of additive manufacturing (AM) in life sciences, the interplay of different fields of expertise, including experts from industry, academia and government, is needed. While the collaboration of diverse actors can constitute a vast potential for innovations, it also entails a major challenge to negotiate among diverse individual interest, backgrounds, beliefs, and value systems. One field of research that can help to understand the consequences of such differences in the interests and beliefs in organizational settings is the institutional logics perspective. Institutional logics account for broader institutional value systems that guide actors’ cognition and actions. When organizations embody multiple logics, scholars speak of logic multiplicity. However, the consequences for organizational functioning that arise from logic multiplicity are still discussed among scholars, ranging from an enhanced innovativeness, to an increased conflict potential and organizational dismiss. In order to better understand logic interaction and its implications for organizational functioning, an embedded-case study was conducted. The embedded-case study focused on AddLife at Uppsala University, a competence center in its early phases of formation which is concerned with the advancement of applications of AM in life sciences. Based on semi-structured interviews and documentational data, three different logics were captured for three main stakeholder groups in AddLife. Further, the interaction of these logics during the early phases of competence center formation was analyzed, corroborating the role of logic compatibility (whether logics imply consistent goals). This study’s findings suggest that common goals have been found in AddLife, but some differences regarding the different logics’ implied goals remain, stressing the role of active mediation. Further, the study suggests that building strong intra-organizational ties is pivotal during the early phases of competence center formation, proposing a framework that encompasses three main approaches to build such ties. The first approach is to create a sense of community, including to reinforce synergies, to ensure engagement, and to connect projects. The second approach is to establish an open communication flow which comprises to clarify roles, to encourage asking questions, and to match expectations. Finally, the third approach is to organize personal meetings in order to establish relationships in the first place and to enable discussions.

Syfte: Syftet med studien är att beskriva och förstå hur de sportsliga och ekonomiskalogikerna tar form, samt jämföra hur spänningen påverkar investeringsbeslut i svenska elitfotbollsklubbar.Metod: Studien har en kvalitativ ansats och genomfördes med hjälp av semistrukturerade intervjuer med respondenter från tre elitfotbollsklubbar i Allsvenskan och Superettan. Datainsamlades även in från litteratur och vetenskapliga artiklar.Teori: Den teoretiska referensramen utgörs av teorier om institutionella logiker, spänningen mellan logikerna i fotbollsklubbar och vilka sportsliga och ekonomiska förutsättningar somsvenska elitfotbollsklubbar står inför.Empiri: Studien innehåller intervjuer med fem respondenter från tre svenskaelitfotbollsklubbar. Två fotbollsklubbar från Allsvenskan samt en fotbollsklubb frånSuperettan. Respondenterna har haft befattningen ekonomichef, sportchef ellerstyrelsemedlem.Slutsats: Fotbollsklubbar är komplexa organisationer där verksamheten är en ideell föreningmen bedrivs som ett företag. Vid investeringar uppstår en spänning mellan sportslig ochekonomisk logik. Logikerna är situationsbaserade och den logik som prioriteras skiftarberoende på den sportsliga och ekonomiska situation som fotbollsklubbarna befinner sig i.Trots att det alltid är en balansgång mellan logikerna prioriteras ofta den ekonomiska logiken på grund utav fotbollsklubbarnas ekonomiska historia. Det är vanligt att arbeta medsin ungdomsakademi, eftersom att det är både ekonomiskt försvarbart och kan genereraintäkter vid en möjlig spelarförsäljning i framtiden.