Problem: The process planning task for a given design problem in additive manufacturing can be greatly enhanced by referencing previously developed process plans. However, identifying appropriate process plans for the given design problem requires appropriate mapping between the design domain and the process planning domain. Hence, the objective of this research is to establish mathematical mapping between the design domain and the process planning domain such that the previously developed appropriate process plans can be identified for the given design task. Further more, identification of an appropriate mathematical theory that enables computational mapping between the two domains is of interest. Through such computational mapping, previously developed process plans are expected to be shared in a distributed environment using an open repository. Approach: The design requirements and process plans are discretized using empirical models that compute exact values of process variables for the given design requirements. Through this discretization, subsumption relations among the discretized design requirements and process plans are identified. Appropriate process plans for a given design requirement are identified by subsumption relations in the design requirements. Also, the design requirements that can be satisfied by the given process plans are identified by subsumption relations among the process plans. To computationally realize such mapping, a description logic (ALE) is identified and justified to represent and compute subsumption relation. Based on this investigation, a retrieval method (DFM framework) is realized that enables storage and retrieval of process plans. Validation: Theoretical and empirical validations are performed using the validation square method. For the theoretical validation, an appropriate description logic (ALE) is identified and justified. Also, subsumption utilization in mapping two domains and realizing the DFM framework is justified. For the empirical validation, the storing and retrieval performance of the DFM framework is tested to demonstrate its theoretical validity. Contribution: In this research, two areas of contributions are identified: DFM and engineering information management. In DFM, the retrieval method that relates the design problem to appropriate process plans through mathematical mapping between design and process planning domain is the major contribution. In engineering information management, the major contributions are the development of information models and the identification of their characteristics. Based on this investigation, an appropriate description logic (ALE) is selected and justified. Also, corresponding computational feasibility (non deterministic polynomial time) of subsumption is identified.

In the near future several Swedish family firms will face a need for succession. Many times there is no available successor within the family firm. Hiring a non-family CEO (NFC) is thus a solution to keep the firm within the family. Using a multiple case study with 6 participating family firms, we have identified how clashing logics between family business owners and NFCs, on the role of the NFC, influence their expectations and relationships. Clashing logics were often a source of disagreements and conflicts, leading to failure in the owner-NFC relationship. Furthermore, we have identified that the two parties often perceived the non-family CEO to offer more professional management which was a motive why family firms in this study hired NFCs. This perceived professionalism was also a reason for conflicting expectations. Adding to previous studies we also identified a series of influencing factors impacting the family business owner-NFC relationship. To conclude this study provides new insights for further research and practical recommendations for family firms in the process of hiring NFCs.

The role-based paradigm has been introduced for the design of adaptive and context sensitive software systems. Naturally, a system built on top of the paradigm is expected to thrive in dynamic environments. In consequence, reasoning services over temporal aspect are essential in such a system. To represent context-dependent domains, various extensions of Description Logics (DLs) with context are introduced and studied. We focus on the family of Contextualized Description Logics (ConDLs) that have been shown capable to represent role-based modelling languages while retaining decidability. However, reasoning problems over dynamic settings under the logics are rather unexplored.

