<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Probabilistic Argument Maps for Intelligence Analysis: Capabilities Underway</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Robert</forename><surname>Schrag</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Haystax Technology</orgName>
								<orgName type="institution">McLean</orgName>
								<address>
									<addrLine>and Las Vegas</addrLine>
									<region>VA, NV (, Schrag</region>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="institution">$ Camber Corporation</orgName>
								<address>
									<settlement>Columbia</settlement>
									<region>MD</region>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Edward</forename><surname>Wright</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Haystax Technology</orgName>
								<orgName type="institution">McLean</orgName>
								<address>
									<addrLine>and Las Vegas</addrLine>
									<region>VA, NV (, Schrag</region>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="institution">$ Camber Corporation</orgName>
								<address>
									<settlement>Columbia</settlement>
									<region>MD</region>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Robert</forename><surname>Kerr</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Haystax Technology</orgName>
								<orgName type="institution">McLean</orgName>
								<address>
									<addrLine>and Las Vegas</addrLine>
									<region>VA, NV (, Schrag</region>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="institution">$ Camber Corporation</orgName>
								<address>
									<settlement>Columbia</settlement>
									<region>MD</region>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Robert</forename><surname>Johnson</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Haystax Technology</orgName>
								<orgName type="institution">McLean</orgName>
								<address>
									<addrLine>and Las Vegas</addrLine>
									<region>VA, NV (, Schrag</region>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="institution">$ Camber Corporation</orgName>
								<address>
									<settlement>Columbia</settlement>
									<region>MD</region>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Bryan</forename><surname>Ware</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Haystax Technology</orgName>
								<orgName type="institution">McLean</orgName>
								<address>
									<addrLine>and Las Vegas</addrLine>
									<region>VA, NV (, Schrag</region>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="institution">$ Camber Corporation</orgName>
								<address>
									<settlement>Columbia</settlement>
									<region>MD</region>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Joan</forename><surname>Mcintyre</surname></persName>
							<affiliation key="aff2">
								<orgName type="institution">Innovative Analytics and Training</orgName>
								<address>
									<settlement>Fairfax</settlement>
									<region>VA</region>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Melonie</forename><surname>Richey $</surname></persName>
						</author>
						<author>
							<persName><forename type="first">Kathryn</forename><surname>Laskey</surname></persName>
							<affiliation key="aff3">
								<orgName type="institution">George Mason University</orgName>
								<address>
									<settlement>Fairfax</settlement>
									<region>VA</region>
								</address>
							</affiliation>
							<affiliation key="aff4">
								<orgName type="institution">Florida Institute for Human-Machine Cognition</orgName>
								<address>
									<settlement>Pensacola</settlement>
									<region>FL</region>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Robert</forename><surname>Hoffman</surname></persName>
						</author>
						<title level="a" type="main">Probabilistic Argument Maps for Intelligence Analysis: Capabilities Underway</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">AAF08C9051CD121BB4CAFB78BF868F0D</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T17:46+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><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></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">Introduction</head><p>Haystax has developed the FUSION framework (see our companion paper <ref type="bibr">[7]</ref>) to facilitate creation of useful Bayesian networks (BNs) by non-technical subject matter experts (SMEs). Because we use exclusively binary random variables (BN nodes) over the domain {true, false}, it is natural to construe FUSION models as probabilistic argument maps. Exploratory modeling in the domain of intelligence analysis-where argument mapping <ref type="bibr" target="#b0">[1]</ref> is useful but (until FUSION <ref type="bibr">[6]</ref>) 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.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Motivating FUSION model</head><p>Figure <ref type="figure" target="#fig_1">1</ref> is a screenshot of a FUSION model addressing the CIA's Iraq retaliation scenario <ref type="bibr" target="#b3">[4]</ref>, 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 <ref type="bibr">[7]</ref> for details regarding the scenario, our different models addressing it, and analyst SME model feedback, as well as review of related work.  Node colors in Figure <ref type="figure" target="#fig_1">1</ref> 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 <ref type="table" target="#tab_0">1</ref>.  <ref type="table" target="#tab_0">1</ref>, the downstream statement also is a Logic statement.</p><p>In developing the model in Figure <ref type="figure" target="#fig_1">1</ref>, we identified the following representation and reasoning shortcomings for which we are now implementing responsive capabilities.</p><p>•! 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.</p><p>•! In current FUSION, a given node cannot be both a Logic statement and an indicator. Our FUSION spec-to-BN conversion software [6] 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>•! 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">Logic statements</head><p>We are working to make FUSION support any standard propositional logic expression using unary, binary, or higher arity operators <ref type="foot" target="#foot_1">2</ref> . When a Logic statement has a hard true finding <ref type="foot" target="#foot_2">3</ref> , we refer to it as a Logic constraint, otherwise as a summarizing Logic statement.</p><p>Figure <ref type="figure" target="#fig_1">1</ref>'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 constraint <ref type="foot" target="#foot_3">4</ref> , we can force zero probability for every excluded truth value combination, improving the model (in tradecraft terms, correcting a "logic flaw"). See Figure <ref type="figure" target="#fig_2">2</ref>. Figure <ref type="figure" target="#fig_2">2</ref>'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 <ref type="figure" target="#fig_2">2</ref>'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. 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 propertiesthe 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>4' Target'beliefs</head><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 [8] 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 <ref type="bibr">[6]</ref>, who refer to this capability as "fixed probability distribution" specification, the only published results are for much smaller problems.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5">Flexible belief and strength specifications</head><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 <ref type="bibr" target="#b1">[2]</ref> per Figure <ref type="figure">3</ref> below.</p><p>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 <ref type="figure">4</ref>. More flexible specifications may be more appropriate for many problem types. Figure <ref type="figure">3</ref>. FUSION will bridge the gap between analysts' familiar probability ranges (shown here with preferred natural language labels per ICD 203) and Bayesian networks' exact probability requirements by supporting explicit probability distributions (shown here in grey). Beyond perfunctorily associating a uniform distribution with the range [45, 55]% (zero elsewhere) with the designation "roughly even chance," a CRAFT user may select a standard distribution (like our grey one) or a customized one, perhaps (in a future GUI) by dragging a few handles (small circles) on the distribution curve. Thus, CRAFT supports analysts' best intuitions about argument probabilities without forcing commitments. By sampling over input distributions, develop (under the hood) and display (on the dashboard) output belief distributions for argument map statements/nodes.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Figure 4. We are generalizing FUSION'S current fixed indication strengths (labeled vertical lines) as user-specifiable probability distributions similar to those planned for probabilities (Figure 3), supporting any odds ratio or distribution thereof. Absolutely is intended as logical implication. Fusion does not otherwise commit analysts to absolute certainty. An odds or log odds scale may be more salient than standard probability. This approach develops finest warranted beliefs.</head><p>Robust statistical sampling of belief distributions could, in large models, exceed GUI near-real-time thresholds for to-user feedback.</p><p>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 <ref type="figure" target="#fig_1">1</ref>). 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6">Conclusion</head><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.</p><p>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).</p><p>[5]! Frank Hughes, "A Tutorial on Credibility Assessment for Various Forms of Intelligence Evidence," </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>A CRAFT node and link types</head><p>Table <ref type="table">2</ref> and Table <ref type="table" target="#tab_2">3</ref> describe the roles of different node and link types in our proposed intelligence domain-specific variant of FUSION called CRAFT. We anticipate distinct GUI icons for these types.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Table 2. CRAFT will distinguish among model statement types in ways that are salient to intelligence analysts.</head><p>Outcome/ A Hypothesis distinguished as a primary intelligence analysis alternative-e.g., a possible future (or present, or past) situation.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Hypothesis/</head><p>A statement whose probability of truth depends on upstream-neighbor links.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>EvidenceJ Hypothesis/</head><p>A statement that is in principle knowable from evidence available in the problem domain.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>EvidenceJ/ Report/</head><p>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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Credibility/ (of EvidenceReport)/</head><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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Assumption/</head><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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Validity/ (of Assumption)/</head><p>A statement characterizing an analyst's selfassessed legitimacy of a posited Assumption.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Logic/</head><p>A propositional logic expression over other statement nodes, either summarizing or constraining them. HUMINT is testimonial evidence. Hughes [5] 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.</p><p>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></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 1 .</head><label>1</label><figDesc>Figure 1. Statement nodes are connected by positive (solid grey line) and negative (dashed grey line) indication links of various strengths (per line thicknesses). Argument flow (from evidence to outcomes) is from right to left-e.g., SaddamWins is strongly indicated by SaddamKeepsFace. Outcome hypothesis nodes are circled in yellow. SaddamWins (hard finding false) captures Saddam's incentives to act or not.</figDesc><graphic coords="1,54.42,471.26,500.46,163.10" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 2 .</head><label>2</label><figDesc>Figure 2. We are implementing Logic/ constraints to enforce sound logical reasoning. The constraint node (left, in right model fragment) ensures that the model will believe in attack success/failure only when an attack actually occurs. Setting the hard true finding on this node turns the summarizing Logic statement (left, in the left fragment) into the Logic constraint-but also distorts the model's computed probabilities for the three Hypotheses. Presuming these probabilities have been deliberately engineered by the modeler, FUSION must restore them. It does so by specifying (bottom fragment) a target belief (implemented via the ConstraintTBC node) on one of the Hypotheses.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0"><head></head><label></label><figDesc></figDesc><graphic coords="4,72.48,238.08,467.04,112.08" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1 .</head><label>1</label><figDesc>FUSION supports probabilistic argument map model link types (center column). Only the final two link types implementing propositional logic operators take an arbitrary number of input statements. All other link types are binary.In a FUSION model, every argument map statement is a Hypothesis. For the last two link types in Table</figDesc><table><row><cell></cell><cell>IndicatedBy/</cell><cell></cell></row><row><cell></cell><cell>CounterIndicatedBy/</cell><cell></cell></row><row><cell>Downstream 1</cell><cell>MitigatedBy/</cell><cell>Upstream</cell></row><row><cell>statement</cell><cell>RelevantIf/</cell><cell>statement(s)</cell></row><row><cell></cell><cell>OppositeOf/</cell><cell></cell></row><row><cell></cell><cell>ImpliedByConjunction/</cell><cell></cell></row><row><cell></cell><cell>ImpliedByDisjunction/</cell><cell></cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_2"><head>Table 3 .</head><label>3</label><figDesc>CRAFT will support probabilistic argument map model link types (center column). All link types are binary. 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. Proceedings of CMNA 2016 -Floris Bex, Floriana Grasso, Nancy Green (eds) 11.! Context (connotes scope or socio-cultural settingcapture via other model statements, as appropriate) 12.! For human sources: a.! Level of access (use Opportunity) b.! Past reporting record (associate with base</figDesc><table><row><cell></cell><cell>SupportedBy/</cell><cell></cell></row><row><cell>Downstream</cell><cell>RefutedBy/</cell><cell>Upstream</cell></row><row><cell>statement</cell><cell>MitigatedBy/</cell><cell>statement</cell></row><row><cell></cell><cell>RelevantIf/</cell><cell></cell></row><row><cell></cell><cell>LogicInput/</cell><cell></cell></row><row><cell cols="2">B CRAFT credibility reasoning</cell><cell></cell></row><row><cell cols="3">CRAFT will apply to a HUMINT EvidenceReport</cell></row><row><cell cols="3">statement Schum's framework [6] that assesses Below we outline how CRAFT will map (in italics)</cell></row><row><cell cols="3">specific analytical tradecraft standards (in bold) regarding</cell></row><row><cell cols="3">items of evidence per ICD 203 [2] to Schum's factors or, as</cell></row><row><cell cols="2">appropriate, other model elements.</cell><cell></cell></row><row><cell cols="2">Factors from ICD 203 D.6.e.1:</cell><cell></cell></row><row><cell cols="3">1.!Accuracy (use Credibility) and completeness (explicitly</cell></row><row><cell cols="3">model omitted possibilities as Assumptions or other</cell></row><row><cell cols="2">appropriate statements)</cell><cell></cell></row><row><cell cols="3">2.!Possible denial (use Opportunity) and deception (elabo-</cell></row><row><cell cols="3">rate a deceptive course of action as an Outcome or</cell></row><row><cell cols="3">other Hypothesis-see SaddamMaintainsDiplomacy in</cell></row><row><cell>Figure 1, e.g.)</cell><cell></cell><cell></cell></row><row><cell cols="3">3.!Age and continued currency of information (use tem-</cell></row><row><cell>poral relevance)</cell><cell></cell><cell></cell></row><row><cell cols="3">4.!Technical elements of collection (apply true/false posi-</cell></row><row><cell cols="3">tive/negative sensor models, confusion matrices-</cell></row><row><cell cols="3">ancillary to Schum's framework-see also [5], dis-</cell></row><row><cell>cussed below)</cell><cell></cell><cell></cell></row><row><cell cols="2">5.!Source access (use Opportunity)</cell><cell></cell></row><row><cell cols="3">6.!Validation (model as corroboration by other sources)</cell></row><row><cell cols="2">7.!Motivation (model as in Figure 1, e.g.)</cell><cell></cell></row><row><cell cols="2">8.!Possible bias (use Objectivity)</cell><cell></cell></row><row><cell cols="2">9.!Expertise (use Competence)</cell><cell></cell></row><row><cell cols="3">More factors from ICD 206 [3] appendix A (glossary),</cell></row><row><cell>"source descriptor:"</cell><cell></cell><cell></cell></row><row><cell cols="2">10.! Precision or technical quality (see 1, 4)</cell><cell></cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">Per argument map convention, "downstream" is left, "upstream" right in the left-flowing argument map of Figure1.</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_1">See, e.g., https://en.wikipedia.org/wiki/Truth_table.</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_2">A likelihood finding could be used to implement a soft constraint.</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="4" xml:id="foot_3">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.Proceedings of CMNA 2016 -Floris Bex, Floriana Grasso, Nancy Green (eds)</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" xml:id="foot_4">Proceedings of CMNA 2016 -Floris Bex, Floriana Grasso, Nancy Green (eds)</note>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">A Tradecraft Primer: The Use of Argument Mapping</title>
	</analytic>
	<monogr>
		<title level="m">Kent Center for Analytic Tradecraft</title>
				<meeting><address><addrLine>Sherman Kent School</addrLine></address></meeting>
		<imprint>
			<biblScope unit="volume">3</biblScope>
		</imprint>
	</monogr>
	<note>! CIA Directorate of Intelligence</note>
</biblStruct>

<biblStruct xml:id="b1">
	<monogr>
		<ptr target="http://fas.org/irp/dni/icd/icd-203.pdf" />
		<title level="m">! Intelligence Community Directive (ICD) 203</title>
				<imprint>
			<date type="published" when="2015-01-02">January 2, 2015</date>
		</imprint>
	</monogr>
	<note>Analytic Standards</note>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<ptr target="http://fas.org/irp/dni/icd/icd-206.pdf" />
		<title level="m">Sourcing Requirements for Disseminated Analytic Products</title>
				<imprint>
			<date type="published" when="2007-10-17">October 17, 2007</date>
		</imprint>
	</monogr>
	<note>! Intelligence Community Directive (ICD) 206</note>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<author>
			<persName><forename type="first">J</forename><surname>Richards</surname></persName>
		</author>
		<author>
			<persName><surname>Heuer</surname><genName>Jr</genName></persName>
		</author>
		<ptr target="https://www.cia.gov/library/center-for-the-study-of-intelligence/csi-publications/books-and-monographs/psychology-of-intelligence-analysis" />
		<title level="m">Psychology of Intelligence Analysis, Central Intelligence Agency Historical Document</title>
				<imprint>
			<date>Mar 16, 2007 01:52 PM. Last Updated. Jun 26, 2013 08:05 AM</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
