Agile autonomous systems are emerging, such as unmanned aerial vehicles (UAVs), that must robustly perform tightly coordinated time-critical missions; for example, military surveillance or search-and-rescue scenarios. In the space domain, execution of temporally flexible plans has provided an enabler for achieving the desired coordination and robustness, in the context of space probes and planetary rovers, modeled as discrete systems. We address the challenge of extending plan execution to systems with continuous dynamics, such as air vehicles and robot manipulators, and that are controlled indirectly through the setting of continuous state variables.Systems with continuous dynamics are more challenging than discrete systems, because they require continuous, low-level control, and cannot be controlled by issuing simple sequences of discrete commands. Hence, manually controlling these systems (or plants) at a low level can become very costly, in terms of the number of human operators necessary to operate the plant. For example, in the case of a fleet of UAVs performing a search-and-rescue scenario, the traditional approach to controlling the UAVs involves providing series of close waypoints for each aircraft, which incurs a high workload for the human operators, when the fleet consists of a large number of vehicles.Our solution is a novel, model-based executive, called Sulu, that takes as input a qualitative state plan, specifying the desired evolution of the state of the system. This approach elevates the interaction between the human operator and the plant, to a more abstract level where the operator is able to “coach” the plant by qualitatively specifying the tasks, or activities, the plant must perform. These activities are described in a qualitative manner, because they specify regions in the plant’s state space in which the plant must be at a certain point in time. Time constraints are also described qualitatively, in the form of flexible temporal constraints between activities in the state plan. The design of low-level control inputs in order to meet this abstract goal specification is then delegated to the autonomous controller, hence decreasing the workload per human operator. This approach also provides robustness to the executive, by giving it room to adapt to disturbances and unforeseen events, while satisfying the qualitative constraints on the plant state, specified in the qualitative state plan.Sulu reasons on a model of the plant in order to dynamically generate near-optimal control sequences to fulfill the qualitative state plan. To achieve optimality and safety, Sulu plans into the future, framing the problem as a disjunctive linear programming problem. To achieve robustness to disturbances and maintain tractability, planning is folded within a receding horizon, continuous planning and execution framework. The key to performance is a problem reduction method based on constraint pruning. We benchmark performance using multi-UAV firefighting scenarios on a real-time, hardware-in-the-loop testbed. / SM thesis

Digitalisation in today’s society is constantly evolving. Research shows the positive effects of apps for people with cognitive impairments by enabling meaningful activities as well as increasing independence. The purpose of this study was to describe the occupational therapist's professional reasoning regarding the recommendation and use of apps to enable activity for people with a cognitive impairment. The study adopted a qualitative approach to capture the participants' reasoning whilst working with apps. The selection was carried out with purposeful selection based on the criteria set. A total of ten participants participated. Data was collected via semi-structured interviews with open-ended questions and then analysed with a qualitative content analysis. The analysis resulted in three categories; Identify the client's needs and prerequisites to promote activity, Match and customize the app for a sustainable use and The Occupational Therapist's prerequisites for using apps as an intervention. The results shows that the occupational therapist works closely with the client and its social network to match the appropriate app based on needs and conditions in activity. Furthermore, the occupational therapists see great benefits of using apps, primarily for the supportive features that can increase independence as well as the freedom of movement the app can contribute to. However, problem areas are in the form of uncertainty in app updates and difficulties in having sufficient knowledge of the available apps. The conclusion is that Occupational therapists in this study use a wide breadth in their reasoning. Where several aspects of the client's needs and prerequisites as well as the occupational therapist's own prerequisites are weighed together to use apps as intervention. This showed great complexity, as apps are a new and large area for the occupational therapists and therefore further studies are needed for more knowledge within the subject.

abstract: This dissertation describes an investigation of four students' ways of thinking about functions of two variables and rate of change of those two-variable functions. Most secondary, introductory algebra, pre-calculus, and first and second semester calculus courses do not require students to think about functions of more than one variable. Yet vector calculus, calculus on manifolds, linear algebra, and differential equations all rest upon the idea of functions of two (or more) variables. This dissertation contributes to understanding productive ways of thinking that can support students in thinking about functions of two or more variables as they describe complex systems with multiple variables interacting. This dissertation focuses on modeling the way of thinking of four students who participated in a specific instructional sequence designed to explore the limits of their ways of thinking and in turn, develop a robust model that could explain, describe, and predict students' actions relative to specific tasks. The data was collected using a teaching experiment methodology, and the tasks within the teaching experiment leveraged quantitative reasoning and covariation as foundations of students developing a coherent understanding of two-variable functions and their rates of change. The findings of this study indicated that I could characterize students' ways of thinking about two-variable functions by focusing on their use of novice and/or expert shape thinking, and the students' ways of thinking about rate of change by focusing on their quantitative reasoning. The findings suggested that quantitative and covariational reasoning were foundational to a student's ability to generalize their understanding of a single-variable function to two or more variables, and their conception of rate of change to rate of change at a point in space. These results created a need to better understand how experts in the field, such as mathematicians and mathematics educators, thinking about multivariable functions and their rates of change. / Dissertation/Thesis / Ph.D. Mathematics 2012

