Defeasible Logic Programming (DELP) is a formalism that extends declarative programming to capture defeasible reasoning. Its inference mechanism, upon a query on a literal in a program, answers by indicating whether or not it is warranted in an argumentation process. While the properties of DELP are well known, some of its basic elements can be redefined in order to shed light on some of the subtleties of the warrant process. We will discuss these alternative definitions and the cases in which they provide a better performance.

Formal and computational models of argument are ideally suited for education in ill-defined domains such as law, public policy, and science.  Open-ended arguments play a central role in these areas but students of the domains may not have been taught an explicit model of argument.  Computational models of argument may be ideally suited to act as argument tutors guiding students in the formation of arguments and argument analysis according to an explicit model.  In order to achieve this it is important to establish that the models can be understood and evaluated reliably, an empirical question.  In this paper we report ongoing work on the diagnostic utility of argument diagrams produced in the LARGO tutoring system.

In the The use of argumentation for decision support is not new, remainder of the paper, we motivate our approach by using a with a long history of studies such as (Amgoud and Prade group decision making setting in clinical oncology, present a 2009; Amgoud and Vesic 2009; Amgoud, Dimopoulos, and formal framework, and procedural basis for mixed initiative Moraitis 2008; Fox et al. 2007; Amgoud and Prade 2006; argumentation and finally describe a clinical group decision Atkinson, Bench-Capon, and Modgil 2006; Rehg, McBurney, support system that implements this framework.

This paper describes a preliminary proposal of an argumentation-based approach to modeling articulated decision support contexts. The proposed approach encompasses a variety of argument and attack schemes aimed at representing basic knowledge and reasoning patterns for decision support. Some of the defined attack schemes involve attacks directed towards other attacks, which are not allowed in traditional argumentation frameworks but turn out to be useful as a knowledge and reasoning modeling tool: in particular, we demonstrate their use to support what-if reasoning capabilities, which are of primary importance in decision support. Formal backing to this approach is provided by the AFRA formalism, a recently proposed extension of Dung’s argumentation framework. A literature example concerning a decision problem about medical treatments is adopted to illustrate the approach.

The Raven's Progressive Matrices (RPM) test is a commonly used test of general human intelligence. The RPM is somewhat unique as a general intelligence test in that it focuses on visual problem solving, and in particular, on visual similarity and analogy. We are developing a small set of methods for problem solving in the RPM which use propositional, imagistic, and multimodal representations, respectively, to investigate how different representations can contribute to visual problem solving and how the effects of their use might emerge in behavior.

A sizable fraction of current research into human visuo-spatial knowledge processing explicitly or implicitly suggests a spatial processing of certain knowledge types and a visual processing of others. Similarly, many formal and technical approaches for representing and processing visuo-spatial information in artificial intelligence, in computational cognitive modeling, or in knowledge representation and reasoning explicitly or implicitly treat visual and spatial information as belonging to separate types. While there exists good evidence for some differences in mental processing of different visuo-spatial knowledge types, there is much less reason to maintain the currently ascribed separation between the visual and the spatial. We provide arguments on why strict dichotomies seem unwarranted with regard to descriptions of human mental spatial reasoning and disadvantageous for the formal and technical approaches. We build upon a synopsis of psychological evidence for the existence of multiple knowledge type specific representations in human visuo-spatial reasoning and discuss the notion of scalable representation structures. In absence of proof to the contrary, it seems better practice to assume that (a) many of the type differences attributed to visuo-spatial knowledge processing are gradual rather than qualitative in nature, and that (b) tasks involving visuo-spatial knowledge of several types are often mentally processed through dynamic associations of structures for processing basal knowledge types. The paper calls for more investigations of human reasoning in visuo-spatial tasks in which knowledge types dynamically change during reasoning. It outlines a research framework for systematically investigating different basal visuo-spatial knowledge types and their combinations with regard to cognitive and computational plausibility. Current research is related to the framework, including research on Casimir, our computational cognitive architecture for reasoning with visuo-spatial knowledge. We argue that a more systematic course of research along the lines of the proposed framework will not only lead to more appropriate descriptions of human cognition (regarding visuo-spatial knowledge processing) but may also spawn more integrated and versatile formal and technical approaches for dealing with visuo-spatial information.

Manifold alignment has been found to be useful in many fields of machine learning and data mining. In this paper we summarize our work in this area and introduce a general framework for manifold alignment. This framework generates a family of approaches to align manifolds by simultaneously matching the corresponding instances and preserving the local geometry of each given manifold. Some approaches like semi-supervised alignment and manifold projections can be obtained as special cases. Our framework can also solve multiple manifold alignment problems and be adapted to handle the situation when no correspondence information is available. The approaches are described and evaluated both theoretically and experimentally, providing results showing useful knowledge transfer from one domain to another. Novel applications of our methods including identification of topics shared by multiple document collections, and biological structure alignment are discussed in the paper.

Face recognition under variable lighting conditions is recognized as one of the most problematic are of the recognition domain by various authors. Previous work suggested that image variations caused by parameters such as illumination, can be modeled by low dimensional subspaces. In this work, we propose a new scheme for recognition under a single variation. Using a generic manifold learning technique like LPP, we are able to construct coordinate systems for the underlying subspace with the help of an optimization step. We performed experiments with face recognition under changing illumination conditions.

Modern mobile robots navigate uncertain environments using complex compositions of camera, laser, and sonar sensor data. Manual calibration of these sensors is a tedious process that involves determining sensor behavior, geometry and location through model specification and system identification. Instead, we seek to automate the construction of sensor model geometry by mining uninterpreted sensor streams for regularities. Manifold learning methods are powerful techniques for deriving sensor structure from streams of sensor data. In recent years, the proliferation of manifold learning algorithms has led to a variety of choices for autonomously generating models of sensor geometry. We present a series of comparisons between different manifold learning methods for discovering sensor geometry for the specific case of a mobile robot with a variety of sensors. We also explore the effect of control laws and sensor boundary size on the efficacy of manifold learning approaches. We find that "motor babbling" control laws generate better geometric sensor maps than mid-line or wall following control laws and identify a novel method for distinguishing boundary sensor elements. We also present a new learning method, sensorimotor embedding, that takes advantage of the controllable nature of robots to build sensor maps.

We present an interactive learning method that enables a user to iteratively refine a regression model. The user examines the output of the model, visualized as the vertical axis of a 2D scatterplot, and provides corrections by repositioning individual data points to the correct output level. Each repositioned data point acts as a control point for altering the learned model, using the geometry underlying the data. We capture the underlying structure of the data as a manifold, on which we compute a set of basis functions as the foundation for learning. Our results show that manifold-based interactive learning achieves dramatic improvement over alternative approaches.