Conditional reasoning: A key to assessing computer-based knowledge-building communication processes

This article describes a methodological approach to conditional reasoning in online asynchronous learning environments such as Virtual-U VGroups, developed by SFU, BC, Canada, consistent with the notion of meaning implication: If part of a meaning C is embedded in B and a part of a meaning B is embedded in A, then A implies C in terms of meaning [Piaget 91]. A new transcript analysis technique was developed to assess the flows of conditional meaning implications and to identify the occurrence of hypotheses and connections among them in two human science graduate mixed-mode online courses offered in the summer/spring session of 1997 by SFU. Flows of conditional meaning implications were confronted with Virtual-U VGroups threads and results of the two courses were compared. Findings suggest that Virtual-U VGroups is a knowledge-building environment although the tree-like Virtual-U VGroups threads should be transformed into neuronal-like threads. Findings also suggest that formulating hypotheses together triggers a collaboratively problem-solving process that scaffolds knowledge-building in asynchronous learning environments: A pedagogical technique and an built-in tool for formulating hypotheses together are proposed. © Springer Pub. Co.

Abductive reasoning, information, and mechanical systems

We investigate, from a philosophical perspective, the relation between abductive reasoning and information in the context of biological systems. Emphasis is given to the organizational role played by abductive reasoning in practical activities of embodied embedded agency that involve meaningful information. From this perspective, meaningful information is provisionally characterized as a selforganizing process of pattern generation that constrains coherent action. We argue that this process can be considered as a part of evolutionarily developed learning abilities of organisms in order to help with their survival. We investigate the case of inorganic mechanical systems (like robots), which deal only with stable forms of habits, rather than with evolving learning abilities. Some difficulties are considered concerning the hypothesis that mechanical systems may operate with meaningful information, present in abductive reasoning. Finally, an example of hypotheses creation in the domain of medical sciences is presented in order to illustrate the complexity of abduction in practical reasoning concerning human activities. © 2007 Springer-Verlag Berlin Heidelberg.

Writing in the Mathematics Classroom: Does It Have an Effect on Students’ Mathematical Reasoning?

In this action research study of my classroom of 5th grade mathematics, I investigate how to improve students’ written explanations to and reasoning of math problems. For this, I look at journal writing, dialogue, and collaborative grouping and its effects on students’ conceptual understanding of the mathematics. In particular, I look at its effects on students’ written explanations to various math problems throughout the semester. Throughout the study students worked on math problems in cooperative groups and then shared their solutions with classmates. Along with this I focus on the dialogue that occurred during these interactions and whether and how it moved students to a deeper level of conceptual understanding. Students also wrote responses about their learning in a weekly math journal. The purpose of this journal is two-fold. One is to have students write out their ideas. Second, is for me to provide the students with feedback on their responses. My research reveals that the integration of collaborative grouping, journaling, and active dialogue between students and teacher helps students develop a deeper understanding of mathematics concepts as well as an increase in their confidence as problem solvers. The use of journaling, dialogue, and collaborative grouping reveals themselves as promising learning tasks that can be integrated in a mathematics curriculum that seeks to cultivate students’ thinking and reasoning.

Modelling Mathematical Reasoning in Physics Education

Many findings from research as well as reports from teachers describe students' problem solving strategies as manipulation of formulas by rote. The resulting dissatisfaction with quantitative physical textbook problems seems to influence the attitude towards the role of mathematics in physics education in general. Mathematics is often seen as a tool for calculation which hinders a conceptual understanding of physical principles. However, the role of mathematics cannot be reduced to this technical aspect. Hence, instead of putting mathematics away we delve into the nature of physical science to reveal the strong conceptual relationship between mathematics and physics. Moreover, we suggest that, for both prospective teaching and further research, a focus on deeply exploring such interdependency can significantly improve the understanding of physics. To provide a suitable basis, we develop a new model which can be used for analysing different levels of mathematical reasoning within physics. It is also a guideline for shifting the attention from technical to structural mathematical skills while teaching physics. We demonstrate its applicability for analysing physical-mathematical reasoning processes with an example.

Reasoning about shadows in a mobile robot environment

This paper describes a logic-based formalism for qualitative spatial reasoning with cast shadows (Perceptual Qualitative Relations on Shadows, or PQRS) and presents results of a mobile robot qualitative self-localisation experiment using this formalism. Shadow detection was accomplished by mapping the images from the robot’s monocular colour camera into a HSV colour space and then thresholding on the V dimension. We present results of selflocalisation using two methods for obtaining the threshold automatically: in one method the images are segmented according to their grey-scale histograms, in the other, the threshold is set according to a prediction about the robot’s location, based upon a qualitative spatial reasoning theory about shadows. This theory-driven threshold search and the qualitative self-localisation procedure are the main contributions of the present research. To the best of our knowledge this is the first work that uses qualitative spatial representations both to perform robot self-localisation and to calibrate a robot’s interpretation of its perceptual input.

Reasoning with incomplete and imprecise preferences

Preferences are present in many real life situations but it is often difficult to quantify them giving a precise value. Sometimes preference values may be missing because of privacy reasons or because they are expensive to obtain or to produce. In some other situations the user of an automated system may have a vague idea of whats he wants. In this thesis we considered the general formalism of soft constraints, where preferences play a crucial role and we extended such a framework to handle both incomplete and imprecise preferences. In particular we provided new theoretical frameworks to handle such kinds of preferences. By admitting missing or imprecise preferences, solving a soft constraint problem becomes a different task. In fact, the new goal is to find solutions which are the best ones independently of the precise value the each preference may have. With this in mind we defined two notions of optimality: the possibly optimal solutions and the necessary optimal solutions, which are optimal no matter we assign a precise value to a missing or imprecise preference. We provided several algorithms, bases on both systematic and local search approaches, to find such kind of solutions. Moreover, we also studied the impact of our techniques also in a specific class of problems (the stable marriage problems) where imprecision and incompleteness have a specific meaning and up to now have been tackled with different techniques. In the context of the classical stable marriage problem we developed a fair method to randomly generate stable marriages of a given problem instance. Furthermore, we adapted our techniques to solve stable marriage problems with ties and incomplete lists, which are known to be NP-hard, obtaining good results both in terms of size of the returned marriage and in terms of steps need to find a solution.