The belief bias effect – the finding that prior beliefs influence judgments of logic and evidence – has been a topic of much empirical investigation in both deductive and causal reasoning. However, to date, no research has examined the degree to which such biases are the result of common or distinct mechanisms in these two domains. By using common scales of measurement, I examine the degree to which individuals show common biases in these two domains in two experiments. Surprisingly, although the belief bias effect was observed in both paradigms, biases in one domain were unreliably associated with biases in the other domain. Experiment 2 included 6 measures of individual differences in an attempt to uncover the observation of differential biases in these domains. Dogmatism was found to be the single most predictive measure of belief bias, but only in deductive reasoning. These data are discussed in terms of dual process theories of reasoning.

The belief bias effect – the finding that prior beliefs influence judgments of logic and evidence – has been a topic of much empirical investigation in both deductive and causal reasoning. However, to date, no research has examined the degree to which such biases are the result of common or distinct mechanisms in these two domains. By using common scales of measurement, I examine the degree to which individuals show common biases in these two domains in two experiments. Surprisingly, although the belief bias effect was observed in both paradigms, biases in one domain were unreliably associated with biases in the other domain. Experiment 2 included 6 measures of individual differences in an attempt to uncover the observation of differential biases in these domains. Dogmatism was found to be the single most predictive measure of belief bias, but only in deductive reasoning. These data are discussed in terms of dual process theories of reasoning.

Reliable hydrological model simulations are the result of numerous complex interactions among hydrological inputs, landscape properties, and initial conditions. Determination of the effects of these factors is one of the main challenges in hydrological modelling. This situation becomes even more difficult in cold regions due to the ungauged nature of subarctic and arctic environments.<p> This research work is an attempt to apply a new approach for modelling snowcover ablation and snowmelt runoff in complex subarctic environments with limited data while retaining integrity in the process representations. The modelling strategy is based on the incorporation of both detailed process understanding and inputs along with information gained from observations of basin-wide streamflow phenomenon; essentially a combination of deductive and inductive approaches. The study was conducted in the Wolf Creek Research Basin, Yukon Territory, using three models, a small-scale physically based hydrological model, a land surface scheme, and a land surface hydrological model. The spatial representation was based on previous research studies and observations, and was accomplished by incorporating landscape units, defined according to topography and vegetation, as the spatial model elements.<p> Comparisons between distributed and aggregated modelling approaches showed that simulations incorporating distributed initial snowcover and corrected solar radiation were able to properly simulate snowcover ablation and snowmelt runoff whereas the aggregated modelling approaches were unable to represent the differential snowmelt rates and complex snowmelt runoff dynamics. Similarly, the inclusion of spatially distributed information in a land surface scheme clearly improved simulations of snowcover ablation. Application of the same modelling approach at a larger scale using the same landscape based parameterisation showed satisfactory results in simulating snowcover ablation and snowmelt runoff with minimal calibration. Verification of this approach in an arctic basin illustrated that landscape based parameters are a feasible regionalisation framework for distributed and physically based models. In summary, the proposed modelling philosophy, based on the combination of an inductive and deductive reasoning, is a suitable strategy for reliable predictions of snowcover ablation and snowmelt runoff in cold regions and complex environments.

No description available.

