Unfortunately, many students stop using these beneficial learning practices as soon Presented by Stephen Grossberg, Department of Cognitive as the metatutoring ceases. Apparently, the metatutors were and Neural Systems, Center for Adaptive Systems, and Center nagging rather than convincing. This talk will present a of Excellence for Learning in Education, Science, and study of Pyrenees, a metatutor that coaches students to focus Technology, Boston University, Boston, MA 02215 on learning domain principles rather than solutions to A deep and rational understanding of the factors that influence examples. It was convincing, in that students who were effective education and learning technologies depends taught probability with Pyrenees used principle-based problem on a corresponding understanding of how the brain in health solving on post-test more so than students taught by Andes, and disease controls learned behaviors. There has been a which did not focus students on principles. Moreover, revolution in discovering new computational paradigms, organizational when all students were transferred to Andes for learning principles, mechanisms, and models of how of physics, those who were metatutored used the principlefocused learning processes enable brains to give rise to minds.

In this paper, we present a cognitive model of frequency-based decision-making applied to the task of landmine detection. The model is implemented in the ACT-R cognitive architecture and is strongly constrained by the cognitive primitives of the architecture. We then generalize the model to another task in the domain of macroeconomic decision-making using the same architecture, pursuing theoretical parsimony. We describe each model's representation requirements, assess their fits to the data, and analyze their performance scaling as a function of task and architectural parameters. Efforts to generalize the landmine detection model to macroeconomic decision making showed that reasonable fits to the macro-economic performance data could be achieved by models based either on procedural knowledge or declarative knowledge. This finding underscores the importance of distinguishing between processing strategies employed to execute tasks. Such detail appears needed to understand the neural foundations of frequency-based decision-making.

A true human-level learner should be able to deliberately construct its own knowledge, its processes of reasoning resulting in a new knowledge, its system of values and goals, and the scenario of its cognitive growth. These capabilities require a cognitive architecture of a new kind that supports metacognition, self-awareness and self-regulation. An example architecture design called Constructor is described in this work. The main distinguishing feature of this architecture is its virtually unlimited self-regulated cognitive growth ability. Other features include metacognition, self-awareness, and an intrinsic embodiment in virtual reality that is used, e.g., for active construction of cognitive and learning processes.

Creating new concepts from data is a hard problem in the development of cognitive architectures, but one that must be solved for the BICA community to declare success.  Two concept generation algorithms are presented here that are appropriate to different levels of concept abstraction: state-space partitioning with decision trees and context-based similarity.

The Institute of Education Sciences (IES) provides funding opportunities for researchers to bring their knowledge of learning, cognitive science, and technology to bear on education practice. This panel describes opportunities available through the National Center for Education Research and the National Center for Special Education Research.

Decades ago, Alan Turing proposed a test to show if a machine has intelligence, a test that has yet to be replaced by a more comprehensive theory. The same test however, says nothing about what is intelligence. This paper proposes a definition based on a system ability to deal with uncertainty, which is the main attribute of our intelligence. It introduces a new adaptive system theory and the Viable Complex System (VCS), concept that is applied to organisms, social organizations, and to the design and architecture of IT systems. All VCSs share a dual structure built on two function types: operations (i.e. resource processing) and change (adaptability). A system adapts by learning from the interactions with environment on how to improve its chances to survive. All systems sharing common operations are part of a realm. Obviously, we may have systems which could live in two realms at the same time. In conclusion, we define information as the interaction between two similar VCSs, and intelligence as a property of adaptive systems which exist in the context of two realms (i.e. humans being biological organisms and members of the society). We extend the model to quantify intelligence through the use of a new term called information density. This concept associates complexity of the logic embedded in a message, especially the one related to changes, with the system ability to process that logic in its quest to survive. The more intelligent the system, the better it is at extracting information towards higher efficiency and higher viability. We are closing the paper with the presentation of two case studies from our practice that shows how this model can be applied in the IT when designing enterprise systems.

We present a novel reasoning calculus for the description logic SHOIQ^+---a knowledge representation formalism with applications in areas such as the Semantic Web. Unnecessary nondeterminism and the construction of large models are two primary sources of inefficiency in the tableau-based reasoning calculi used in state-of-the-art reasoners. In order to reduce nondeterminism, we base our calculus on hypertableau and hyperresolution calculi, which we extend with a blocking condition to ensure termination. In order to reduce the size of the constructed models, we introduce anywhere pairwise blocking. We also present an improved nominal introduction rule that ensures termination in the presence of nominals, inverse roles, and number restrictions---a combination of DL constructs that has proven notoriously difficult to handle. Our implementation shows significant performance improvements over state-of-the-art reasoners on several well-known ontologies.

We present a novel Bayesian topic model for learning discourse-level document structure. Our model leverages insights from discourse theory to constrain latent topic assignments in a way that reflects the underlying organization of document topics. We propose a global model in which both topic selection and ordering are biased to be similar across a collection of related documents. We show that this space of orderings can be effectively represented using a distribution over permutations called the Generalized Mallows Model. We apply our method to three complementary discourse-level tasks: cross-document alignment, document segmentation, and information ordering. Our experiments show that incorporating our permutation-based model in these applications yields substantial improvements in performance over previously proposed methods.

When a high-level constraint programming (CP) language lacks a (possibly global) constraint that would allow the formulation of a particular model of a combinatorial problem, then the modeller traditionally has the choice of (1) switching to another CP language that has all the required constraints, (2) formulating a different model that does not require the lacking constraints, or (3) implementing the lacking constraint in the low-level implementation language of the chosen CP language. This paper addresses the core question of facilitating the third option, and as a side effect often makes the first two options unnecessary. The user-level extensibility of CP languages has been an important goal for over a decade. In the traditional global search approach to CP (namely heuristic-based tree search interleaved with propagation), higher-level abstractions for describing new constraints include indexicals [17]; (possibly enriched) deterministic finite automata (DFAs) via the automaton [2] and regular [11] generic constraints; and multivalued decision diagrams (MDDs) via the mdd [5] generic constraint. Usually, a generic but efficient propagation algorithm achieves a suitable level of local consistency by processing the higher-level description of the new constraint.

We consider multi-agent systems where agents' preferences are aggregated via sequential majority voting: each decision is taken by performing a sequence of pairwise comparisons where each comparison is a weighted majority vote among the agents. Incompleteness in the agents' preferences is common in many real-life settings due to privacy issues or an ongoing elicitation process. In addition, there may be uncertainty about how the preferences are aggregated. For example, the agenda (a tree whose leaves are labelled with the decisions being compared) may not yet be known or fixed. We therefore study how to determine collectively optimal decisions (also called winners) when preferences may be incomplete, and when the agenda may be uncertain. We show that it is computationally easy to determine if a candidate decision always wins, or may win, whatever the agenda. On the other hand, it is computationally hard to know wheth er a candidate decision wins in at least one agenda for at least one completion of the agents' preferences. These results hold even if the agenda must be balanced so that each candidate decision faces the same number of majority votes. Such results are useful for reasoning about preference elicitation. They help understand the complexity of tasks such as determining if a decision can be taken collectively, as well as knowing if the winner can be manipulated by appropriately ordering the agenda.