<!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>Probabilistic Argument Maps for Intelligence Analysis: Capabilities Underway</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Haystax Technology</institution>
          ,
          <addr-line>McLean, VA and Las Vegas, NV, Schrag</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Innovative Analytics and Training</institution>
          ,
          <addr-line>Fairfax, VA</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Robert Schrag</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2016</year>
      </pub-date>
      <fpage>16</fpage>
      <lpage>21</lpage>
      <abstract>
        <p>We describe enhancements underway to our probabilistic argument mapping framework called FUSION. Exploratory modeling in the domain of intelligence analysis has highlighted requirements for additional knowledge representation and reasoning capabilities, particularly regarding argument map nodes that are specified as propositional logic functions of other nodes. We also describe more flexible specifications for link strengths and node prior probabilities. We expect these enhancements to find general applicability across problem domains.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Downstream+!
maps. Exploratory modeling in the domain of intelligence
analysis—where argument mapping [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] is useful but (until
FUSION [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]) has not been underpinned by mathematically
sound probabilistic reasoning—has highlighted
requirements for additional capabilities.
      </p>
      <p>Forthcoming sections first present an early model
motivating some of these capabilities, then describe our
technical approach to each. Appendices describe key
elements of our proposed intelligence domain-specific
variant of FUSION called CRAFT.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Motivating FUSION model</title>
      <p>
        Figure 1 is a screenshot of a FUSION model addressing the
CIA’s Iraq retaliation scenario [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], where Iraq might
respond to US forces’ bombing of its intelligence
headquarters by conducting major, minor, or no terror
attacks. The model emphasizes Saddam’s incentives to act.
By setting a hard finding of false on the node SaddamWins,
we can examine computed beliefs under Saddam’s
worstcase scenario. See [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] for details regarding the scenario, our
different models addressing it, and analyst SME model
feedback, as well as review of related work.
s
e
t
i
s
o
p
p
      </p>
      <p>O
Opposite
Node colors in Figure 1 capture whether Saddam’s
disposition (or attitude) regarding a given statement is
favorable (blue) or unfavorable (red). FUSION computes
these dispositions from a single directive—to propagate the
favorability of SaddamWins upstream (only), respecting
link polarities. One node (gray, bottom left) is not touched
by this propagation. Four nodes (purple, top right) have
ambiguous status with respect to Saddam’s disposition.
Belief bars augment spatial tick marks with colors chosen to
reflect the degree of concern a given statement would pose
given a node’s disposition. Lower belief (redder bar) poses
less concern regarding a statement viewed unfavorably,
more regarding one viewed favorably, higher belief (bluer
bar) the reverse. Red/blue contrast thus draws attention to a
statement that should be of concern to Saddam.</p>
      <p>FUSION models can include argument map link types per
Table 1.</p>
      <p>In a FUSION model, every argument map statement is a
Hypothesis. For the last two link types in Table 1, the
downstream statement also is a Logic statement.</p>
      <p>
        In developing the model in Figure 1, we identified the
following representation and reasoning shortcomings for
which we are now implementing responsive capabilities.
•! Beliefs computed for the scenario’s three outcomes do not
sum to 1.0. We can correct this by recasting
IraqRetaliatesWithTerror as an exclusive-or (summary or
constraint) Logic statement (see section 3) over the
scenario’s outcomes, rather than as an absolutely
supported Hypothesis, while also addressing the next
issue.
•! In current FUSION, a given node cannot be both a Logic
statement and an indicator. Our FUSION spec-to-BN
conversion software [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] treats these as distinct patterns of
parents. An indicated node acts as a BN parent to an
indicating one. A Logic statement’s input nodes act as
parents to the Logic node itself. To implement indication
by a Logic statement node L, we will create (under the
hood) an auxiliary node I to serve as the indicator and
assert a Logic constraint C (with parents L and I)
establishing L = I.
      </p>
      <p>1 Per argument map convention, “downstream” is left,
