The relation between language and theory of mind in development and evolution

Considering the close relation between language and theory of mind in development and their tight connection in social behavior, it is no big leap to claim that the two capacities have been related in evolution as well. But what is the exact relation between them? This paper attempts to clear a path toward an answer. I consider several possible relations between the two faculties, bring conceptual arguments and empirical evidence to bear on them, and end up arguing for a version of co-evolution. To model this co-evolution, we must distinguish between different stages or levels of language and theory of mind, which fueled each other’s evolution in a protracted escalation process

A dynamic adaptive framework for improving case-based reasoning system performance

An optimal performance of a Case-Based Reasoning (CBR) system means, the CBR system must be efficient both in time and in size, and must be optimally competent. The efficiency in time is closely related to an efficient and optimal retrieval process over the Case Base of the CBR system. Efficiency in size means that the Case Library (CL) size should be minimal. Therefore, the efficiency in size is closely related to optimal case learning policies, optimal meta-case learning policies, optimal case forgetting policies, etc. On the other hand, the optimal competence of a CBR system means that the number of problems that the CBR system can satisfactorily solve must be maximum. To improve or optimize all three dimensions in a CBR system at the same time is a difficult challenge because they are interrelated, and it becomes even more difficult when the CBR system is applied to a dynamic or continuous domain (data stream). In this thesis, a Dynamic Adaptive Case Library framework (DACL) is proposed to improve the CBR system performance coping especially with reducing the retrieval time, increasing the CBR system competence, and maintaining and adapting the CL to be efficient in size, especially in continuous domains. DACL learns cases and organizes them into dynamic cluster structures. The DACL is able to adapt itself to a dynamic environment, where new clusters, meta-cases or prototype of cases, and associated indexing structures (discriminant trees, k-d trees, etc.) can be formed, updated, or even removed. DACL offers a possible solution to the management of the large amount of data generated in an unsupervised continuous domain (data stream). In addition, we propose the use of a Multiple Case Library (MCL), which is a static version of a DACL, with the same structure but being defined statically to be used in supervised domains. The thesis work proposes some techniques for improving the indexation and the retrieval task. The most important indexing method is the NIAR k-d tree algorithm, which improves the retrieval time and competence, compared against the baseline approach (a flat CL) and against the well-known techniques based on using standard k-d tree strategies. The proposed Partial Matching Exploration (PME) technique explores a hierarchical case library with a tree indexing-structure aiming at not losing the most similar cases to a query case. This technique allows not only exploring the best matching path, but also several alternative partial matching paths to be explored. The results show an improvement in competence and time of retrieving of similar cases. Through the experimentation tests done, with a set of well-known benchmark supervised databases. The dynamic building of prototypes in DACL has been tested in an unsupervised domain (environmental domain) where the air pollution is evaluated. The core task of building prototypes in a DACL is the implementation of a stochastic method for the learning of new cases and management of prototypes. Finally, the whole dynamic framework, integrating all the main proposed approaches of the research work, has been tested in simulated unsupervised domains with several well-known databases in an incremental way, as data streams are processed in real life. The conclusions outlined that from the experimental results, it can be stated that the dynamic adaptive framework proposed (DACL/MCL), jointly with the contributed indexing strategies and exploration techniques, and with the proposed stochastic case learning policies, and meta-case learning policies, improves the performance of standard CBR systems both in supervised domains (MCL) and in unsupervised continuous domains (DACL).El rendimiento óptimo de un sistema de razonamiento basado en casos (CBR) significa que el sistema CBR debe ser eficiente tanto en tiempo como en tamaño, y debe ser competente de manera óptima. La eficiencia temporal está estrechamente relacionada con que el proceso de recuperación sobre la Base de Casos del sistema CBR sea eficiente y óptimo. La eficiencia en tamaño significa que el tamaño de la Base de Casos (CL) debe ser mínimo. Por lo tanto, la eficiencia en tamaño está estrechamente relacionada con las políticas óptimas de aprendizaje de casos y meta-casos, y las políticas óptimas de olvido de casos, etc. Por otro lado, la competencia óptima de un sistema CBR significa que el número de problemas que el sistema puede resolver de forma satisfactoria debe ser máximo. Mejorar u optimizar las tres dimensiones de un sistema CBR al mismo tiempo es un reto difícil, ya que están relacionadas entre sí, y se vuelve aún más difícil cuando se aplica el sistema de CBR a un dominio dinámico o continuo (flujo de datos). En esta tesis se propone el Dynamic Adaptive Case Library framework (DACL) para mejorar el rendimiento del sistema CBR especialmente con la reducción del tiempo de recuperación, aumentando la competencia del sistema CBR, manteniendo y adaptando la CL para ser eficiente en tamaño, especialmente en dominios continuos. DACL aprende casos y los organiza en estructuras dinámicas de clusters. DACL es capaz de adaptarse a entornos dinámicos, donde los nuevos clusters, meta-casos o prototipos de los casos, y las estructuras asociadas de indexación (árboles discriminantes, árboles k-d, etc.) se pueden formar, actualizarse, o incluso ser eliminados. DACL ofrece una posible solución para la gestión de la gran cantidad de datos generados en un dominio continuo no supervisado (flujo de datos). Además, se propone el uso de la Multiple Case Library (MCL), que es una versión estática de una DACL, con la misma estructura pero siendo definida estáticamente para ser utilizada en dominios supervisados. El trabajo de tesis propone algunas técnicas para mejorar los procesos de indexación y de recuperación. El método de indexación más importante es el algoritmo NIAR k-d tree, que mejora el tiempo de recuperación y la competencia, comparado con una CL plana y con las técnicas basadas en el uso de estrategias de árboles k-d estándar. Partial Matching Exploration (PME) technique, la técnica propuesta, explora una base de casos jerárquica con una indexación de estructura de árbol con el objetivo de no perder los casos más similares a un caso de consulta. Esta técnica no sólo permite explorar el mejor camino coincidente, sino también varios caminos parciales alternativos coincidentes. Los resultados, a través de la experimentación realizada con bases de datos supervisadas conocidas, muestran una mejora de la competencia y del tiempo de recuperación de casos similares. Además la construcción dinámica de prototipos en DACL ha sido probada en un dominio no supervisado (dominio ambiental), donde se evalúa la contaminación del aire. La tarea central de la construcción de prototipos en DACL es la implementación de un método estocástico para el aprendizaje de nuevos casos y la gestión de prototipos. Por último, todo el sistema, integrando todos los métodos propuestos en este trabajo de investigación, se ha evaluado en dominios no supervisados simulados con varias bases de datos de una manera gradual, como se procesan los flujos de datos en la vida real. Las conclusiones, a partir de los resultados experimentales, muestran que el sistema de adaptación dinámica propuesto (DACL / MCL), junto con las estrategias de indexación y de exploración, y con las políticas de aprendizaje de casos estocásticos y de meta-casos propuestas, mejora el rendimiento de los sistemas estándar de CBR tanto en dominios supervisados (MCL) como en dominios continuos no supervisados (DACL).Postprint (published version

Algorithmic iteration for computational intelligence

Machine awareness is a disputed research topic, in some circles considered a crucial step in realising Artificial General Intelligence. Understanding what that is, under which conditions such feature could arise and how it can be controlled is still a matter of speculation. A more concrete object of theoretical analysis is algorithmic iteration for computational intelligence, intended as the theoretical and practical ability of algorithms to design other algorithms for actions aimed at solving well-specified tasks. We know this ability is already shown by current AIs, and understanding its limits is an essential step in qualifying claims about machine awareness and Super-AI. We propose a formal translation of algorithmic iteration in a fragment of modal logic, formulate principles of transparency and faithfulness across human and machine intelligence, and consider the relevance to theoretical research on (Super)-AI as well as the practical import of our results

Logical models for bounded reasoners

This dissertation aims at the logical modelling of aspects of human reasoning, informed by facts on the bounds of human cognition. We break down this challenge into three parts. In Part I, we discuss the place of logical systems for knowledge and belief in the Rationality Debate and we argue for systems that formalize an alternative picture of rationality -- one wherein empirical facts have a key role (Chapter 2). In Part II, we design logical models that encode explicitly the deductive reasoning of a single bounded agent and the variety of processes underlying it. This is achieved through the introduction of a dynamic, resource-sensitive, impossible-worlds semantics (Chapter 3). We then show that this type of semantics can be combined with plausibility models (Chapter 4) and that it can be instrumental in modelling the logical aspects of System 1 (“fast”) and System 2 (“slow”) cognitive processes (Chapter 5). In Part III, we move from single- to multi-agent frameworks. This unfolds in three directions: (a) the formation of beliefs about others (e.g. due to observation, memory, and communication), (b) the manipulation of beliefs (e.g. via acts of reasoning about oneself and others), and (c) the effect of the above on group reasoning. These questions are addressed, respectively, in Chapters 6, 7, and 8. We finally discuss directions for future work and we reflect on the contribution of the thesis as a whole (Chapter 9)

Metamodel for personalized adaptation of pedagogical strategies using metacognition in Intelligent Tutoring Systems

The modeling process of metacognitive functions in Intelligent Tutoring Systems (ITS) is a difficult and time-consuming task. In particular when the integration of several metacognitive components, such as self-regulation and metamemory is needed. Metacognition has been used in Artificial Intelligence (AI) to improve the performance of complex systems such as ITS. However the design ITS with metacognitive capabilities is a complex task due to the number and complexity of processes involved. The modeling process of ITS is in itself a difficult task and often requires experienced designers and programmers, even when using authoring tools. In particular the design of the pedagogical strategies for an ITS is complex and requires the interaction of a number of variables that define it as a dynamic process. This doctoral thesis presents a metamodel for the personalized adaptation of pedagogical strategies integrating metamemory and self-regulation in ITS. The metamodel called MPPSM (Metamodel of Personalized adaptation of Pedagogical Strategies using Metacognition in intelligent tutoring systems) was synthetized from the analysis of 40 metacognitive models and 45 ITS models that exist in the literature. MPPSMhas a conceptual architecture with four levels of modeling according to the standard Meta- Object Facility (MOF) of Model-Driven Architecture (MDA) methodology. MPPSM enables designers to have modeling tools in early stage of software development process to produce more robust ITS that are able to self-regulate their own reasoning and learning processes. In this sense, a concrete syntax composed of a graphic notation called M++ was defined in order to make the MPPSM metamodel more usable. M++ is a Domain-Specific Visual Language (DSVL) for modeling metacognition in ITS. M++ has approximately 20 tools for modeling metacognitive systems with introspective monitoring and meta-level control. MPPSM allows the generation of metacognitive models using M++ in a visual editor named MetaThink. In MPPSM-based models metacognitive components required for monitoring and executive control of the reasoning processes take place in each module of an ITS can be specified. MPPSM-based models represent the cycle of reasoning of an ITS about: (i) failures generated in its own reasoning tasks (e.g. self-regulation); and (ii) anomalies in events that occur in its Long-Term Memory (LTM) (e.g. metamemory). A prototype of ITS called FUNPRO was developed for the validation of the performance of metacognitive mechanism of MPPSM in the process of the personalization of pedagogical strategies regarding to the preferences and profiles of real students. FUNPRO uses self-regulation to monitor and control the processes of reasoning at object-level and metamemory for the adaptation to changes in the constraints of information retrieval tasks from LTM. The major contributions of this work are: (i) the MOF-based metamodel for the personalization of pedagogical strategies using computational metacognition in ITS; (ii) the M++ DSVL for modeling metacognition in ITS; and (iii) the ITS prototype called FUNPRO (FUNdamentos de PROgramación) that aims to provide personalized instruction in the subject of Introduction to Programming. The results given in the experimental tests demonstrate: (i) metacognitive models generated are consistent with the MPPSM metamodel; (ii) positive perceptions of users with respect to the proposed DSVL and it provide preliminary information concerning the quality of the concrete syntax of M++; (iii) in FUNPRO, multi-level pedagogical model enhanced with metacognition allows the dynamic adaptation of the pedagogical strategy according to the profile of each student.Doctorad