|
|
|
The seminars will be held in room 3258 in the AV Williams
building at 11:30AM on Mondays, unless specified otherwise. To subscribe to an email
notification service that notifies you of future LAISEM seminars, register at the following url: http://www.cs.umd.edu/mailman/listinfo/laisemlist .
|
Fall 04 Seminars:
Monday, November 15, 2004 - AVW 3258 |
Title:
Moving towards collaboration: Using computational cognitive models to
enable better human-robot interaction
|
Alan C. Schultz
Head, Intelligent Systems Section
Naval Research Laboratory,
Washington DC
|
Abstract:
As we move along the scale from teleoperation towards collaboration,
human-robot interactions become more complex and require that the human
and the robot share more common knowledge about the world and how
things within the environment are related.
At the collaborative level of interaction, the robot and human must
exercise mixed initiative in solving a problem, each taking advantage
of their unique skills, location, and perspective of the current
situation. We believe that at this level and beyond, the robot will
need representations and procedures that are similar to those used by
humans, in order to collaborate successfully.
Our working hypothesis is that a system that uses representations and
processes similar to a person's will be able to collaborate with a
person better than a computational system that does not. I suggest
three reasons for the representational hypothesis and then describe
empirical and computational evidence in several domains.
Biographical Sketch:
Alan C. Schultz is the Head of the Intelligent Systems Section, Navy
Center for Applied Research in Artificial Intelligence at the Naval
Research Laboratory in Washington, DC. His research is in the area of
evolutionary computation, evolutionary robotics, learning in robotic
systems, robot/human interfaces, and adaptive systems. He is the
recipient of an Alan Berman Research Publication Award, and has
published over 40 articles on machine learning and robotics. Alan is
currently the co-chair of the AAAI Symposium Series, and chaired the
1999 and 2000 AAAI Mobil Robot Competition and Exhibitions.
|
Monday, November 8, 2004 - CHEMISTRY 1402 |
Title:
REASONING WITH CAUSE AND EFFECT
|
Judea Pearl
Department of Computer Science
University of California at Los Angeles
|
Abstract:
The talk will review concepts, principles, and mathematical tools
that were found useful in applications involving causal reasoning.
The principles are based on structural-model semantics, in which
functional (or counterfactual) relationships, representing autonomous
physical processes are the fundamental building blocks. This
semantical framework, enriched with a few ideas from logic and graph
theory, enables one to interpret and assess a wide variety of causal
and counterfactual relationships from various combinations of data
and theoretical modeling assumptions. These include:
(1) Predicting the effects of actions and policies
(2) Identifying causes of observed events
(3) Assessing direct and indirect effects,
(4) Assesseing the extent to which causal statements
are corroborated by data
(5) Assessing explanations of events in a specific scenario.
For background information, see Causality (Cambridge University
Press, 2000), or www.cs.ucla.edu/~judea/, or the following
papers:
gentle-introduction
paper1
paper2
paper3
Biographical Sketch:
Judea Pearl is a professor of computer science and statistics at the
University of California, Los Angeles. He joined the faculty of UCLA
in 1970, where he currently directs the Cognitive Systems Laboratory
and conducts research in automated reasoning, decision under uncertainty,
causal modeling, and philosophy of science. He has authored three books,
Heuristics (1984), Probabilistic Reasoning (1988), and Causality (2000).
A member of the National Academy of Engineering and a Fellow of the IEEE
and AAAI, Judea Pearl is the recipient of the IJCAI Research Excellence
Award for 1999, the AAAI Classic Paper Award for 2000, the Lakatos Award
for 2001, and the ACM Alan Newell Award for 2003.
|
Tuesday, Oct 26, 2004, 10:30 a.m. |
Title:
Transition Logic
|
Wolfgang Bibel
Professor Emeritus
Darmstadt University |
Abstract:
The talk addresses the problem of how to integrate into a classical
logical framework transitions which change the knowledge state of
an agent. The transition logic achieves this integration by defining
a deductive relationship |- (T,<=) among formulas for a partially
ordered set (T,<=) of transitions. This novel integration is closer
to human reasoning as experienced in natural language use than
previous approaches to this fundamental problem. It provides a unified
framework for practical reasoning with the potential of a full
exploitation of the maturing techniques from classical deduction and
from special applications such as planning, explanation, diagnosis,
nonmonotonic reasoning, and others.
ARTICLE
SLIDES
Biographical sketch:
Wolfgang Bibel is currently Professor emeritus for Intellectics at the
Department of Computer Science of the Darmstadt University of Technology
in Germany. He also maintains an affiliation with the University of
British Columbia in Vancouver, Canada, as an Adjunct Professor. Before
moving to Darmstadt in 1988 he was a Professor at the University of
British Columbia in Vancouver and a Fellow of the Canadian Institute for
Advanced Research. Before that he worked as a senior researcher at the
Technical University in Munich and held visiting professorships at
several universities (Rome, Duke, Karlsruhe, Saarbrücken, Wayne State,
et al).
Wolfgang Bibel received his PhD with a thesis in Mathematical Logic in
1968 and his Diploma in Mathematics in 1964 from the Ludwig-Maximilian
University in Munich. His more than 200 publications including several
books cover a variety of topics in Artificial Intelligence/Intellectics
such as automated deduction, architecture of deductive systems,
knowledge representation and inference, planning, learning, program
synthesis, aspects of applications of AI in disciplines like Psychology,
Sociology, Education, and Politics.
Professor Bibel for many years served on more than a dozen boards of
journals and book series, for instance as Section Editor of the
Artificial Intelligence Journal. In the years 1992 through 1998 he
coordinated the national program on Automated Deduction in
Germany. He was heavily involved in the foundation of Artificial
Intelligence research and organization in Germany and Europe.
Dr. Bibel is a fellow of the American Association for Artificial
Intelligence (AAAI) as well as of ECCAI, the European AI organization
which he founded, and received the Donald E. Walker Distinguished
Service Award from IJCAII, the International Joint Conferences for
Artificial Intelligence Inc., among other awards.
|
Fall 03 Seminars:
Monday, Oct 13, 2003 |
Title:
Flexible and Personalizable Mixed Initiative Dialogue Systems
|
Stephanie Seneff
Spoken Language Systems Group CSAIL, MIT |
Abstract:
The Spoken Language Systems Group in MIT's Computer Science and
Artificial Intelligence Laboratory has been developing spoken dialogue
systems for nearly 15 years. These systems typically provide access
to databases containing information of interest to a traveller, such as
flight status and schedules, traffic and weather reports, navigation
assistance, or a hotel or restaurant guide. Through experience
acquired while developing such systems, we have identified two
critical research topics that we believe, if solved, would lead to
significant breakthroughs in the future widespread adoption of such
systems. The first topic is the development of a "generic dialogue
manager," which can, ideally, be configured for a specific domain by
simply providing a semantic ontology of the domain, often inferred
from the database itself. A necessary component of success is the
ability to configure a simulation of dialogue interaction, complete
with simulated user utterances, to stress test the system prior to its
release to real users. The second topic concerns the issue of
adaptable and flexible vocabulary. This includes just-in-time
vocabulary updates of the recognizer to reflect information being
presented to the user, as well as the ability for the user to update
(personalize) the system's lexicon through spoken interaction. This
talk will give an overview of our research, followed by discussion of
where we stand now on the two research topics identified above.
Brief Biographical Sketch:
Stephanie Seneff is a Principal Research Scientist in the Spoken
Language Systems Group at the MIT Laboratory for Computer Science and
Artificial Intelligence. She received the B.S. degree in Biophysics
from MIT in 1968, the M.S. and E.E. degrees in Electrical Engineering
and Computer Science in 1980, and the PhD degree in EECS in 1985, also
from MIT. During the 1970's, she was a member of the Research Staff at
MIT Lincoln Laboratory, where her research topics included speech
recognition, speech synthesis, and voice encoding. Her doctoral
thesis concerned a model for human auditory processing of speech. She
has been conducting research at MIT for over fifteen years, during
which time she has pursued a wide range of topics related to the
development of spoken dialogue systems, including speech recognition,
subword linguistic modelling, natural language understanding and
generation, and discourse and dialogue modelling. She played a
leadership role in the development of the Galaxy architecture for
spoken dialogue systems, which is widely used in the research
community. She has published nearly a hundred papers in conference
proceedings and technical journals. She has supervised many students
pursuing MEng,, M.S., and Ph.D. degrees at MIT. She is a member of
the IEEE Society for Acoustics, Speech and Signal Processing, where
she served on the Speech Technical Committee from 1987 to 1992. She is
also a member of the Editorial Board for the Speech Communications
journal, and has served as a member of the Permanent Council for the
International Conference on Spoken Language Systems (ICSLP).
|
Monday, Sep 22, 2003 |
Title:
Distributed prediction and hierarchical knowledge
discovery by ARTMAP neural networks
|
Gail A. Carpenter
Department of Cognitive and Neural Systems, Boston University |
Abstract: Adaptive Resonance Theory (ART) neural networks model real-time
prediction, search, learning, and recognition. ART networks function
both as models of human cognitive information
processing [1,2,3] and
as neural systems for technology transfer [4]. A neural computation
central to both the scientific and the technological analyses is the
ART matching rule [5], which models the interaction between top-down
expectation and bottom-up input, thereby creating a focus of
attention which, in turn, determines the nature of coded memories.
Sites of early and ongoing transfer of ART-based technologies include
industrial venues such as the Boeing Corporation [6] and government
venues such as MIT Lincoln Laboratory [7]. A recent report on
industrial uses of neural networks [8] states: "[The] Boeing
Neural Information Retrieval System is probably still the
largest-scale manufacturing application of neural networks. It uses
[ART] to cluster binary templates of aeroplane parts in a complex
hierarchical network that covers over 100,000 items, grouped into
thousands of self-organised clusters. Claimed savings in
manufacturing costs are in millions of dollars per annum." At
Lincoln Lab, a team led by Waxman developed an image mining system
which incorporates several models of vision and recognition developed
in the Boston University Department of Cognitive and Neural Systems
(BU/CNS). Over the years a dozen CNS graduates (Aguilar, Baloch,
Baxter, Bomberger, Cunningham, Fay, Gove, Ivey, Mehanian, Ross,
Rubin, Streilein) have contributed to this effort, which is now
located at Alphatech, Inc.
Customers for BU/CNS neural network technologies have attributed
their selection of ART over alternative systems to the model's
defining design principles. In listing the advantages of its THOT®
technology, for example, American Heuristics Corporation (AHC) cites
several characteristic computational capabilities of this family of
neural models, including fast on-line (one-pass) learning, "vigilant"
detection of novel patterns, retention of rare patterns, improvement
with experience, "weights [which] are understandable in real world
terms," and scalability (www.heuristics.com).
Design principles derived from scientific analyses and design
constraints imposed by targeted applications have jointly guided the
development of many variants of the basic networks, including fuzzy
ARTMAP [9], ART-EMAP [10], ARTMAP-IC [11], Gaussian ARTMAP [12], and
distributed ARTMAP [3,13]. Comparative analysis of these systems has
led to the identification of a default ARTMAP network, which features
simplicity of design and robust performance in many application
domains [4,14]. Selection of one particular ARTMAP algorithm is
intended to facilitate ongoing technology transfer.
The default ARTMAP algorithm outlines a procedure for labeling an
arbitrary number of output classes in a supervised learning problem.
A critical aspect of this algorithm is the distributed nature of its
internal code representation, which produces continuous-valued test
set predictions distributed across output classes. The character of
their code representations, distributed vs. winner-take-all, is, in
fact, a primary factor differentiating various ARTMAP networks. The
original models [9,15] employ winner-take-all coding during training
and testing, as do many subsequent variations and the majority of ART
systems that have been transferred to technology. ARTMAP variants
with winner-take-all (WTA) coding and discrete target class
predictions have, however, shown consistent deficits in labeling
accuracy and post-processing adjustment capabilities. The talk will
describe a recent application that relies on distributed code
representations to exploit the ARTMAP capacity for one-to-many
learning, which has enabled the development of self-organizing expert
systems for multi-level object grouping, information fusion, and
discovery of hierarchical knowledge structures. A pilot study has
demonstrated the network's ability to infer multi-level fused
relationships among groups of objects in an image, without any
supervised labeling of these relationships, thereby pointing to new
methodologies for self-organizing knowledge discovery.
|
Spring 03 Seminars:
Wednesday, May 14 , 2003 --- 1:00 pm |
Title: Emergent Reasoning
from Real-Time Experience
|
Ken Hennacy
UMCP |
Abstract: Research has been underway to examine the
benefits of hybrid systems for emergent reasoning in real-time.
Within this hybrid approach, there is a utilization of two
types of behavioral models: explicit and intrinsic. Explicit
models are identified by those actions of a robot that are
predetermined by the programming and analysis that is associated
with its construction. Therefore, explicit models are not
learned and are used in our approach to represent responses
to hard constraints (such as hitting an obstacle). Intrinsic
models, on the other hand, are based upon a set of rules for
activities that are highly adaptable. Such models give a robot
the ability to learn how to interact with the outside world
without any outside environmental sense initially built into
it at all.
In one case study we performed on collision avoidance, a
robot utilizes a neural network to control the direction of
its motion in response to infrared sensor data. The robot
learns from failure, i.e. whenever the robot collides with
an obstacle, it modifies its behavior using explicit, general-purpose
models (to handle hard constraints) to attempt to avoid the
obstacle. Successes are trained into the neural network over
time. Eventually, a coarse-grained representation of the robot's
experiences emerges (in the form of k-means clusters), and
these representations are paired to developing neural network
strategies.
|
Thursday, Jan 9, 2003 --- 1:30 pm |
Title: FOL: Towards an architecture
for building autonomous agents from building blocks of first
order logic
|
Carolyn Talcott
SRI International |
Abstract: The FOL system was designed to test some
ideas about how to build thinking individuals by mechanizing
the activity of reasoning and providing data structures powerful
enough to represent both general information and information
about reasoning itself. In this talk we will spell out the
challenges implicit in the goal of FOL in some detail. Then
we will describe and illustrate the basic FOL concepts: contexts,
partiality, restartable computations, systems, inference rules
as operations on contexts, and behaviors. Finally we will
discuss how these concepts have been used to address the building
of mind. (joint work with Richard Weyhrauch, IBUKI)
|
Fall 02 Seminars:
Tuesday, Dec 10, 2002 |
Title: Learning to Explore Space
|
Benjamin Kuipers
University of Texas |
Abstract: How do we (humans or robots) learn about
space? The Spatial Semantic Hierarchy [Kuipers, 2000] is a
model of knowledge of large-scale space consisting of representations
at four levels, each with its own ontology: control, causal,
topological, and metrical. The SSH explains how the cognitive
map can be learned from experience guided by low-level reactive
control laws. How do we learn the control laws and the perceptual
features they depend on? Pierce & Kuipers [1997] demonstrate
an answer in terms of a radical thought-experiment. A robot
with completely uninterpreted sensors and effectors moves
randomly in its environment, allowing the robot to learn the
structure of its sensors, generate candidate higher-level
features, and identify a set of useful relationships between
sensory features and motor actions. From these, homing and
path-following control laws can be built: enough to support
the control level of the SSH. How do we learn to recognize
where we are, from the current sensory image? Sensors suffer
from both perceptual aliasing (different places look the same)
and image variability (the same place looks different). Kuipers
& Beeson [2002] demonstrate a hybrid approach called bootstrap
learning that combines unsupervised learning, deductive inference
(SSH map-building), and supervised learning to reach very
high accuracy place recognition in real environments using
physical sensors, with very weak assumptions about the nature
of the sensors.
|
Monday, Oct 21, 2002 |
Title: Theory and Application
of Self-Reference: Logic and Beyond
|
Don Perlis
UMCP |
Abstract: This talk presents
a brief (and probably rather personal and one-sided) view of
self-reference as seen in logic and AI, then slides over to
natural language and philosophy, and eventually returns to AI
and theories of the conscious mind based on one kind of self-reference
(arguably the most fundamental kind). |
Spring 02 Seminars:
Tuesday, Jul 16, 2002 |
Title: Some Computational
Approaches for Situation Assessment and Impact Assessment
|
Michael Hinman
Air Force Research Laboratory |
Abstract: This presentation
will provide an overview of several research efforts in the
area of Information Fusion being conducted at the Fusion Technology
Branch, Air Force Research Laboratory. It will describe a series
of innovative approaches of traditional fusion algorithms and
heuristic reasoning techniques to improve situational assessment
and threat prediction. Approaches discussed include Bayesian
techniques, Knowledge Based approaches, Artificial Neural Systems
(Neural Networks), Fuzzy Logic, and Genetic Algorithms. |
May 21, 2002 3:00PM |
Title: Using Abstraction to Speed Up Search
|
Robert Holte
University of Alberta |
Abstract: In this talk I present an
overview of my research on methods for speeding up the process of finding
a shortest path between two nodes in a graph. Underlying these methods is
the idea of abstraction. The abstractions of interest create a new graph
by mapping many nodes of the given graph to a single node in the new graph.
An abstraction can provide two types of information -- solution skeletons,
and heuristic distance estimates -- both of which can very substantially speed
up search in the original graph. For this approach to be fully automatic it is
necessary to develop (1) automatic methods for creating abstractions, and
(2) automatic methods for using a given abstraction effectively. I have investigated
such methods for graphs represented explicitly (e.g. by an adjacency list) as well
as for graphs that are represented implicitly (the manner in which graphs are
usually represented in Artificial Intelligence). |
May 20, 2002 |
Title: Communicating with
AutoTutor: Interdisciplinary research in mixed
initiative dialog
|
Max Louwerse
University of Memphis |
Abstract:
Intelligent Tutoring Systems have become more common in education
nowadays. Developing those systems is a challenge for many research
areas like linguistics, psychology, computer science and education. This
is particularly true when the aim is to develop conversational systems.
AutoTutor is one such system. It uses a world knowledge representation,
natural language processing, production scripts and a conversational
interface. By assisting students in actively constructing knowledge,
AutoTutor shows close to natural didactic and conversational skills. Not
only is the system beneficial for pedagogical purposes, it also helps to
test hypotheses in various interdisciplinary fields and generates
various new research questions. An overview of the system and some of
the research questions as well as their answers will be addressed. |
April 29, 2002 11:00 AM |
Title: Tagged Behavior-Based
Systems: Integrating Cognition with Embodied Activity
|
Iam Horswill
Northwestern University |
Abstract: Classical artificial
intelligence systems presuppose that all knowledge is stored
in a central database of logical assertions or other symbolic
representations and that reasoning consists largely of searching
and sequentially updating that database. While this model has
been very successful for disembodied reasoning systems, it is
problematic for robots. I will discuss an alternative class
of architectures - tagged behavior-based systems - that support
a large subset of the capabilities of classical AI architectures,
including limited quantified inference, forward- and backward-chaining,
simple natural language question answering and command following,
reification, and computational reflection, while allowing object
representations to remain distributed across multiple sensory
and representational modalities. Although limited, they also
support extremely fast, parallel inference. |
February 25, 2002 |
Title: Embodied Cognition:
Threads and Overview |
Mike O'Donovan-Anderson
UMCP |
Abstract: This talk surveys
some central themes and insights from the large and diverse
research area known as embodied, or situated cognition. Included
will be discussions of behavior-based robotics, conceptual blending,
phenomenologically inspired approaches to AI, the nature of
representation, etc. |
Fall 01 Seminars:
November 27, 2001 |
Title: Multi-Entity Bayesian
Networks: A Representation for Probabilistic Domain Knowledge
|
Kathryn Blackmond Laskey
George Mason University |
Abstract: Bayesian networks
have become a common structure for representing probabilistic
models in statistics and artificial intelligence. A Bayesian
network uses a directed graph to represent the dependence structure
among a set of uncertain hypotheses. Nodes in the graph represent
hypotheses and arcs represent conditional dependencies among
the hypotheses. [ more ] |
November 15, 2001 10:00AM |
Title: Logic and Databases:
a 25 Year Retrospective |
Jack Minker
UMCP |
Abstract: The field of deductive
databases is considered to have started at a workshop in Toulouse,
France. At that workshop, Gallaire, Minker and Nicolas stated
that logic and databases was a field in its own right. This
was the first time that this designation was made. The impetus
for this started approximately twenty five years ago in 1976
when I visited Gallaire and Nicolas in Toulouse, France, which
culminated in the Toulouse workshop in 1977. In this talk I
provide an assessment as to what has been achieved since the
field started as a distinct discipline. I review developments
in the field, assess contributions, consider the status of implementations
of deductive databases and discuss future work needed in deductive
databases. |
September 25, 2001 |
Title: Grounding Knowledge
in Sensors: Unsupervised Learning for Language and Planning |
Tim Oates
UMBC |
Abstract: The physical world
and the language that we use to describe it are full of structure.
Very young children discover this structure with apparent ease.
They somehow transform sensory information gathered while exploring
their environment into knowledge that enables both successful
planning and natural language ommunication, two of the defining
characteristics of human intelligence.
[ more ] |
|
Spring 01 Seminars: (see previous
semesters here)
May 7, 2001 |
Title: How to Open Two Envelopes |
Paul Syverson
U.S.
Naval Research Laboratory |
Abstract: You are presented
with two envelopes. One contains twice as much money as the
other. You open one, and it contains, e.g., one hundred dollars.
You are offered the opportunity to keep the amount you see or
to exchange it for the contents of the other envelope. Should
you switch?
[
more ] |
April 16, 2001 |
Title: "Noun Phrase Coreference
for Information Extraction" |
Claire
Cardie
Cornell
University |
Abstract: This talk will first
briefly describe information extraction systems --- natural
language understanding systems that take as input a collection
of unrestricted texts. [
more ] |
March 28, 2001 |
Title: "Cognition, Creativity,
and Reason" |
Mark
Turner
University
of Maryland |
Abstract: Chimeras and angels
seem to belong to an exotic realm of the imagination, the creative
realm, in which things that should be kept apart are blended
together for amusement or fantasy. [
more ] |
March 12, 2001 |
Title: "A Search Engine based
on Model Checking First Order Formulas" |
Fahiem
Bacchus
University
of Toronto |
Abstract: In this talk I will
show how a general purpose search engine can be constructed
from the simple idea of evaluating logical formulas against
finite, or more generally, recursively enumerable models.
[ more ] |
February 26, 2001 |
Title: "Circularity, Non-wellfounded
Sets, and Coalgebra" |
Lawrence
S Moss
Indiana
University
visiting UMIACS and JHU Cog. Sci. |
Abstract: The goal of this
talk is to survey an approach to many circular phenomena that
began with the development of non-wellfounded sets and continues
in a more vigorous way with the related mathematical field of
coalgebra [
more ] |
February 12, 2001 |
Title: "Cyclic time intervals" |
Patrick
J Hayes
University
of West Florida |
Abstract: Interval relations
on a line form a familiar algebraic structure with 13 elements.
For many purposes, however, it is convenient to think of time
as a circle. [
more ] |
|
(see more past seminars here)
|
The
University of Maryland Institute for Advanced Computer
Studies (UMIACS) has been sponsoring a weekly seminar
series on Logic and Artificial Intelligence since 1993.
Questions: Please address questions concerning the seminars
to
Don Perlis
perlis@cs.umd.edu .
Mailing list: If you wish to be included in (or removed from)
the mailing list for this seminar, please register
here.
Related seminar: A related seminar series that may be of interest
is the
Computational Linguistics Colloquium Series.
|