“upstream” right in the left-flowing argument map of Figure 1.
•! TerrorAttacksFail (likewise TerrorAttacksSucceed) should
be allowed to be true only when TerrorAttacks also is
true. We are correcting this by adding the capability to
assert Logic constraints, such as the one described for this
model in section 3 to be used instead of the naïve
OppositeOf link now connecting TerrorAttacksFail and
TerrorAttacksSucceed.</p>
    </sec>
    <sec id="sec-3">
      <title>3 Logic statements</title>
      <p>We are working to make FUSION support any standard
propositional logic expression using unary, binary, or higher
arity operators2. When a Logic statement has a hard true
finding3, we refer to it as a Logic constraint, otherwise as a
summarizing Logic statement.</p>
      <p>Figure 1’s model would be better if TerrorAttacksFail
were allowed to be true only if TerrorAttacks also were true.
We know that an attempted action can succeed or fail only if
it occurs. By explicitly modeling (as Hypotheses) both
these potential action results and adding a Logic constraint4,
we can force zero probability for every excluded truth value
combination, improving the model (in tradecraft terms,
correcting a “logic flaw”). See Figure 2.</p>
      <p>Figure 2’s graphics are from the COTS Netica BN
Application. Because all nodes in the generated BN
underlying a FUSION model are binary, we also could render
the full BN using more perspicuous single belief bars.</p>
      <p>FUSION implements a target belief spec either
(depending on purpose) using a BN node like Figure 2’s
ConstraintTBC or (equivalently) via a likelihood finding on
the subject BN node. The FUSION GUI does not ordinarily
expose an auxiliary node like ConstraintTBC to an analyst.</p>
      <p>This example is for illustration. We can implement this
particular BN pattern without target beliefs. We also could
implement absolute-strength IndicatedBy links as simple
implication Logic constraints. However, this would not
naturally accommodate one of these links’ key properties—
the ability to specify degree of belief in the link’s upstream
node when the downstream node is true—relevant because
we can infer nothing about P given P ! Q and knowing Q
to be true. It also demands two target belief specs that tend
to compete. We are working to identify more Logic
constraint patterns that can be implemented without target
beliefs and to generalize specification of belief degree for
any underdetermined entries in a summarizing Logic
statement’s CPT.</p>
      <p>2 See, e.g., https://en.wikipedia.org/wiki/Truth_table.</p>
      <p>3 A likelihood finding could be used to implement a soft
constraint.</p>
      <p>4 This constraint can be rendered (abbreviating statement
names) as (or/(and/occur/(xor/succeed/fail))/(and/(not/Occurs)/(nor/
Succeeds/ Fails))) or more compactly via an if-then-else logic
function (notated ite) as (ite/ Occurs/ (xor/ Succeeds/ Fails)/ (nor/
Succeeds/ Fails))—if an attack occurs, it either succeeds or fails,
else it neither succeeds nor fails.</p>
      <sec id="sec-3-1">
        <title>If#Attack#Only#1#Outcome#Constraint</title>
        <p>true 75.0
false 25.0</p>
      </sec>
      <sec id="sec-3-2">
        <title>FailedAttack</title>
        <p>true 25.0
false 75.0</p>
      </sec>
      <sec id="sec-3-3">
        <title>SuccessfullAttack</title>
        <p>true 25.0
false 75.0</p>
      </sec>
      <sec id="sec-3-4">
        <title>If#Attack#Only#1#Outcome#Constraint</title>
        <p>true )100
false )))0</p>
      </sec>
      <sec id="sec-3-5">
        <title>Attacks#occur</title>
        <p>true 50.0
false 50.0</p>
      </sec>
      <sec id="sec-3-6">
        <title>FailedAttack</title>
        <p>true 25.0
false 75.0</p>
      </sec>
      <sec id="sec-3-7">
        <title>SuccessfullAttack</title>
        <p>true 25.0
false 75.0</p>
      </sec>
      <sec id="sec-3-8">
        <title>Attacks#occur</title>
        <p>true 50.0
false 50.0</p>
      </sec>
      <sec id="sec-3-9">
        <title>ConstraintTBC</title>
        <p>true )100
false )))0</p>
        <p>We can set a target belief for any FUSION node whose