Le développement de nouveaux formalismes logiques est au cœur de nombreuses problématiques de méthodes formelles. Ces formalismes doivent répondre à la fois à des impératifs de modélisation (ils doivent permettre de décrire certains systèmes) et de calcul (ils doivent fournir des méthodes de calcul correctes et complètes). Dans ce contexte, nous nous intéressons aux logiques de ressources, en particulier les logiques BI et BBI qui traitent du partage et de la séparation de ressources et qui ont conduit aux diverses logiques de séparation dont les applications à la vérification de programmes se sont développées fortement ces dernières années. Nous proposons dans cette thèse d’étudier, à partir des logiques BI et BBI, des logiques de séparation modales et épistémiques en se focalisant sur leurs capacités de modélisation et leur expressivité mais aussi les nouveaux calculs de preuve pour ces logiques. Une première étude a porté sur la modélisation de propriétés dynamiques de ressources au travers d’une nouvelle logique LTBI, qui est une logique de séparation temporelle, fondée sur la logique BI et des modalités temporelles. Cette logique offre notamment des perspectives intéressantes de modélisation temporelle branchante, permettant par exemple de caractériser les processus multi-thread. Une étude complémentaire a porté sur la modélisation de l’accès par des agents à des propriétés sous conditions de posséder certaines ressources, au travers d’une nouvelle logique ERL, qui est une logique de séparation épistémique, fondée sur la logique BBI et des modalités épistémiques. Cette logique permet de nombreuses modélisations de systèmes de contrôle d’accès. En vue d’étendre l’expressivité de telles logiques de séparation, comme la logique BBI et ses variantes, une étude sur l’internalisation des symboles de ressources dans la syntaxe de la logique a été développée au travers des nouvelles logiques HRL et HBBI (version hybride de BBI). L’internalisation permet à la fois d’étendre l’expressivité des logiques et d’axiomatiser la logique BBI et certaines de ses variantes. Outre la conception de ces logiques, l’étude de leur sémantique et aussi de leurs capacités de modélisation, une partie de cette thèse a été consacrée à la définition de calculs de preuve, ici de tableaux, pour ces nouvelles logiques ainsi qu’à leurs preuves de correction et de complétude / The design of new logical formalisms is at the heart of several problems in formal methods. Those formalisms must respond to requirements both concerning modelling (they must be able to describe certain systems) and computing (they must provide complete and sound calculus methods). In this context, we look at resource logics, and in particular BI and BBI logics, that deal with the separation and sharing of resources and have led to several separation logics whose applications to software verification have been widely developped recently. We propose in this thesis, starting from BI and BBI logics, to study some modal and epistemic separation logics by focusing on their modelling capacities and their expresiveness, as well as on the new proof calculi for those logics. A first study deals with the modelling of dynamic resource properties through new logic LTBI, which is a temporal separation logic, based on BI logic and temporal modalities. This logic notably offers interesting perspectives in temporal branching modelling, allowing for instance to characterize multi-thread processes. A complementary study concerns the modelling of access by agents to properties under the conditions of posessing some resources, through a new logic ERL, which is an epistemic separation logic, based on BBI logic and epistemic modalities. This logic allows many modellings of access control systems. In order to extend the expressivity of such separation logics, like BBI logic and its variants, a study on the internalization of resources symbols in the logic’s syntax has been developed through the new logics HRL and HBBI (hybrid version of BBI). Internalization allows both the extension of the expressivity of logics and the axiomatisation of BBI logic and some of its variants. In addition to the conception of those logics, the study of their semantics and their modelling capacities, a part of this thesis is dedicated to the definition of proof calculs, here tableaux calculus, for those new logics, as well as their proof of soundness and completeness