Nous proposons dans cette thèse une architecture pour le raisonnement incrémental sur des flux de triples. Afin de passer à l’échelle, elle est conçue sous la forme de modules indépendants, permettant l’exécution parallèle du raisonnement. Plusieurs instances d’une même règle peuvent être exécutées simultanément afin d’améliorer les performances. Nous avons également concentré nos efforts pour limiter la dispersion des doublons dans le système, problème récurrent du raisonnement. Pour cela, un triplestore partagé permet à chaque module de filtrer au plus tôt les doublons. La structure de notre architecture, organisée en modules indépendants par lesquels transitent les triples, lui permet de recevoir en entrée des flux de triples. Enfin, notre architecture est indépendante du fragment utilisé. Nous présentons trois modes d’inférence pour notre architecture. Le premier consiste à inférer l’ensemble des connaissances implicites le plus rapidement possible. Le second priorise l'inférence de certaines connaissances prédéterminées. Le troisième vise à maximiser la quantité de triples inférés par seconde. Nous avons implémenté l’architecture présentée à travers Slider, un raisonneur incrémental prenant nativement en charge les fragments ρdf et RDFS. Il peut être facilement étendu à des fragments plus complexes. Nos expérimentations ont montré une amélioration des performances de plus de 65% par rapport au raisonneur OWLIM-SE. Nous avons également mené des tests montrant que l’utilisation du raisonnement incrémental avec Slider apporte un avantage systématique aux performances par rapport au raisonnement par lots, quels que soient l’ontologie utilisée et le fragment appliqué / In this thesis, we propose an architecture for incremental reasoning on triple streams. To ensure scalability, it is composed of independent modules; thus allowing parallel reasoning. That is, several instances of a same rule can be simultaneously executed to enhance performance. We also focused our efforts to limit the duplicates spreading in the system, a recurrent issue for reasoning. To achieve this, we design a shared triplestore which allows each module to filter duplicates as soon as possible. The triples passes through the different independent modules of the architecture allows the reasoner to receive triple streams as input. Finally, our architecture is of agnostic nature regarding the fragment used for the inference. We also present three inference modes for our architecture: the first one infers all the implicit knowledge as fast as possible; the second mode should be used when the priority has to be defined for the inference of a specific type of knowledge; the third one proposes to maximize the amount of triples inferred per second. We implemented this architecture through Slider, an incremental reasoning natively supporting the fragments ρdf and RDFS: It can easily be extended to more complex fragments. Our experimentations show a 65% improvement over the reasoner OWLIM-SE. However, the recently published reasoner RDFox exhibits better performance, although this one does not provide prioritized inference. We also conducted experimentations showing that the use of incremental reasoning over batch-based reasoning offers systematically better performance for all the ontologies and fragments used