computed belief under a baseline situation (say, before the
application of a set of evidence items or assumptions)
deviates from a modeler’s expectations or requirements.
We have formerly done this to address unacceptably small
probabilities for far-upstream nodes—an issue we hope to
see less of with new flexible link strengths (section 5). A
target belief also can serve an exogenous variable that
should be informed by real-world data statistics.</p>
        <p>
          As with BN belief inference, there is no closed-form
solution for target belief satisfaction, which requires a
gradient descent optimization over individual BN inference
invocations, measuring in each step nodes’ differences
between observed beliefs and targets. Our implementation
[
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] computes differences on a log odds (vs. linear) scale
(reflecting actual belief impacts and reducing gradient
descent oscillation), initially adjusts all involved nodes in a
single optimization step (effectively, in parallel—saving
steps compared to strictly serial optimization), and saves the
work from previous satisfaction processes over a given
model (e.g., under edit) for fast incremental operation.
        </p>
        <p>
          In Haystax’ primary risk assessment FUSION application
(called CARBON) including hundreds of BN nodes and
dozens of target beliefs, processing takes just a few seconds.
Our results compare favorably with those of related
published algorithms. Per the recent survey by Mrad et al
[
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], who refer to this capability as “fixed probability
distribution” specification, the only published results are for
much smaller problems.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>5 Flexible belief and strength specifications</title>
      <p>
        A given Bayesian network requires the specification of
many individual, point probability values, but intelligence
analysts generally work with probability ranges, as
institutionalized in Intelligence Community Directive (ICD)
203 [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] per Figure 3 below. Beyond perfunctorily
associating a uniform distribution with the range [45, 55]%
(zero elsewhere) with the designation “roughly even
chance,” a user may select a standard distribution (such as
our grey one) or specify his/her own mode, inflection points,
and non-zero probability range—perhaps all by dragging a
few handles on a control. Only the curves’ shapes matter
here. FUSION normalizes height to agree with unit area (=
1.0).
      </p>
      <p>While several of FUSION’s parameters are
probabilityvalued, the most prominent way probabilities enter a
FUSION-generated BN is via under-the-hood encoding of
onthe-dashboard-specified indication strengths. FUSION now
encodes strengths using fixed odds ratios per Figure 4.
More flexible specifications may be more appropriate for
many problem types.</p>
      <p>Robust statistical sampling of belief distributions could,
in large models, exceed GUI near-real-time thresholds for
to-user feedback. Another attractive option, given
reasonably tight belief distributions, is to develop only
bounds for statement beliefs, exploiting FUSION’s
perstatement actor disposition framework (described at Figure
1). Develop a statement’s favorable bound (i.e., the lower
bound for an unfavorable statement, upper bound for a
favorable one) by considering just other favorable bounds in
an unambiguous-statement-only subgraph, and address
limited combinatorics over disconnected subgraphs. Belief
bars resulting would thus include just two tick marks, rather
than a richer distribution shape.</p>
    </sec>
    <sec id="sec-5">
      <title>6 Conclusion</title>
      <p>We are working to make FUSION, already a powerful
framework for SMEs to author Bayesian network-based
models, more complete and versatile for probabilistic
argument map applications—in intelligence analysis and in
other domains, generally. Allowing summary Logic
statements to serve as probabilistic indicators of hypotheses
will afford uniform expressive power across a model’s
downstream and upstream levels. Supporting arbitrary Logic
formulas as constraints as well as summary statements will
increase expressiveness and conciseness. Supporting more
flexible belief and strength specifications to capture finer
probabilistic distinctions will enable more precise modeling
by individual SMEs and SME teams or crowds—values for
numeric model parameters might be aggregated using
crowdsourcing methods.</p>
      <p>Our proposed CRAFT variant designed for intelligence
analysis will express all of FUSION’s capabilities in
analystfriendly vocabulary (appendix A) and develop mechanisms
and methods explicitly supporting the modeling of source
credibility per Intelligence Community standards (appendix
B).
A</p>
    </sec>
    <sec id="sec-6">
      <title>CRAFT node and link types</title>
      <sec id="sec-6-1">
        <title>A Hypothesis distinguished as a primary</title>
        <p>intelligence analysis alternative—e.g., a