Made available in DSpace on 2015-03-03T15:47:48Z (GMT). No. of bitstreams: 1 AdrianoAD_DISSERT.pdf: 771338 bytes, checksum: 06adea5feab9914c5a48eb146511b556 (MD5) Previous issue date: 2013-11-19 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / I thank to my advisor, Jo?o Marcos, for the intellectual support and patience that devoted me along graduate years. With his friendship, his ability to see problems of the better point of view and his love in to make Logic, he became a great inspiration for me. I thank to my committee members: Claudia Nalon, Elaine Pimentel and Benjamin Bedregal. These make a rigorous lecture of my work and give me valuable suggestions to make it better. I am grateful to the Post-Graduate Program in Systems and Computation that accepted me as student and provided to me the propitious environment to develop my research. I thank also to the CAPES for a 21 months fellowship. Thanks to my research group, LoLITA (Logic, Language, Information, Theory and Applications). In this group I have the opportunity to make some friends. Someone of them I knew in my early classes, they are: Sanderson, Haniel and Carol Blasio. Others I knew during the course, among them I?d like to cite: Patrick, Claudio, Flaulles and Ronildo. I thank to Severino Linhares and Maria Linhares who gently hosted me at your home in my first months in Natal. This couple jointly with my colleagues of student flat Fernado, Don?tila and Aline are my nuclear family in Natal. I thank my fianc?e Lucl?cia for her precious a ective support and to understand my absence at home during my master. I thank also my parents Manoel and Zenilda, my siblings Alexandre, Paulo and Paula.Without their confidence and encouragement I wouldn?t achieve success in this journey. If you want the hits, be prepared for the misses Carl Yastrzemski / Esta disserta??o trata do enriquecimento de l?gicas modais. O termo enriquecimento ? usado em dois sentidos distintos. No primeiro deles, de fundo sem?ntico, propomos uma sem?ntica difusa para diversas l?gicas modais normais e demonstramos um resultado de completude para uma extensa classe dessas l?gicas enriquecidas com m?ltiplas inst?ncias do axioma da conflu?ncia. Um fato curioso a respeito dessa sem?ntica ? que ela se comporta como as sem?nticas de Kripke usuais. O outro enriquecimento diz respeito ? expressividade da l?gica e se d? por meio da adi??o de novos conectivos, especialmente de nega??es modais. Neste sentido, estudamos inicialmente o fragmento da l?gica cl?ssica positiva estendido com uma nega??o modal paraconsistente e mostramos que essa linguagem ? forte o suficiente para expressar as linguagens modais normais. Vemos que tamb?m ? poss?vel definir uma nega??o modal paracompleta e conectivos de restaura??o que internalizam as no??es de consist?ncia e determina??o a n?vel da linguagem-objeto. Esta l?gica constitui-se em uma L?gica da Inconsist?ncia Formal e em uma L?gica da Indetermina??o Formal. Em tais l?gicas, com o objetivo de recuperar infer?ncias cl?ssicas perdidas, demonstram-se Teoremas de Ajuste de Derivabilidade. No caso da l?gica estendida com uma nega??o paraconsistente, se removermos a implica??o ainda lidaremos com uma linguagem bastante rica, com ambas nega??es paranormais e seus respectivos conectivos de restaura??o. Sobre esta linguagem estudamos a l?gica modal normal minimal definida por meio de um c?lculo de Gentzen apropriado, ? diferen?a dos demais sistemas estudados at? ent?o, que s?o apresentados via c?lculo de Hilbert. Em seguida ap?s demonstrarmos a completude do sistema dedutivo associado a este c?lculo, introduzimos algumas extens?es desse sistema e buscamos Teoremas de Ajuste de Derivabilidade adequados

A reactive control system is a computer system reacting to certain stimuli emitted by its environment in order to maintain it in a desired state. Distributed reactive control systems are generally composed of several processes, running in parallel on one or more computers, communicating with one another to perform the required control task. By their very nature, distributed reactive control systems are hard to design. Their distributed nature and/or the communication scheme used can introduce subtle unforeseen behaviours. When dealing with critical applications, such as plane control systems, or traffic light control systems, those unintended behaviours can have disastrous consequences. It is therefore essential, for the designer, to ensure that this does not happen. For that purpose, rigorous and systematic techniques can (and should) be applied as early as possible in the development process. In that spirit, this work aims at providing the designer with the necessary tools in order to facilitate the development and validation of such distributed reactive control systems. In particular, we show how using a dedicated language called dSL (Distributed Supervision language) can be used to ease the development process. We also study how validations techniques such as model-checking and testing can be applied in this context.