Abstract Ubiquitous computing transforms physical environments into smart spaces, supporting users in an unobtrusive fashion. Such support requires sensing and interpreting the situation of the user, and providing the required functionality utilizing resources available. In other words, context acquisition, context modelling, and context reasoning are required. This thesis explores rule-based context reasoning from three perspectives: to implement the functionality of ubiquitous applications, to support the creation of ubiquitous applications, and to achieve self-adaptation. First, implementing functionality with reasoning is studied by comparing an application equipped with rule-based reasoning with an application providing similar functionality with hard coded application logic. The scalability of rule-based reasoning is studied with a large-scale student assistant scenario. Reasoning with constrained resources is explored with an application that performs reasoning partially on mobile devices. Finally, distributing a reasoning component that supports smart space interaction is explored with centralized, hybrid, and distributed architectures. Second, the creation of applications with rule-based reasoning is explored. In the first study, rules support building applications from available services and resources based on the instructions that users give via physical user interfaces. The second study supports developers, by proposing middleware that dynamically selects services and data based on the rules written by application developers. Third, self-adaptation is explored with a conceptual framework that adds self-introspective monitoring and control to smart space applications. This framework is verified with simulation and theoretical studies, and an application that fuses diverse data to provide fuel-efficient driving recommendations and adapts decision-making based on the driver’s progress and feedback. The thesis’ contributions include demonstrative cases on using rule-based reasoning from different perspectives, different scales, and with different architectures. Frameworks, a middleware, simulations, and prototypes provide the concrete contribution of the thesis. Generally, the thesis contributes to understanding how rule-based reasoning can be used in ubiquitous computing. The results presented can be used as guidelines for developers of ubiquitous applications. / Tiivistelmä Jokapaikan tietotekniikka muokkaa fyysisen ympäristömme älykkääksi tilaksi, joka tukee käyttäjää häntä häiritsemättä. Tuki toteutetaan asentamalla ympäristöön käyttäjää ja ympäristöä havainnoivia laitteita, tulkitsemalla kerätyn tiedon perusteella käyttäjän tilanne ja tarjoamalla tilanteeseen sopiva toiminnallisuus käyttäen saatavilla olevia resursseja. Toisin sanoen, älykkään tilan on kyettävä tunnistamaan ja mallintamaan toimintatilanne sekä päättelemään toimintatilanteen perusteella. Tässä työssä tutkitaan sääntöpohjaista päättelyä toimintatilanteen perusteella sovellusten toiminnallisuuden toteutuksen, kehittämisen tuen sekä mukautuvuuden näkökulmista. Sovellusten toiminnallisuuden toteuttamista päättelemällä tutkitaan vertaamalla sääntöpohjaisen päättelyn avulla toteutettua toiminnallisuutta vastaavaan suoraan sovellukseen ohjelmoituun toiminnallisuuteen. Sääntöpohjaisen päättelyn skaalautuvuutta arvioidaan laajamittaisessa opiskelija-assistenttiskenaariossa. Niukkojen resurssien vaikutusta päättelyyn arvioidaan päättelemällä osittain mobiililaitteessa. Älykkään tilan vuorovaikutusta tukevan päättelykomponentin hajauttamista tutkitaan keskitetyn, hybridi- ja hajautetun arkkitehtuurin avulla. Sovelluskehityksen tukemiseksi päättelyn säännöt muodostetaan saatavilla olevista palveluista ja resursseista käyttäjän fyysisen käyttöliittymän välityksellä antamien ohjeiden mukaisesti. Toisessa tapauksessa sovelluskehitystä tuetaan väliohjelmistolla, joka valitsee palvelut ja datan dynaamisesti sovelluskehittäjien luomien sääntöjen perusteella. Mukautuvuutta tutkitaan tilan hallintaan ja itsehavainnointiin liittyvän toiminnallisuuden lisäämiseen pystyvän käsitteellisen kehyksen avulla. Kehyksen toiminta varmennetaan simulointien sekä teoreettisten tarkastelujen avulla. Toteutettu useita datalähteitä yhdistävä sovellus antaa ajoneuvon kuljettajalle polttoaineen kulutuksen vähentämiseen liittyviä suosituksia sekä mukautuu kuljettajan ajotavan kehityksen ja palautteen perusteella. Työssä on osoitettu sääntöpohjaisen päättelyn toimivuus eri näkökulmista, eri skaalautuvuuden asteilla sekä eri arkkitehtuureissa. Työn konkreettisia tuloksia ovat kehykset, väliohjelmistot, simuloinnit sekä prototyypit. Laajemmassa mittakaavassa työ edesauttaa ymmärtämään sääntöpohjaisen päättelyn soveltamista ja työn tuloksia voidaankin käyttää suosituksina sovelluskehittäjille.

We can classify several quite different calculi for automated reasoning in first-order logic as instantiation-based methods (IMs). Broadly speaking, unlike in traditional calculi such as resolution where the first-order satisfiability problem is tackled by deriving logical conclusions, IMs attempt to reduce the first-order satisfiability problem to propositional satisfiability by intelligently instantiating clauses. The Inst-Gen-Eq method is an instantiation-based calculus which is complete for first-order clause logic modulo equality. Its distinctive feature is that it combines first-order reasoning with efficient ground satisfiability checking, which is delegated in a modular way to any state-of-the-art ground solver for satisfiability modulo theories (SMT). The first-order reasoning modulo equality employs a superposition-style calculus which generates the instances needed by the ground solver to refine a model of a ground abstraction or to witness unsatisfiability. The thesis addresses the main issue in the Inst-Gen-Eq method, namely efficient extraction of instances, while providing powerful redundancy elimination techniques. To that end we introduce a novel labelled unit superposition calculus with sets, AND/OR trees and ordered binary decision diagrams (OBDDs) as labels. The different label structures permit redundancy elimination each to a different extent. We prove completeness of redundancy elimination from labels and further integrate simplification inferences based on term rewriting. All presented approaches, in particular the three labelled calculi are implemented in the iProver-Eq system and evaluated on standard benchmark problems.

