<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Rapid Argumentation Capture from Analysis Reports: The Case Study of Aum Shinrikyo</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Mihai Boicu, Gheorghe Tecuci, Dorin Marcu Learning Agents Center, Volgenau School of Engineering, George Mason University</institution>
          ,
          <addr-line>Fairfax, VA 22030</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>- The availability of subject matter experts has always been a challenge for the development of knowledge-based cognitive assistants incorporating their expertise. This paper presents an approach to rapidly develop cognitive assistants for evidence-based reasoning by capturing and operationalizing the expertise that was already documented in analysis reports. It illustrates the approach with the development of a cognitive assistant for assessing whether a terrorist organization is pursuing weapons of mass destruction, based on a report on the strategies followed by Aum Shinrikyo to develop and use biological and chemical weapons.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>INTRODUCTION</p>
      <p>We research advanced knowledge engineering methods for
rapid development of agents that incorporate the knowledge of
human experts to assist their users in complex problem solving
and to teach students. The development of such systems by
knowledge engineers and subject matter experts is very
complex due to the difficulty of capturing and representing
experts’ problem solving knowledge.</p>
      <p>
        Our approach to this challenge was to develop multistrategy
learning methods enabling a subject matter expert who is not a
knowledge engineer to train a learning agent through problem
solving examples and explanations, in a way that is similar to
how the expert would train a student. This has led to the
development of a new type of tool for agent development
which we have called learning agent shell [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The learning
agent shell is a refinement of the concept of expert system shell
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. As an expert system shell, the learning agent shell includes
a general inference engine for a knowledge base to be
developed by capturing knowledge from a subject matter
expert. The inference engine of the learning agent shell,
however, is based on a general divide-and-conquer approach to
problem solving, called problem reduction and solution
synthesis, which is very natural for a non-technical subject
matter expert, facilitates agent teaching and learning, and is
computationally efficient. Moreover, in order to facilitate
knowledge reuse, the knowledge base of the learning agent
shell is structured into an ontology of concepts and a set of
problem solving rules expressed with these concepts. The
ontology is the more general part of the knowledge base and is
usually relevant to many applications in the same domain, such
as military or medicine. Indeed, many military applications will
require reasoning with concepts such as military unit or
military equipment. Thus, when developing a knowledge-based
agent for a new military application, one may expect to be able
to reuse a significant part of the ontology of a previously
developed agent. The reasoning rules, however, are much more
application-specific, such as the rules for critiquing a course of
action with respect to the principles of war versus the rules for
determining the strategic center of gravity of a force. Therefore
the rules are reused to a much lesser extent. To facilitate their
acquisition, the learning agent shell includes a multistrategy
learning engine, enabling the learning of the rules directly from
the subject matter expert, as mentioned above.
      </p>
      <p>
        We have developed increasingly more capable and easier to
use learning agent shells and we have applied them to build
knowledge-based agents for various applications, including
military engineering planning, course of action critiquing, and
center of gravity determination [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        Investigating the development of cognitive assistants for
intelligence analysis, such as Disciple LTA [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and TIACRITIS
[5], has led us to the development of a new type of agent
development tool, called learning agent shell for
evidencebased reasoning [6]. This new tool extends a learning agent
shell with generic modules for representation, search, and
reasoning with evidence. It also includes a hierarchy of
knowledge bases, the top of which is a domain-independent
knowledge base for evidence-based reasoning containing an
ontology of evidence and general rules, such as the rules for
assessing the believability of different items of evidence [7].
This knowledge base is very significant because it is applicable
to evidence-based reasoning tasks across various domains, such
as intelligence analysis, law, forensics, medicine, physics,
history, and others. An example of a learning agent shell for
evidence-based reasoning is Disciple-EBR [6].
      </p>
      <p>The development of a knowledge-based agent for an
evidence-based reasoning task, such as intelligence analysis, is
simplified because the shell already has general knowledge for
evidence-based reasoning. Thus one only needs to develop the
domain-specific part of the knowledge base. However, we still
face the difficult problem of having access to subject matter
experts who can dedicate their time to teach the agent. This
paper presents a solution to this problem. It happens that there
are many reports written by subject matter experts which
already contain significant problem solving expertise. Thus,
rather than eliciting the expertise directly from these experts, a
junior professional may capture it from their reports.</p>
      <p>We will illustrate this approach by considering a recent
report from the Center for a New American Security, “Aum
Shinrikyo: Insights Into How Terrorists Develop Biological
and Chemical Weapons” [8]. This report provides a
comprehensive analysis of this terrorist group, its
radicalization, and the strategies followed in the development
and use of biological and chemical weapons. As stated by its
authors: “… this is the most accessible and informative
opportunity to study terrorist efforts to develop biological and
chemical weapons” [8, p.33]. “This detailed case study of Aum
Shinrikyo (Aum) suggests several lessons for understanding
attempts by other terrorist groups to acquire chemical or
biological weapons” [8, p.4]. “Our aim is to have this study
enrich policymakers’ and intelligence agencies’ understanding
when they assess the risks that terrorists may develop and use
weapons of mass destruction” [8, p.6].</p>
      <p>Indeed, this report presents in detail two examples of how a
terrorist group has pursued weapons of mass destruction, one
where it was successful (sarin-based chemical weapons), and
one where it was not successful (B-anthracis-based biological
weapons). We will show how we can use these examples to
train Disciple-EBR, evolving it into a cognitive assistant that
will help intelligence analysts in assessing whether other
terrorist groups may be pursuing weapons of mass destruction.
Notice that this process operationalizes the knowledge from the
report to facilitate its application in new situations.</p>
      <p>We first present a brief summary of the Aum report. Then
we explain the process of evidence-based hypothesis analysis
using problem reduction and solution synthesis. Finally we
present the actual development of the cognitive assistant.</p>
      <p>II.</p>
      <p>AUM SHINRIKYO: INSIGHTS INTO HOW TERRORISTS
DEVELOP BIOLOGICAL AND CHEMICAL WEAPONS [8]
The first section of the report describes the creation of the
Aum cult by Chizuo Matsumoto in 1984 as a yoga school.
Soon after that Aum started to develop a religious doctrine and
to create monastic communities. From the beginning the cult
was apocalyptic, believing in an imminent catastrophe that can
be prevented only by positive spiritual action. In 1988, the cult
started to apply physical force and punishments toward its
members to purify the body, and started to commit illegalities.</p>
      <p>The second section of the report analyzes the biological
weapons program. The cult first tried to obtain botulinum
toxin, but it failed to obtain a deadly strain. However, the cult
released the toxin in 20 to 40 attacks in which, luckily, nobody
died. Possible causes of the failure were identified as
ineffective initial strain of C. botulinum, unsuitable culture
conditions, unsterile conditions, wrong post-fermentation
recovery, and improper storage conditions. Similarly, the
anthrax program and its failure are analyzed.</p>
      <p>The third section of the report analyzes the chemical
weapons program. While other chemical agents were tested
during the program, the main part of the program was based on
sarin. Although the program had some problems with mass
production, it was generally successful, and produced large
quantities of sarin at various levels of purity. Aum performed
several attacks with sarin, including: (1) an ineffective attack
on a competing religious leader in 1993; (2) an attack, in June
1994, with a vaporization of sarin, intended to kill several
judges – the vapors were shifted toward a neighborhood, killing
8 persons and injuring 200; (3) several attacks in the Tokyo
Subway on 20 March 1995, killing 13 and injuring thousands.</p>
      <p>The fourth section of the report summarizes the main
lessons learned: (1) chemical weapons capabilities seem more
accessible than biological capabilities for mass killing; (2)
effective dissemination is challenging; (3) recurred accidents in
the programs did not deter their pursuit; (4) during the
transition to violence some leaders joined while others were
isolated or killed; (5) law enforcement pressure was highly
disruptive even though it was not an effective deterrent; (6) the
programs and attacks were conducted by the leadership group
only, to maintain secrecy; (7) the hierarchical structure of the
cult facilitated the initiation and resourcing of the programs but
distorted their development and assessment; (8)
contemporaneous assessment of the intentions and capabilities
of a terrorist organization are difficult, uncertain and even
misleading; (9) despite many mistakes and failures, successes
were obtained as a result of the persistence in the programs.</p>
      <p>III.</p>
    </sec>
    <sec id="sec-2">
      <title>HYPOTHESIS ANALYSIS WITH DISCIPLE-EBR</title>
      <p>A class of hypothesis analysis problems is represented in
Disciple-EBR as the 7-tuple (O, P, S, Rr, Sr, I, E), as shown in
Figure 1. The ontology O is a hierarchical representation of
both general and domain-specific concepts and relationships.
The general (domain-independent) concepts are primarily those
for evidence-based reasoning, such as different types of
evidence. The two primary roles of the ontology are to support
the representation of the other knowledge elements (e.g. the
reasoning rules), and to serve as the generalization hierarchy
for learning. The hypothesis analysis problems P and the
corresponding solutions S are natural language patterns with
variables. They include first-order logic applicability
conditions that restrict the possible values of the variables.</p>
      <p>A problem reduction rule Rr expresses how and under what
conditions a generic hypothesis analysis problem Pg can be
reduced to simpler generic problems. These conditions are
represented as first-order logical expressions. Similarly, a
Rri</p>
      <p>P1</p>
      <p>S1
Question
AnswQeurestion</p>
      <p>Answer
P1 S1
1 1
…</p>
      <p>P1 S1
n n</p>
      <p>Srj
The Disciple representation of a class of
hypothesis analysis problems is a 7-tuple
(O, P, S, Rr, Sr, I, E) where:
O – ontology of domain concepts and</p>
      <p>relationships;
P – class of hypothesis analysis problems;
S – solutions of problems;
Rr – problem reduction rules that reduce
problems to sub-problems and/or
solutions;
Sr – solution synthesis rules that
synthesize the solution of a problem
from the solutions of its sub-problems.</p>
      <p>I –</p>
      <p>Instances of the concepts from O, with
properties and relationships;
E – evidence for assessing hypothesis</p>
      <p>analysis problems.
solution synthesis rule Sr expresses how and under what
conditions generic probabilistic solutions can be combined into
another probabilistic solution [9]. As mentioned, Disciple-EBR
already contains domain-independent problem reduction and
solution synthesis rules for evidence-based reasoning.</p>
      <p>Disciple-EBR employs a general divide-and-conquer
approach to solve a hypothesis analysis problem. For example,
as illustrated in the right-hand side of Figure 1, a complex
problem P1 is reduced to n simpler problems P11, … , P1n,
through the application of the reduction rule Rri. If we can then
find the solutions S11, … , S1n of these sub-problems, then these
solutions can be combined into the solution S1 of the problem
P1, through the application of the synthesis rule Srj. The
Question/Answer pairs associated with these reduction and
synthesis operations express, in natural language, the
applicability conditions of the corresponding reduction and
synthesis rules, in this particular situation. Their role will be
discussed in more detail in the next section.</p>
      <p>Specific examples of reasoning trees are shown in Figures
5, 6, and 11, which will be discussed in the next section. In
general, a top-level hypothesis analysis problem is successively
reduced (guided by questions and answers) to simpler and
simpler problems, down to the level of elementary problems
that are solved based on knowledge and evidence. Then the
obtained solutions are successively combined, from bottom-up,
to obtain the solution of the top-level problem.</p>
      <p>Figure 2 presents the reduction and synthesis operations in
more detail. To assess hypothesis H1 one asks the question Q
which happens to have two answers, A and B. For example, a
question like “Which is an indicator for H1?” may have many
answers, while other questions have only one answer. Let’s
assume that answer A leads to the reduction of H1 to the
simpler hypotheses H2 and H3, and answer B leads to the
reduction of H1 to H4 and H5. Let us further assume that we
have assessed the likeliness of each of these four
subhypotheses, as indicated at the bottom part of Figure 2. The
likeliness of H2 needs to be combined with the likeliness of H3,
to obtain a partial assessment (corresponding to the answer A)
of the likeliness of H1. One similarly obtains another partial
assessment (corresponding to the answer B) of the likeliness of
H1. Then the likeliness of H1 corresponding to the answer A
needs to be combined with the likeliness of H1 corresponding
to the answer B, to obtain the likeliness of H1 corresponding to
all the answers of question Q (e.g., corresponding to all the
indicators).</p>
      <p>We call the two bottom-level syntheses in Figure 2
reduction-level syntheses because they correspond to
reductions of H1 to simpler hypotheses. We call the top-level
synthesis problem-level synthesis because it corresponds to all
the known strategies for solving the problem.</p>
      <p>
        The likeliness may be expressed using symbolic probability
values that are similar to those used in the U.S. National
Intelligence Council’s standard estimative language: {no
possibility, a remote possibility, very unlikely, unlikely, an
even chance, likely, very likely, almost certain, certain}.
However, other symbolic probabilities may also be used, as
discussed by Kent [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] and Weiss [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. In these cases one may
use simple synthesis functions, such as, min, max, average, or
Problem-level
synthesis
      </p>
      <p>Assess H1</p>
      <p>Likeliness of H1</p>
      <p>
        Synthesis function (min, max, average)
weighted sum, as shown in Figure 2 and Figure 3 [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>As indicated above, Disciple-EBR includes general
reduction and synthesis rules for evidence-based reasoning
which allow it to automatically generate fragments of the
reduction and synthesis tree, like the one from Figure 3. In this
case the problem is to assess hypothesis H1 based on favoring
evidence. Which is a favoring item of evidence? If E1 is such an
item, then Disciple reduces the top level assessment to two
simpler assessments: “Assess the relevance of E1 to H1” and
“Assess the believability of E1”. If E2 is another relevant item of
evidence, then Disciple reduces the top level assessment to two
other simpler assessments. Obviously there may be any number
of favoring items of evidence.</p>
      <p>Now let us assume that Disciple has obtained the solutions
of the leaf problems, as shown at the bottom of Figure 3 (e.g.,
“If we assume that E1 is believable, then H1 is very likely to be true.”
“The believability of E1 is likely.”) Notice that what is really of
interest in a solution is the actual likeliness value. Therefore, an
expression like “The believability of E1 is likely” can be abstracted
to “likely.” Consequently, the reasoning tree in Figure 3 shows
only these abstracted solutions, although, internally, the
complete solution expressions are maintained.</p>
      <p>Having obtained the solutions of the leaf hypotheses in
Figure 3, Disciple automatically combines them to obtain the
likeliness of the top level hypothesis. First it assesses the</p>
      <p>Assess hypothesis H1
based on favoring evidence
almost certain</p>
      <p>max
Which is a favoring
item of evidence? E1
likely
min</p>
      <p>Which is a favoring
item of evidence? E2
almost certain
min
Assess relevance Assess believability Assess relevance Assess believability
of E1 to H1 of E1 of E2 to H1 of E2
very likely likely certain almost certain
inferential force of each item of favoring evidence (i.e., E1 and
E2) on H1 by taking the min between its relevance and its
believability, because only evidence that is both relevant and
believable will convince us that a hypothesis is true. Next
Disciple assesses the inferential force of the favoring evidence
as the max of the inferential force corresponding to individual
items of evidence because it is enough to have one relevant and
believable item of evidence to convince us that the hypothesis
H1 is true. Disciple will similarly consider disfavoring items of
evidence, and will use an on balance judgment to determine the
inferential force of all available evidence on H1.</p>
      <p>To facilitate the browsing and understanding of larger
reasoning trees, Disciple also displays them in abstracted
(simplified) form, as illustrated in the bottom right side of
Figure 5. The top-level abstract problem “start with chaos and
destruction” is the abstraction of the problem “Assess whether
Aum Shinrikyo preaches that the apocalypse will start with chaos and
destruction” from the bottom of Figure 5. The abstract
subproblem “favoring evidence” is the abstraction of “Assess
whether Aum Shinrikyo preaches that the apocalypse will start with
chaos and destruction, based on favoring evidence.” This is a
specific instance of the problem from the top of Figure 3 which
is solved as discussed above. The user assessed the relevance
and the believability of the two items of evidence EVD-013
and EVD-014, and Disciple automatically determined and
combined their inferential force on the higher-level hypotheses.</p>
      <p>IV.</p>
    </sec>
    <sec id="sec-3">
      <title>AGENT DEVELOPMENT METHODOLOGY</title>
      <p>Figure 4 presents the main stages of evolving the
DiscipleEBR agent shell into a specific cognitive assistant for
hypotheses analysis. The first stage is system specification
during which a knowledge engineer and a subject matter expert
define the types of problems to be solved by the system. Then
they rapidly develop a prototype, first by developing a model
of how to solve a problem, and then by applying the model to</p>
      <p>In the next section we will illustrate the development of a
cognitive assistant that will help assess whether a terrorist
organization is pursuing weapons of mass destruction. The
main difference from the above methodology is that we capture
the expertise not from a subject matter expert, but from the
Aum report [8].
The Aum report presents in detail two examples of how a
terrorist group has pursued weapons of mass destruction. We
will briefly illustrate the process of teaching Disciple-EBR
based on these examples, enabling it to assist other analysts in
assessing whether a terrorist group may be pursuing weapons
of mass destruction. For this, we need to frame each of these
examples as a problem solving experience imagining, for
instance, that we are attempting to solve the following
hypothesis analysis problem:</p>
      <sec id="sec-3-1">
        <title>Assess whether Aum Shinrikyo is pursuing sarin-based weapons.</title>
        <p>We express the problem in natural language and select the
phrases that may be different for other problems. The selected
phrases will appear in blue, guiding the system to learn a
general problem pattern:</p>
      </sec>
      <sec id="sec-3-2">
        <title>Assess whether ?O1 is pursuing ?O2.</title>
        <p>Then we show Disciple how to solve the hypothesis
analysis problem based on the knowledge and evidence
provided in the Aum report. The modeling module of
DiscipleEBR guides us in developing a reasoning tree like the one from
the right hand side of Figure 1. The top part of this tree is
shown in Figure 5.</p>
        <p>
          The main goal of this stage is to develop a formal, yet
intuitive argumentation structure [
          <xref ref-type="bibr" rid="ref12 ref13 ref14 ref15">12-15</xref>
          ], representing the
assessment logic as inquiry-driven problem reduction and
solution synthesis. Notice that, guided by a question-answer
pair, we reduce the top-level hypothesis assessment problem to
four sub-problems. We then reduce the first sub-problem to
three simpler problems which we declare as elementary
hypotheses, to be assessed based on evidence. Once we
associate items of evidence from the Aum report with such an
elementary hypothesis, Disciple automatically develops a
reduction tree. For example, we have associated two items of
favoring evidence with the second
leafproblem and Disciple has generated the
reasoning tree whose abstraction is
shown in the bottom-right of Figure 5.
        </p>
        <p>After we have assessed the relevance
and the believability of each item,
Disciple has automatically computed
the inferential force and the likeliness
of the upper level hypotheses,
concluding: “It is certain that Aum
Shinrykio preaches that the apocalypse will
start with chaos and destruction.”
whether Aum Shinrykio has or is attempting to acquire lab production
expertise in order to secretly make sarin-based weapons” is solved
as indicated in Figure 6. As one can see, the strategy employed
by Aum Shinrykio was to identify members trained in
chemistry who can access relevant literature and develop tacit
production knowledge from explicit literature knowledge. This
strategy was successful. A member of Aum Shinrykio was
Masami Tsuchiya who had a master degree in chemistry.
Moreover, there is open-source literature from which a
generally-skilled chemist can acquire explicit knowledge on the
development of sarin-based weapons. From it, the chemist can
relatively easily develop tacit knowledge to produce
sarinbased weapons in the lab.</p>
        <p>The Aum report provides the knowledge and evidence to
solve the initial problem, explaining the success of Aum
Shinrykio in pursuing sarin-based weapons.</p>
        <p>At this stage Disciple only uses a form of non-disruptive
learning from the user, automatically acquiring reduction and
synthesis patterns corresponding to the specific reduction and
synthesis steps from the developed reasoning tree. These
patterns are not automatically applied in problem solving
because they would have too many instantiations, but they are
suggested to the user who can use them when solving a similar
problem which, in this case, is “Assess whether Aum Shinrikyo is
The other hypothesis analysis
problems are reduced in a similar way,
either to elementary hypotheses
assessed based on evidence, or directly
to solutions. For example, based on the
information from the Aum report, the
problem “Assess whether Aum Shinrykio is
developing capabilities to secretly acquire
sarin-based weapons” is reduced to the
problems of assessing whether Aum
Shinrykio has or is attempting to
acquire expertise, significant funds,
production material, and covered mass
production facilities, respectively.</p>
        <p>Further, the problem “Assess whether
Aum Shinrykio has or is attempting to
acquire expertise in order to secretly make
sarin-based weapons” is reduced to the
problems of assessing whether it has or
is attempting to acquire lab production
expertise, mass production expertise,
and weapons assessment expertise,
respectively. Then the problem “Assess</p>
        <p>Based on such specifications, and using the ontology
development tools of Disciple-EBR, the knowledge engineer
develops an ontology that is as complete as possible by
importing concepts and relationships from previously
developed ontologies (including those on the semantic web),
and from the Aum report.</p>
        <p>The next stage in agent development is that of rule learning
and ontology refinement. First one helps the agent to learn
applicability conditions for the patterns learned during the rapid
prototyping stage, thus transforming them into reasoning rules
that will be automatically applied for hypotheses analysis.</p>
        <p>
          From each problem reduction step of a reasoning tree
developed during rapid prototyping the agent will learn a
general problem reduction rule (or will refine it, if the rule was
learned from a previous step), as presented elsewhere (e.g., [
          <xref ref-type="bibr" rid="ref16 ref3">3,
9, 16</xref>
          ]), and illustrated in Figure 8.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Specific reduction</title>
      </sec>
      <sec id="sec-3-4">
        <title>Partially learned rule</title>
        <p>P1
…
o3
Question Q
Answer A</p>
      </sec>
      <sec id="sec-3-5">
        <title>Explanation</title>
        <p>P1
1
o1
f1</p>
        <p>P1</p>
        <p>n
o2
f2
pursuing B-anthracis-based weapons”. The overall approach used
by Aum Shinrykio was the same but, in this case, the group
was not successful because of several key differences. For
example, Endo, the person in charge of the biological weapons
was not an appropriate expert: “Endo’s training, interrupted by
his joining Aum, was as a virologist not as a bacteriologist,
while in Aum’s weapons program he worked with bacteria” [8,
p.33]. While there is open-source literature from which a
generally-skilled microbiologist can acquire explicit knowledge
on the development of B-anthracis-based weapons, “producing
biological materials is a modern craft or an art analogous to
playing a sport or speaking a language. Though some aspects
can be mastered just from reading a book, others relevant to a
weapons program cannot be acquired this way with rapidity or
assurance” [8, p.33].</p>
        <p>The rapid prototyping stage (see Figure 4) results in a
system that can be subjected to an initial validation with the
end-users.</p>
        <p>The next stage is that of ontology development. The
guiding question is: What are the domain concepts,
relationships and instances that would enable the agent to
automatically generate the reasoning trees developed during
rapid prototyping?</p>
        <p>The questions and answers that guide the reasoning process
not only make very clear the logic of the subject matter expert,
but they also drive the ontology development process, as will
be briefly illustrated in the following.</p>
        <p>From each reasoning step of the developed reasoning trees,
the knowledge engineer identifies the instances, concepts and
relationships mentioned in them, particularly those in the
question/answer pair which provides the justification of that
step. Consider, for example, the reduction from the bottom-left
of Figure 6, guided by the following question/answer pair:</p>
      </sec>
      <sec id="sec-3-6">
        <title>Q: Is there any member of Aum Shinrikyo who is trained in chemistry?</title>
      </sec>
      <sec id="sec-3-7">
        <title>A: Yes, Masami Tsuchiya because he has a master degree in chemistry.</title>
        <p>This suggests that the knowledge base of the agent should
include the objects and the relationships shown in Figure 7.
Such semantic network fragments represent a specification of
the needed ontology. In particular, this fragment suggests the
need for a hierarchy of agents (covering Aum Shinrikio and
Masami Tsuchiya), and for a hierarchy of expertise domains
for weapons of mass destruction (including chemistry). The
first hierarchy might include concepts such as organization,
terrorist group, person, and terrorist, while the second might
include expertise domain, virology, bacteriology,
microbiology, and nuclear physics. The semantic network
fragment from Figure 7 also suggests defining two features, has
as member (with organization as domain and person as range),
and has master degree in (with person as domain and expertise
Aum Shinrikyo</p>
        <p>chemistry
has as member has master degree in</p>
        <p>Masami Tsuchiya</p>
        <p>The left part of Figure 8 shows a specific problem reduction
step and a semantic network fragment which represents the
meaning of the question/answer pair expressed in terms of the
agent’s ontology. This network fragment corresponds to that
defined by the knowledge engineer for this particular step,
during the rapid prototyping phase, as illustrated in Figure 7.
Recall that the question/answer pair is the justification of the
reduction step. Therefore we refer to the corresponding
semantic network fragment as the explanation of the reduction
step.</p>
        <p>The right hand side of Figure 8 shows the learned IF-THEN
rule with a plausible version space applicability condition. The
rule pattern is obtained by replacing each instance and constant
in the reduction step with a variable. The lower bound of the
applicability condition is obtained through a minimal
generalization of the semantic network fragment, using the
entire agent ontology as a generalization hierarchy. The upper
bound is obtained through a maximal generalization.</p>
        <p>One, however, only interacts with the agent to identify the
explanation of the reduction step, based on suggestions made
by the agent. Then the agent automatically generates the rule.
For instance, based on the reduction from the left-hand side of
Figure 6, and its explanation from Figure 7, Disciple learned
the rule from Figure 9.</p>
        <p>Finally one teaches the agent to solve other problems. In
this case, however, the agent automatically generates parts of
the reasoning tree, by applying the learned rules, and one
critiques its reasoning, implicitly guiding the agent in refining
the rules. For example, based on the explanation of why an
instance of the rule in Figure 8 is wrong, the agent learns an
except-when plausible version space condition which is added
to the rule, as shown in Figure 10. Such conditions should not
be satisfied in order to apply the rule.</p>
        <p>Correct reductions lead to the generalization of the rule,
either by generalizing the lower bound of the main condition,
or by specializing the upper bound of one or several
exceptwhen conditions, or by adding a positive exception when none
of the above operations is possible.</p>
        <p>Incorrect reductions and their explanations lead to the
specialization of the rule, either by specializing the upper
bound of the main condition, or by generalizing the lower
bound of an except-when condition, or by learning the
plausible version space for a new except-when condition, or by
adding a negative exception.</p>
        <p>The goal is to improve the applicability condition of the
rule so that it only generates correct reductions.</p>
        <p>At the same time with learning new rules and refining
previously learned rules, the agent may also extend the
ontology. For example, to explain to the agent why a generated
reduction is wrong, one may use a new concept or feature. As a
result, the agent will add the new concept or feature in its
ontology of concepts and features. This, however, requires an
adaptation of the previously learned rules since the
generalization hierarchies used to learn them have changed. To
cope with this issue, the agent keeps minimal generalizations of
the examples and the explanations from which each rule was
learned, and uses this information to automatically regenerate
the rules in the context of the new ontology. Notice that this is,
in fact, a form of learning with an evolving representation
language.</p>
        <p>The trained agent may now assist an analyst in assessing
whether other terrorist groups may be pursuing weapons of
mass destruction. For instance, there may be some evidence
that a new terrorist group, the Roqoppi brigade, may be
pursuing botulinum-based biological weapons. The analyst
may instantiate the pattern “Assess whether ?O1 is pursuing ?O2”
with the name of the terrorist group and the weapon and the
agent will generate the hypothesis analysis tree partially shown
in Figure 11, helping the analyst in assessing this hypothesis
based on the knowledge learned from the Aum report.</p>
      </sec>
      <sec id="sec-3-8">
        <title>Incorrect reduction</title>
        <p>Pa1
Question Q
Answer A
…
P11a</p>
      </sec>
      <sec id="sec-3-9">
        <title>Failure</title>
      </sec>
      <sec id="sec-3-10">
        <title>Explanation</title>
        <p>o4
f3
o5
P1na</p>
      </sec>
      <sec id="sec-3-11">
        <title>Refined rule</title>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>FINAL REMARKS</title>
      <p>We have briefly presented an approach to the rapid
development of cognitive assistants for evidence-based
reasoning by capturing and operationalizing the subject matter
expertise from existing reports. This offers a cost-effective
solution to disseminate and use valuable problem solving
expertise which has already been described in lessons learned
documents, after-action reports, or diagnostic reports.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Tecuci</surname>
            <given-names>G.</given-names>
          </string-name>
          (
          <year>1998</year>
          ).
          <source>Building Intelligent Agents: An Apprenticeship Multistrategy Learning Theory, Methodology, Tool and Case Studies</source>
          , San Diego: Academic Press, ISBN:
          <fpage>0126851255</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Clancey</surname>
            <given-names>W.J.</given-names>
          </string-name>
          (
          <year>1984</year>
          ).
          <article-title>NEOMYCIN: Reconfiguring a rule-based system with application to teaching</article-title>
          . In: Clancey,
          <string-name>
            <given-names>W.J.</given-names>
            ,
            <surname>Shortliffe</surname>
          </string-name>
          , E.H. (eds.)
          <source>Readings in Medical Artificial Intelligence</source>
          , pp.
          <fpage>361</fpage>
          -
          <lpage>381</lpage>
          . Reading, MA: Addison-Wesley.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Boicu</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tecuci</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stanescu</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marcu</surname>
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Cascaval</surname>
            <given-names>C.E.</given-names>
          </string-name>
          (
          <year>2001</year>
          ).
          <article-title>Automatic Knowledge Acquisition from Subject Matter Experts</article-title>
          ,
          <source>in Proceedings of the Thirteenth International Conference on Tools with Artificial Intelligence (ICTAI)</source>
          , pp.
          <fpage>69</fpage>
          -
          <lpage>78</lpage>
          .
          <fpage>7</fpage>
          -
          <issue>9</issue>
          <year>November 2001</year>
          , Dallas, Texas. IEEE Computer Society, Los Alamitos, California.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Boicu</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tecuci</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ayers</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marcu</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boicu</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barbulescu</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stanescu</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wagner</surname>
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Apostolova</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ciubotariu</surname>
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2005</year>
          ).
          <article-title>A Learning and Reasoning System for Intelligence Analysis</article-title>
          ,
          <source>Proceedings [5] [6] [7] [8] of the Twentieth National Conference on Artificial Intelligence, AAAI05</source>
          , Pittsburgh, Pennsylvania, USA, July
          <volume>9</volume>
          -13.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Tecuci</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marcu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boicu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schum</surname>
            ,
            <given-names>D.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Russell</surname>
            <given-names>K.</given-names>
          </string-name>
          (
          <year>2011</year>
          ).
          <article-title>Computational Theory and Cognitive Assistant for Intelligence Analysis</article-title>
          ,
          <source>in Proceedings of the Sixth International Conference on Semantic Technologies for Intelligence</source>
          , Defense, and Security - STIDS, pp.
          <fpage>68</fpage>
          -
          <lpage>75</lpage>
          , Fairfax, VA,
          <fpage>16</fpage>
          -
          <lpage>18</lpage>
          November.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Boicu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marcu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tecuci</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schum</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2011</year>
          ).
          <article-title>Cognitive Assistants for Evidence-Based Reasoning Tasks</article-title>
          ,
          <source>AAAI Fall Symposium on Advances in Cognitive Systems, Arlington, VA</source>
          ,
          <fpage>4</fpage>
          -
          <lpage>6</lpage>
          November.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Boicu</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tecuci</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schum</surname>
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2008</year>
          ).
          <article-title>Intelligence Analysis Ontology for Cognitive Assistants</article-title>
          ,
          <source>in Proceedings of the Conference “Ontology for the Intelligence Community: Towards Effective Exploitation and Integration of Intelligence Resources</source>
          ,” Fairfax, VA,
          <fpage>3</fpage>
          -
          <lpage>4</lpage>
          December.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Danzig R.</given-names>
            ,
            <surname>Sageman</surname>
          </string-name>
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Leighton</surname>
          </string-name>
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Hough</surname>
          </string-name>
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Yuki</surname>
          </string-name>
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Kotani</surname>
          </string-name>
          <string-name>
            <surname>R.</surname>
          </string-name>
          and
          <string-name>
            <surname>Hosford Z.M.</surname>
          </string-name>
          (
          <year>2011</year>
          ).
          <article-title>Aum Shinrikyo: Insights Into How Terrorists Develop Biological and Chemical Weapons, Center for a New American Security</article-title>
          , Washington, DC,
          <year>July</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Tecuci G.</given-names>
            ,
            <surname>Boicu</surname>
          </string-name>
          <string-name>
            <surname>M.</surname>
          </string-name>
          (
          <year>2010</year>
          ).
          <article-title>Agent Learning for Mixed-Initiative Knowledge Acquisition</article-title>
          ,
          <source>Final Report for the AFOSR Grant # FA9550- 07-1-0268</source>
          , Learning Agents Center, Fairfax, VA
          <volume>22030</volume>
          ,
          <year>February 28</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Kent</surname>
            <given-names>S.</given-names>
          </string-name>
          (
          <year>1994</year>
          ).
          <article-title>Words of Estimated Probability</article-title>
          , in Steury D.P., ed.,
          <source>Sherman Kent and the Board of National Estimates: Collected Essays</source>
          ,
          <article-title>Center for the Study of Intelligence</article-title>
          , CIA, Washington, DC.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Weiss</surname>
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2008</year>
          ).
          <article-title>Communicating Uncertainty in Intelligence</article-title>
          and Other Professions,
          <source>International Journal of Intelligence and CounterIntelligence</source>
          ,
          <volume>21</volume>
          (
          <issue>1</issue>
          ),
          <fpage>57</fpage>
          -
          <lpage>85</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Schum</surname>
            <given-names>D.A.</given-names>
          </string-name>
          (
          <year>2001</year>
          ).
          <source>The Evidential Foundations of Probabilistic Reasoning</source>
          , Northwestern University Press.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Tecuci</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schum</surname>
            <given-names>D.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boicu</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marcu</surname>
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2011</year>
          ).
          <article-title>Introduction to Intelligence Analysis: A Hands-on Approach with TIACRITIS, 220 pages</article-title>
          , George Mason University.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Wigmore</surname>
            <given-names>J.H.</given-names>
          </string-name>
          (
          <year>1937</year>
          ).
          <source>The Science of Judicial Proof</source>
          . Boston, MA: Little,
          <string-name>
            <surname>Brown</surname>
          </string-name>
          &amp; Co.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Toulmin</surname>
            <given-names>S.E.</given-names>
          </string-name>
          (
          <year>1963</year>
          ).
          <source>The Uses of Argument</source>
          . Cambridge Univ. Press.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Tecuci</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boicu</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boicu</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marcu</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stanescu</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barbulescu</surname>
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2005</year>
          ).
          <source>The Disciple-RKF Learning and Reasoning Agent, Computational Intelligence</source>
          , Vol.
          <volume>21</volume>
          , No.
          <issue>4</issue>
          , pp.
          <fpage>462</fpage>
          -
          <lpage>479</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>