In concurrency theory—the branch of (theoretical) computer science that studies the logical and mathematical foundations of parallel computation—there are two main formal ways of modelling the behaviour of systems where multiple actions or events can happen independently and at the same time: either with interleaving or with partial order semantics. On the one hand, the interleaving semantics approach proposes to reduce concurrency to the nondeterministic, sequential computation of the events the system can perform independently. On the other hand, partial order semantics represent concurrency explicitly by means of an independence relation on the set of events that the system can execute in parallel; following this approach, the so-called ‘true concurrency’ approach, independence or concurrency is a primitive notion rather than a derived concept as in the interleaving framework. Using interleaving or partial order semantics is, however, more than a matter of taste. In fact, choosing one kind of semantics over the other can have important implications—both from theoretical and practical viewpoints—as making such a choice can raise different issues, some of which we investigate here. More specifically, this thesis studies concurrent systems with partial order semantics and focuses on their bisimulation and model-checking problems; the theories and techniques herein apply, in a uniform way, to different classes of Petri nets, event structures, and transition system with independence (TSI) models. Some results of this work are: a number of mu-calculi (in this case, fixpoint extensions of modal logic) that, in certain classes of systems, induce exactly the same identifications as some of the standard bisimulation equivalences used in concurrency. Secondly, the introduction of (infinite) higher-order logic games for bisimulation and for model-checking, where the players of the games are given (local) monadic second-order power on the sets of elements they are allowed to play. And, finally, the formalization of a new order-theoretic concurrent game model that provides a uniform approach to bisimulation and model-checking and bridges some mathematical concepts in order theory with the more operational world of games. In particular, we show that in all cases the logic games for bisimulation and model-checking developed in this thesis are sound and complete, and therefore, also determined—even when considering models of infinite state systems; moreover, these logic games are decidable in the finite case and underpin novel decision procedures for systems verification. Since the mu-calculi and (infinite) logic games studied here generalise well-known fixpoint modal logics as well as game-theoretic decision procedures for analysing concurrent systems with interleaving semantics, this thesis provides some of the groundwork for the design of a logic-based, game-theoretic framework for studying, in a uniform manner, several concurrent systems regardless of whether they have an interleaving or a partial order semantics.

In the thesis, we explore reasoning about and handling of algebraic effects. Those are computational effects, which admit a representation by an equational theory. Their examples include exceptions, nondeterminism, interactive input and output, state, and their combinations. In the first part of the thesis, we propose a logic for algebraic effects. We begin by introducing the a-calculus, which is a minimal equational logic with the purpose of exposing distinct features of algebraic effects. Next, we give a powerful logic, which builds on results of the a-calculus. The types and terms of the logic are the ones of Levy’s call-by-push-value framework, while the reasoning rules are the standard ones of a classical multi-sorted first-order logic with predicates, extended with predicate fixed points and two principles that describe the universality of free models of the theory representing the effects at hand. Afterwards, we show the use of the logic in reasoning about properties of effectful programs, and in the translation of Moggi’s computational ¸-calculus, Hennessy-Milner logic, and Moggi’s refinement of Pitts’s evaluation logic. In the second part of the thesis, we introduce handlers of algebraic effects. Those not only provide an algebraic treatment of exception handlers, but generalise them to arbitrary algebraic effects. Each such handler corresponds to a model of the theory representing the effects, while the handling construct is interpreted by the homomorphism induced by the universal property of the free model. We use handlers to describe many previously unrelated concepts from both theory and practice, for example CSS renaming and hiding, stream redirection, timeout, and rollback.

Description Logics (DLs) are a family of logic-based knowledge representation languages used to describe the knowledge of an application domain and reason about it in formally well-defined way. They allow users to describe the important notions and classes of the knowledge domain as concepts, which formalize the necessary and sufficient conditions for individual objects to belong to that concept. A variety of different DLs exist, differing in the set of properties one can use to express concepts, the so-called concept constructors, as well as the set of axioms available to describe the relations between concepts or individuals. However, all classical DLs have in common that they can only express exact knowledge, and correspondingly only allow exact inferences. Either we can infer that some individual belongs to a concept, or we can't, there is no in-between. In practice though, knowledge is rarely exact. Many definitions have their exceptions or are vaguely formulated in the first place, and people might not only be interested in exact answers, but also in alternatives that are "close enough". This thesis is aimed at tackling how to express that something "close enough", and how to integrate this notion into the formalism of Description Logics. To this end, we will use the notion of similarity and dissimilarity measures as a way to quantify how close exactly two concepts are. We will look at how useful measures can be defined in the context of DLs, and how they can be incorporated into the formal framework in order to generalize it. In particular, we will look closer at two applications of thus measures to DLs: Relaxed instance queries will incorporate a similarity measure in order to not just give the exact answer to some query, but all answers that are reasonably similar. Prototypical definitions on the other hand use a measure of dissimilarity or distance between concepts in order to allow the definitions of and reasoning with concepts that capture not just those individuals that satisfy exactly the stated properties, but also those that are "close enough".