There is contention surrounding two major questions in regard to voting behavior in American politics. First, are political advertisements efficacious? Second, do partisans interpret political information in a different way than those who do not identify with a political bias — that is, do partisans engage in partisan-motivated reasoning? As billions of dollars each American presidential election cycle are spent, and fierce competition pervades the elections, shedding light on these two questions is more essential than ever. This project focuses on coupling these questions together to investigate if individuals who identify with a political party reason in a partisan-motivated manner in response to political advertisements. Utilizing a novel survey instrument and originally designed political advertisements featuring the candidates of the 2020 Presidential election, I surveyed over 900 individuals to discern if partisan-motivated reasoning was operative. I found three key results. First, partisan-motivated reasoning was utilized by those who identified as Republican or Democratic, but not for those who did not identify as being a partisan of one of the major political parties. Second, Republicans and Democrats reason in distinct, separate manners. Republicans did not modify their responses after exposure to partisan-conforming political advertisements (Trump-source advertisements) but did modify their responses after receiving partisan-nonconforming political advertisements (Biden-source advertisements). Oppositely, Democrats did modify their responses after exposure to partisan-conforming political advertisements (Biden-source advertisements) but did not modify their responses after receiving partisan-nonconforming political advertisements (Trump-source advertisements). Third, and more broadly, political advertisements are indeed effective; over 85% of individuals changed their first responses after exposure to the political advertisements. Moreover, across treatments, more than 31% of individuals updated their first answers and submitted updated responses as the same statistic presented in the advertisement. In sum, this thesis helps to elucidate an understanding of how partisans understand political information, specifically in the format of a political advertisement.

These are the proceedings of the International Workshop on Reactive Concepts in Knowledge Representation (ReactKnow 2014), which took place on August 19th, 2014 in Prague, co-located with the 21st European Conference on Artificial Intelligence (ECAI 2014).

Abstract dialectical frameworks (ADFs) are a formalism for representing knowledge about abstract arguments and various logical relationships between them. This work studies ADFs in detail. Firstly, we use the framework of approximation fixpoint theory to define various semantics that are known from related knowledge representation formalisms also for ADFs. We then analyse the computational complexity of a variety of reasoning problems related to ADFs. Afterwards, we also analyse the formal expressiveness in terms of realisable sets of interpretations and show how ADFs fare in comparison to other formalisms. Finally, we show how ADFs can be put to use in instantiated argumentation, where researchers try to assign meaning to sets of defeasible and strict rules. The main outcomes of our work show that in particular the sublanguage of bipolar ADFs are a useful knowledge representation formalism with meaningful representational capabilities and acceptable computational properties.

The field of artificial intelligence, research on knowledge representation and reasoning has originated a large variety of formats, languages, and formalisms. Over the decades many different tools emerged to use these underlying concepts. Each one has been designed with some specific application in mind and are even used nowadays, where the internet is seen as a service to be sufficient for the age of Industry 4.0 and the Internet of Things. In that vision of a connected world, with these many different formalisms and systems, a formal way to uniformly exchange information, such as knowledge and belief is imperative. That alone is not enough, because even more systems get integrated into the online world and nowadays we are confronted with a huge amount of continuously flowing data. Therefore a solution is needed to both, allowing the integration of information and dynamic reaction to the data which is provided in such continuous data-flow environments. This work aims to present a unique and novel pair of formalisms to tackle these two important needs by proposing an abstract and general solution. We introduce and discuss reactive Multi-Context Systems (rMCS), which allow one to utilise different knowledge representation formalisms, so-called contexts which are represented as an abstract logic framework, and exchange their beliefs through bridge rules with other contexts. These multiple contexts need to mutually agree on a common set of beliefs, an equilibrium of belief sets. While different Multi-Context Systems already exist, they are only solving this agreement problem once and are neither considering external data streams, nor are they reasoning continuously over time. rMCS will do this by adding means of reacting to input streams and allowing the bridge rules to reason with this new information. In addition we propose two different kind of bridge rules, declarative ones to find a mutual agreement and operational ones for adapting the current knowledge for future computations. The second framework is more abstract and allows computations to happen in an asynchronous way. These asynchronous Multi-Context Systems are aimed at modelling and describing communication between contexts, with different levels of self-management and centralised management of communication and computation. In this thesis rMCS will be analysed with respect to usability, consistency management, and computational complexity, while we will show how asynchronous Multi-Context Systems can be used to capture the asynchronous ideas and how to model an rMCS with it. Finally we will show how rMCSs are positioned in the current world of stream reasoning and that it can capture currently used technologies and therefore allows one to seamlessly connect different systems of these kinds with each other. Further on this also shows that rMCSs are expressive enough to simulate the mechanics used by these systems to compute the corresponding results on its own as an alternative to already existing ones. For asynchronous Multi-Context Systems, we will discuss how to use them and that they are a very versatile tool to describe communication and asynchronous computation.