Este trabalho apresenta o estudo e a construção de um Sistema Gerenciador de Bancos de Dados Dedutivos. Um Banco de Dados Dedutivo (BDD) é um Banco de Dados que, alem de sua parte tradicional, ou seja, as informações contidas nas relações básicas, que são explicitamente inseridas, possui um conjunto de regras dedutivas que permite derivar novas informações a partir das relações básicas. Neste trabalho, as deficiências da linguagem de consulta Datalog foram identificadas e, com o objetivo de obter uma linguagem que atenda melhor algumas das necessidades de aplicações do mundo real, foram propostas extensões ao Datalog, que deram origem a linguagem DEDALO. As atualizações sobre Bancos de Dados Dedutivos também foram estudadas, sendo identificados dois problemas: o primeiro se refere a necessidade de propagar modificações sobre as relações básicas para as relações derivadas materializadas; o segundo problema diz respeito as atualizações sobre as relações derivadas, que devem ser traduzidas em atualizações sobre as relações básicas, para que a atualização pretendida se tome visível na relação derivada. Para o primeiro problema, métodos de propagação foram estudados, analisados e implementados. Para o segundo, foram estudados, analisados, propostos e implementados métodos que realizam a tradução das atualizações. Restrições de integridade em Bancos de Dados Dedutivos tamb6m foram estudadas, sendo propostos métodos eficientes de detecção de violações de integridade e de reparos de transações que violam as restrições definidas no sistema. Os estudos realizados deram origem ao Sistema Gerenciador de Banco de Dados Dedutivo DEDALO, um protótipo que implementa a nova linguagem proposta Como uma extensão do Datalog, os métodos de propagação de atualizações para relações derivadas materializadas, as técnicas de tradução de atualizações sobre relações derivadas, os métodos de detecção de violação de restrições de integridade e as técnicas de reparo das transações que as violam. 0 Sistema DEDALO é composto de quatro ferramentas: o Gerenciador de Regras, onde as regras de derivação e as restrições de integridade são definidas; a Interface Interativa, utilizada para submeter consultas ad hoc e solicitações de atualização sobre o sistema; dois novos Componentes Delphi, que são duas novas classes criadas para o ambiente de desenvolvimento de aplicações Delphi, que foi utilizado na implementação do protótipo, e são utilizadas para a criação das aplicações sobre o Sistema DEDALO; e o Tradutor de Sentenças DEDALOISQL-ANSI, que traduz as sentenças da linguagem proposta para sentenças SQL-ANSI que serão submetidas ao Sistema Gerenciador do Banco de Dados. A adequabilidade das soluções estudadas e implementadas no sistema desenvolvido pode ser comprovada através da implementação de uma aplicação real utilizando o Sistema DEDALO. / This work presents the study and construction of a Deductive Database Management System. A Deductive Database (BDD) is a Database that; besides the traditional part, where the informations are contained in basic relations, explicitly introduced, has a deductive rules set, which permits to derive new informations from the basic relations. In this work, the deficiencies of Datalog language were identified and, with the goal of obtaining a language which could better support some real world applications requirements, extensions to Datalog were proposed, which originate the DEDALO language. Deductive Databases updates were also studied and two problems were identified: the first one refers to the need of propagating updates over basic relations to the materialized derived relations; the second problem refers to the updates over derived relations, which must be translated in updates over basic relations, in order that the requested update become visible in the derived relation. For the first problem, propagation methods were studied, analyzed and implemented. For the second, methods for carrying out updates translation were studied, analyzed, proposed and implemented. Integrity Constraints in Deductive Database Systems were also studied and methods were proposed in order to detect and repair system defined integrity constraints violations. Through the studies related above was created DEDALO Deductive Database Management System, a prototype that implements the new language, proposed as a Datalog extension. The prototype also contains the implementation of updates propagation methods for materialized derived relations, the translation techniques of updates over derived relations, the integrity constraints violation detection methods and the repairing techniques for the transactions that violate the constraints. The DEDALO System is composed of four tools: the Rules Manager, where derivation rules and integrity constraints are defined; the Interactive Interface, used for submit ad hoc queries and updates request to the system; two new Delphi Components, which are two new classes created for the application development environment Delphi, which was used in the prototype implementation, and are used in the applications creation over the DEDALO System; and the DEDALO/SQL-ANSI Statements Translator, which translate the statements of the proposed language to SQL-ANSI statements, which will be submitted to the Database Management System. The adequacy of the solutions studied and implemented in the prototype system was verified by the implementation of an application using the DEDALO System.