possible future (or present, or past) situation.
A statement whose probability of truth
depends on upstream-neighbor links.</p>
        <p>A statement that is in principle knowable from
evidence available in the problem domain.
A statement reported by some source.
Absolutely influences a like-content
EvidenceHypothesis that is
sourceindependent and accommodates any number
of SupportedBy or RefutedBy links from
EvidenceReports corresponding to different
reports.</p>
        <p>A statement characterizing the credibility of
an EvidenceReport. Per modeler discretion,
either a single node or a conjunctive Logic
statement summarizing relevant credibility
factors.</p>
        <p>A statement posited by an analyst to fill a gap
in available information. Plays a modeling
role similar to EvidenceReport, when
evidence is unavailable.</p>
        <p>Validity/
(of Assumption)/</p>
        <p>Logic/</p>
      </sec>
      <sec id="sec-6-2">
        <title>A statement characterizing an analyst’s self</title>
        <p>assessed legitimacy of a posited Assumption.</p>
        <p>A propositional logic expression over other
statement nodes, either summarizing or
constraining them.</p>
        <p>
          CRAFT will apply to a HUMINT EvidenceReport
statement Schum’s framework [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] that assesses Credibility
with respect to four attributes of the reporting agent:
Veracity, Objectivity, Competence, and Opportunity to
observe what’s been reported. A reported statement is
believed credible only if all four of its factor statements are
believed true, so we link the EvidenceReport as RelevantIf
this conjunctive Logic statement holds. Note that the factor
statements are themselves Hypotheses, subject to supporting
and refuting statements bearing potentially rich argument
structure. Note that direct or indirect corroboration will
increase an EvidenceReport’s Credibility.
        </p>
        <p>
          Below we outline how CRAFT will map (in italics)
specific analytical tradecraft standards (in bold) regarding
items of evidence per ICD 203 [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] to Schum’s factors or, as
appropriate, other model elements.
        </p>
        <p>
          Factors from ICD 203 D.6.e.1:
1.!Accuracy (use Credibility) and completeness (explicitly
model omitted possibilities as Assumptions or other
appropriate statements)
2.!Possible denial (use Opportunity) and deception
(elaborate a deceptive course of action as an Outcome or
other Hypothesis—see SaddamMaintainsDiplomacy in
Figure 1, e.g.)
3.!Age and continued currency of information (use
temporal relevance)
4.!Technical elements of collection (apply true/false
positive/negative sensor models, confusion matrices—
ancillary to Schum’s framework—see also [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ],
discussed below)
5.!Source access (use Opportunity)
6.!Validation (model as corroboration by other sources)
7.!Motivation (model as in Figure 1, e.g.)
8.!Possible bias (use Objectivity)
9.!Expertise (use Competence)
        </p>
        <p>
          More factors from ICD 206 [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] appendix A (glossary),
“source descriptor:”
10.! Precision or technical quality (see 1, 4)
11.! Context (connotes scope or socio-cultural setting—
capture via other model statements, as appropriate)
12.! For human sources:
a.! Level of access (use Opportunity)
b.! Past reporting record (associate with base
rate/prior for any credibility factor—
including/especially Veracity)
c.! Potential biases—e.g., political, personal,
professional, religious affiliations (counter-indicators for
Objectivity)
        </p>
        <p>From ICD 206 appendix D.5:
13.! Potential strengths and limitations of available
information (see 1)
14.! Notable inconsistencies in reporting (impugn CredibilC
ity, per factor as warranted)
15.! Important information gaps (see 1)
16.! Other factors deemed relevant (model as
appropriate)</p>
        <p>
          HUMINT is testimonial evidence. Hughes [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] addresses