Tidigare forskning visar att äldreomsorgspersonal kämpar med två typer av logiker: en ekonomisk logik och en omsorgslogik. Även om båda logikerna behövs för att skapa god omsorg så utmanar de varandra. Dessa utmaningar kommer till uttryck i omsorgspraktiken där personalen ställs in för val och måste göra prioriteringar. Denna avhandling syftar till att förstå hur äldreomsorgspersonal beskriver att de arbetar för att finna balans mellan logikerna och hur de rättfärdigar sina prioriteringar i omsorgen om de äldre personerna. Frågeställningen för avhandlingen är att ta reda på hur personal och enhetschef vid ett kommunalt äldreboende förstår och hanterar interaktionen mellan de två logiker som styr omsorgsarbetet för att främja de äldre personernas välbefinnande. Syftet innehåller tre delsyften: 1) att analysera personalens erfarenheter av och meningsskapande kring de äldre personernas välbefinnande och deras reflektioner kring det omsorgsarbete de utför, 2) att belysa och problematiserade logiker som styr omsorgsarbetet samt 3) att analysera hur personalen rättfärdigar sina prioriteringar i rådande kontext och hur deras förklarbarhet påverkar deras professionella identiteter. Målet är att bidra med socialvetenskaplig kunskap om de överväganden personal gör när de ställs inför att göra prioriteringar i äldreomsorgens praktik. Material samlades in genom 12 individuella intervjuer med personal vid ett kommunalt äldreboende, en intervju med personalens enhetschef och en uppföljande gruppintervju med tre personer ur personalgruppen. Materialet analyserades med tre analysmetoder: fenomenologisk analys, reflexiv analys och positioneringsanalys. Resultatet visar att personalen definierar de äldre personernas välbefinnande som ett behov av att känna sig existentiellt berörd. Denna känsla av existentiell beröring delas in i tre delar: känsla av valfrihet, känsla av njutning och känsla av närhet till någon eller något. Arbetet för att uppnå detta välbefinnande beskrivs innebära ett balanserande av tre tvetydigheter: att vilja värna om de äldre personernas valfrihet och samtidigt hantera institutionella begränsningar, de äldre personernas behov av aktivering å ena sidan och att de inte behöver aktiveras å andra sidan samt att förstå de äldre personernas behov av rutiner samtidigt som det är svårt att veta vilka behov de har. Tvetydigheterna kontextualiserades och de två logikerna som styr omsorgsarbetet analyserades. Analysen visar att enhetschefen skapar en hybrid av den ekonomiska logiken och omsorgslogiken; ekonomi är omsorg och vice versa. Denna hybrid möter motstånd från personalen som skiljer på de båda logikerna genom att tala om ”vård och det där andra”. Personalen upplever att den ekonomiska logiken begränsar deras möjligheter att utföra omsorg i linje med omsorgslogiken. Motsättningar mellan de båda logikerna leder till prioriteringar som rättfärdigas av personalen i syfte att behålla de professionella identiteterna. Den teoretiska analysen bygger på teorier om institutionella logiker, förklarbarhet ochprofessionell identitet. Analyserna visar vikten av att väcka dialog mellan enhetschefer och personal där de diskuterar innebörder av olika värdeord som används på politisk nivå. Sådana diskussioner skulle kunna bidra till mindre motstånd och en högre överensstämmelse mellan verksamhetsmål och praktik. Avhandlingen visar även vikten av att förstå logiker som vertikala istället för horisontellt uppdelade. Alltså, att styrande verksamhetslogiker existerar uppifrån och ned i verksamheter (från politisk nivå till chefsnivå och till praktisk nivå) och att de inte kan delas in i exempelvis en professionslogik och en styrningslogik. Den senare synen kan bidra till potentiella missförstånd eftersom det gör att konflikter kan tolkas existera mellan personal och chef, medan de egentligen existerar mellan olika motstridiga värderingssystem. Slutsatsen är att de båda logikerna behövs för att stödja äldre personers välbefinnande. Ibland är logikerna samspelta och ibland är de i konflikt med varandra. När logikerna ställs mot varandra är det av vikt att komma ihåg att den ekonomiska logiken är lika förhandlingsbar som omsorgslogiken. De två logikerna existerar i samspel och om deras motstridigheter inte belyses finns risk att omsorgspraktiken inte stödjer de äldre personernas välbefinnande. / This dissertation aims at contributing to social scientific knowledge about prevailing prioritizations in eldercare practice by looking at an economic and a caring logic, and how these logics are overlapping, contradictory or come in conflict with each other. A more concrete aim is to understand how the personnel describe their work with or for balance between the logics and their justifications prioritizations made in the care of older persons. The research question is: How do personnel and care unit manager at a public nursing home understand and handle the two logics that govern care work for facilitating wellbeing of the residents. The aim and research question led to three sub-aims: 1) to analyze the personnel’s experiences of and meaning making about the care work they carry out, 2) to illuminate and problematize the two logics above, and 3) to analyze how the personnel justify their prioritizations in prevailing context, and how their accountability have an effect on their professional identities. Empirical material was gathered through 13 individual interviews with care personnel and their care unit manager at a public nursing home in Sweden. These interviews were complemented by a group interview. The material was analyzed by the use of three methods: phenomenology (Paper I and II), reflexive analysis (Paper III), and a positioning analysis (Paper IV). Paper I found that the personnel understands the residents’ well-being as being characterized by feeling of being existentially touched. This essence is constituted by feeling freedom of choice, pleasure, and closeness to someone or something. In Paper II, the work for facilitating this kind of wellbeing was characterized by three ambiguities: (i) freedom of choice for the older persons vs. institutional constraints, (ii) the residents' need for activation vs. wanting not to be activated, and (iii) the residents' need for routine vs. the eldercarers' not being able to know what the residents need. Paper III showed that the care unit manager created a hybrid of the two logics (economy is care and vice versa) and that the personnel oppose this hybrid. The opposition is shaped as the personnel divides their work in care and “those other things”. These findings showed how interaction between the logics expresses itself in practice and that it is the personnel who has to handle contradictions between the logics in their everyday care work. The positioning analysis in Paper IV had three levels. The first level showed how the carers align with their peers and that they find the organizational frame, within which they have agency, changed due to increased workload. This change led to an order of priorities. The second level showed that the carers relate to three aspects when making accounts: the care itself, the older persons, and the media. The third level showed that the carers share a view of administration, cleaning, serving meals, and filling up supplies, as not being parts of caring. The dissertation’s theoretical framework focused on theories on logics, accountability, and professional identity. The conclusion is that both logics are needed in order to facilitate the well-being of the older persons. The relationships between the two logics are not always clear and if their contradictions are not illuminated, there is a risk for a care practice that does not facilitate the well-being of their residents. An important theoretical contribution is that logics of activities should be understood vertically (form political, through management, and down to the level of practice) instead of horizontally. The practical implications emphasize the importance of supporting the personnel’s professional identity on the one hand, and discussing the logics on the other. By understanding differences between definitions on management-level and practice level, a homogeneity can be reached.