Este trabalho apresenta o estudo e a construção de um Sistema Gerenciador de Bancos de Dados Dedutivos. Um Banco de Dados Dedutivo (BDD) é um Banco de Dados que, alem de sua parte tradicional, ou seja, as informações contidas nas relações básicas, que são explicitamente inseridas, possui um conjunto de regras dedutivas que permite derivar novas informações a partir das relações básicas. Neste trabalho, as deficiências da linguagem de consulta Datalog foram identificadas e, com o objetivo de obter uma linguagem que atenda melhor algumas das necessidades de aplicações do mundo real, foram propostas extensões ao Datalog, que deram origem a linguagem DEDALO. As atualizações sobre Bancos de Dados Dedutivos também foram estudadas, sendo identificados dois problemas: o primeiro se refere a necessidade de propagar modificações sobre as relações básicas para as relações derivadas materializadas; o segundo problema diz respeito as atualizações sobre as relações derivadas, que devem ser traduzidas em atualizações sobre as relações básicas, para que a atualização pretendida se tome visível na relação derivada. Para o primeiro problema, métodos de propagação foram estudados, analisados e implementados. Para o segundo, foram estudados, analisados, propostos e implementados métodos que realizam a tradução das atualizações. Restrições de integridade em Bancos de Dados Dedutivos tamb6m foram estudadas, sendo propostos métodos eficientes de detecção de violações de integridade e de reparos de transações que violam as restrições definidas no sistema. Os estudos realizados deram origem ao Sistema Gerenciador de Banco de Dados Dedutivo DEDALO, um protótipo que implementa a nova linguagem proposta Como uma extensão do Datalog, os métodos de propagação de atualizações para relações derivadas materializadas, as técnicas de tradução de atualizações sobre relações derivadas, os métodos de detecção de violação de restrições de integridade e as técnicas de reparo das transações que as violam. 0 Sistema DEDALO é composto de quatro ferramentas: o Gerenciador de Regras, onde as regras de derivação e as restrições de integridade são definidas; a Interface Interativa, utilizada para submeter consultas ad hoc e solicitações de atualização sobre o sistema; dois novos Componentes Delphi, que são duas novas classes criadas para o ambiente de desenvolvimento de aplicações Delphi, que foi utilizado na implementação do protótipo, e são utilizadas para a criação das aplicações sobre o Sistema DEDALO; e o Tradutor de Sentenças DEDALOISQL-ANSI, que traduz as sentenças da linguagem proposta para sentenças SQL-ANSI que serão submetidas ao Sistema Gerenciador do Banco de Dados. A adequabilidade das soluções estudadas e implementadas no sistema desenvolvido pode ser comprovada através da implementação de uma aplicação real utilizando o Sistema DEDALO. / This work presents the study and construction of a Deductive Database Management System. A Deductive Database (BDD) is a Database that; besides the traditional part, where the informations are contained in basic relations, explicitly introduced, has a deductive rules set, which permits to derive new informations from the basic relations. In this work, the deficiencies of Datalog language were identified and, with the goal of obtaining a language which could better support some real world applications requirements, extensions to Datalog were proposed, which originate the DEDALO language. Deductive Databases updates were also studied and two problems were identified: the first one refers to the need of propagating updates over basic relations to the materialized derived relations; the second problem refers to the updates over derived relations, which must be translated in updates over basic relations, in order that the requested update become visible in the derived relation. For the first problem, propagation methods were studied, analyzed and implemented. For the second, methods for carrying out updates translation were studied, analyzed, proposed and implemented. Integrity Constraints in Deductive Database Systems were also studied and methods were proposed in order to detect and repair system defined integrity constraints violations. Through the studies related above was created DEDALO Deductive Database Management System, a prototype that implements the new language, proposed as a Datalog extension. The prototype also contains the implementation of updates propagation methods for materialized derived relations, the translation techniques of updates over derived relations, the integrity constraints violation detection methods and the repairing techniques for the transactions that violate the constraints. The DEDALO System is composed of four tools: the Rules Manager, where derivation rules and integrity constraints are defined; the Interactive Interface, used for submit ad hoc queries and updates request to the system; two new Delphi Components, which are two new classes created for the application development environment Delphi, which was used in the prototype implementation, and are used in the applications creation over the DEDALO System; and the DEDALO/SQL-ANSI Statements Translator, which translate the statements of the proposed language to SQL-ANSI statements, which will be submitted to the Database Management System. The adequacy of the solutions studied and implemented in the prototype system was verified by the implementation of an application using the DEDALO System.

The aim of this study is to examine how inductive and deductive concreteization as a didactic method in mathematics teaching can promote the development of knowledge and learning among students. It is also of interest to hear a number of interviewed teachers perceptions about inductive and deductive concretization as a method in mathematics teaching. The examination is for grades 1-3. Theories dealt with in the study are learning promoting theories such as concretization, proximal development zone, conceptualization and creative reasoning.The study's questions will therefore examine:· How can inductive and deductive concretization as a didactic method in mathematics teaching promote the development of knowledge and learning to students?· What perceptions do teachers in grades 1-3 have regarding inductive and deductive concretization as a method of mathematics teaching? In order to answer the study's questions, qualitative methods have been used through interviews with teachers and observations in classrooms. The conclusions of the analysis of material shows that concretization through inductive and deductive methods helps students to participate in situations where different mathematical didactic consequences arise in the teaching based on the theories.

The main aim of this study is to investigate human understanding of process models and to develop an improved understanding of its relevant influence factors. Aided by assumptions from cognitive psychology, this article attempts to address specific deductive reasoning difficulties based on process models. The authors developed a research model to capture the influence of two effects on the cognitive difficulty of reasoning tasks: (i) the presence of different control-flow patterns (such as conditional or parallel execution) in a process model and (ii) the interactivity of model elements. Based on solutions to 61 different reasoning tasks by 155 modelers, the results from this study indicate that the presence of certain control-flow patterns influences the cognitive difficulty of reasoning tasks. In particular, sequence is relatively easy, while loops in a model proved difficult. Modelers with higher process modeling knowledge performed better and rated subjective difficulty of loops lower than modelers with lower process modeling knowledge. The findings additionally support the prediction that interactivity between model elements is positively related to the cognitive difficulty of reasoning. Our research contributes to both academic literature on the comprehension of process models and practitioner literature focusing on cognitive difficulties when using process models.