credibility also for tangible and sensor evidence and
presents considerations that may inform argument structure
affecting each of Schum’s testimonial evidence credibility
factors. He also tenders the factor “observational
sensitivity”—which may be as relevant to sensing by
humans as it is to sensing by devices—and addresses
authenticity, chain of custody, and primary vs. secondary (or
tertiary, ...) sources. CRAFT might be engineered to support
some of these refinements explicitly. CRAFT’s credibility
reasoning will remain explicitly probabilistic, however,
exploiting the FUSION foundation, rather than assessed ad
hoc as in the later sections of Hughes’ report.
        </p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <article-title>[1]! CIA Directorate of Intelligence, “A Tradecraft Primer: The Use of Argument Mapping,” Tradecraft Review 3(1), Kent Center for Analytic Tradecraft</article-title>
          , Sherman Kent School.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>! Intelligence</given-names>
            <surname>Community</surname>
          </string-name>
          <article-title>Directive (ICD) 203</article-title>
          , “Analytic Standards,
          <source>” January 2</source>
          ,
          <year>2015</year>
          . http://fas.org/irp/dni/icd/icd203.pdf
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>! Intelligence</given-names>
            <surname>Community</surname>
          </string-name>
          <article-title>Directive (ICD) 206, “Sourcing Requirements for Disseminated Analytic Products</article-title>
          ,” October 17,
          <year>2007</year>
          . http://fas.org/irp/dni/icd/icd-206.pdf
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>! Richards J. Heuer</surname>
          </string-name>
          , Jr.,
          <source>Psychology of Intelligence Analysis, Central Intelligence Agency Historical Document</source>
          . https://www.cia.gov/library/center
          <article-title>-for-the-study-ofintelligence/csi-publications/books-andmonographs/psychology-of-intelligence-analysis (</article-title>
          <source>Posted: Mar</source>
          <volume>16</volume>
          ,
          <year>2007</year>
          01:52 PM. Last Updated: Jun 26,
          <year>2013</year>
          08:05 AM.)
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]! Frank Hughes, “
          <article-title>A Tutorial on Credibility Assessment for Various Forms of Intelligence Evidence</article-title>
          ,” Joint Military Intelligence College,
          <source>Defense Intelligence Agency, Revised 5 April</source>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>! Ali</given-names>
            <surname>Ben</surname>
          </string-name>
          <string-name>
            <surname>Mrad</surname>
          </string-name>
          , Veronique Delcroix, Sylvain Piechowiak, Philip Leicester, and Mohamed Abid, “
          <article-title>An explication of uncertain evidence in Bayesian networks: likelihood evidence and probabilistic evidence</article-title>
          ,” Applied Intelligence, published online
          <issue>20</issue>
          <year>June 2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>! Robert</given-names>
            <surname>Schrag</surname>
          </string-name>
          ,
          <string-name>
            <surname>Joan</surname>
            <given-names>McIntyre</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Melonie</given-names>
            <surname>Richey</surname>
          </string-name>
          , Kathryn Laskey, Edward Wright, Robert Kerr, Robert Johnson, Bryan Ware, Robert Hoffman, “
          <article-title>Probabilistic Argument Maps for Intelligence Analysis: Completed Capabilities</article-title>
          ,
          <source>” 16th Workshop on Computational Models of Natural Argument</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>! Robert</given-names>
            <surname>Schrag</surname>
          </string-name>
          , Edward Wright, Robert Kerr, and Robert Johnson, “
          <article-title>Target Beliefs for SME-oriented</article-title>
          ,
          <source>Bayesian Network-based Modeling,” 13th Annual Bayesian Modeling Applications Workshop</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>! David A.</given-names>
            <surname>Schum</surname>
          </string-name>
          ,
          <source>Evidential Foundations of Probabilistic Reasoning</source>
          , Wiley and Sons,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]!Edward Wright, Robert Schrag, Robert Kerr, and Bryan Ware, “
          <article-title>Automating the Construction of Indicator-Hypothesis Bayesian Networks from Qualitative Specifications,”</article-title>
          <source>Haystax Technology technical report</source>
          ,
          <year>2015</year>
          , https://labs.haystax.com/wpcontent/uploads/2016/06/BMAW15-160303
          <article-title>-update</article-title>
          .
          <source>pdf.</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>