Cette thèse s'inscrit dans le domaine de la vérification formelle de programmes parallèles. L'enjeu de la vérification formelle est de s'assurer qu'un programme va bien fonctionner comme il le devrait, sans commettre d'erreur, se bloquer, ou se terminer anormalement. Cela est d'autant plus important dans le domaine du calcul parallèle, où le coût des calculs est parfois très élevé. Le modèle BSP (Bulk Synchronous Parallelism) est un modèle de parallélisme bien adapté à l'utilisation des méthodes formelles. Il garantit une forme de structure dans le programme parallèle, en l'organisant en super-étapes où chacune d'entre elle est composées d'une phase de calculs, puis d'une phase de communications entre les unités de calculs. Dans cette thèse, nous avons choisi d'étendre un outil actuel pour l'adapter à la preuve de programmes BSP. Nous nous sommes basés sur Why, un VCG (générateur de condition de vérification) qui a l'avantage de pouvoir s'interfacer avec plusieurs prouveurs automatiques et assistants de preuve pour décharger les obligations de preuves. Les contributions de cette thèse sont multiples. Dans un premier temps, nous présentons une comparaison des différentes librairies BSP disponibles, afin de mettre en évidence les primitives de programmation BSP les plus utilisées, donc les plus intéressantes à formaliser. Nous présentons ensuite BSP-Why, notre outil de preuve des programmes BSP. Cet outil se repose sur une génération d'un programme séquentiel qui simule le programme parallèle entré permettant ainsi d'utiliser Why et les nombreux prouveurs automatiques associés pour prouver les obligations de preuves. Nous montrons ensuite comment BSP-Why peut-être utilisé pour prouver la correction de quelques algorithmes BSP simples, mais aussi pour un exemple plus complexe qu'est la construction distribuée de l'espace d'états (model-checking) de systèmes et plus particulièrement dans les protocoles de sécurité. Enfin, afin de garantir la plus grande confiance dans l'outil BSP-Why, nous formalisons les sémantiques du langage, dans l'assistant de preuve Coq. Nous démontrons également la correction de la transformation utilisée pour passer d'un programme parallèle à un programme séquentiel / This thesis takes part in the formal verification of parallel programs. The aim of formal verification is to ensure that a program will run as it should, without making mistakes, blocking, or terminating abnormally. This is even more important in the parallel computation field, where the cost of calculations can be very high. The BSP model (Bulk Synchronous Parallelism) is a model of parallelism well suited for the use of formal methods. It guarantees a structure in the parallel program, by organising it into super-steps, each of them consisting of a phase of computations, then communications between the processes. In this thesis, we chose to extend an existing tool to adapt it for the proof of BSP programs. We based ourselves on Why, a VCG (verification condition generator) that has the advantage of being able to interface with several automatic provers and proof assistants to discharge the proof obligations. There are multiple contributions in this thesis. In a first part, we present a comparison of the existing BSP libraries, in order to show the most used BSP primitives, which are the most interesting to formalise. We then present BSP-Why, our tool for the proof of BSP programs. This tools uses a generation of a sequential program to simulate the parallel program in input, thus allowing the use of Why and the numerous associated provers to prove the proof obligations. We then show how BSP-Why can be used to prove the correctness of some basic BSP algorithms, and also on a more complex example, the generation of the state-space (model-checking) of systems, especially for security protocols. Finally, in order to ensure the greatest confidence in the BSP-Why tool, we give a formalisation of the language semantics, in the Coq proof assistant. We also prove the correctness of the transformation used to go from a parallel program to a sequential program

Background: First responders (firefighters, paramedics, and police officers) are often exposed to potentially psychologically traumatic events. When combined with insufficient social support and reduced help-seeking behaviours, such exposures may increase the risk of mental health challenges, particularly among paramedics who report the highest rates of mental disorders. Objective: The current study used the Theoretical Domains Framework (TDF) and the Consolidated Framework for Implementation Research (CFIR) to identify critical barriers and facilitators to help-seeking and accessing mental health care, and the feasibility and sustainability of a first responder clinic. Methods: Semi-structured qualitative interviews included 11 paramedics (frontline, mid-and-senior management, and union), recruited using purposive and snowball sampling. Interviews were analyzed using content and thematic analyses. The TDF and CFIR guided study design, interview content, data collection, and analysis. Results: Barriers included the complexities of stigma, confidentiality, cultural competency, and trust. Conclusions: The findings will be instrumental in developing evidence-based approaches to mental health care for paramedics.