<!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>The Application of Qualitative Metadata to Analogical Reasoning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Dave Raggett</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>C/ERCIM</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sophia Antipolis</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>France</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>Analogical reasoning can be used for plausible inferences based upon direct similarities or structural mappings involving properties and relationships. This can be implemented on top of a combination of symbolic knowledge plus sub-symbolic qualitative metadata, with matching based upon structural or causal similarities, and noticing interesting diferences, in essence, abstracting from similarities and dissimilarities, and will be applied to examples of the form “A is to B as C is to ?X”. A further challenge is to support the use of literal and figurative analogies in natural language, e.g., comparing life to the wheel of fortune, when you want to highlight the role of chance. An easy-to-use syntax will be presented for expressing knowledge, along with a web-based proof of concept demonstrator, and a unifying cognitive architecture for human-like AI. This builds upon pioneering work by Alan Colins on plausible reasoning, and Dedre Gentner on analogies.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Plausible reasoning</kwd>
        <kwd>Human-like AI</kwd>
        <kwd>analogies</kwd>
        <kwd>Cognitive Architecture</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The paper starts with an introduction to plausible reasoning before moving on to analogical
reasoning and how this can be supported as an extension of plausible reasoning. This very
much work in progress, and part of a long term drive to realise human-like memory, reasoning
and learning in cognitive agents.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Plausible Reasoning</title>
      <p>
        We are learning all the time, and revising our beliefs and understanding as we interact with
others. As such our knowledge is imperfect and subject to uncertainties, incompleteness and
inconsistencies. This is challenging both for conventional mathematical logic, and for statistical
approaches such as Bayesian inference due to the dificulties in obtaining the required statistics.
Evolution has equipped humans with the means to deal with imperfect knowledge in a rational
way based upon sound judgement, albeit subject to various kinds of cognitive biases, see, e.g.,
Daniel Kahneman [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>People have studied the principles for plausible arguments since the days of Ancient Greece,
e.g., Carneades and his guidelines for argumentation. This was developed further by a long
line of philosophers, including Locke, Bentham, Wigmore, Keynes, Wittgenstein, Pollock and
many others. Plausible reasoning is everyday reasoning, and the basis for legal, ethical and
business discussions. It is now timely to exploit plausible reasoning with imperfect knowledge
in support of human-machine cooperative work. This will enable computers to analyse, explain,
justify, expand-upon and argue in human-like ways.</p>
      <p>Consider  → , which means if  is true then  is true. If  is false then  may be true or
false. If  is true, we still can’t be sure that  is true, but if  is false then  must be false. We
can go further with a little knowledge. Consider a more concrete example: if it is raining then it
is cloudy. This can be used for inferences in both directions. Rain is more likely if it is cloudy,
and likewise, if it is not raining, then it might be sunny, so it is less likely that it is cloudy. Such
arguments draw upon qualitative terms in lieu of quantitative statistics.</p>
      <p>In essence, plausible reasoning draws upon prior knowledge as well as on the role of analogies,
and the consideration of examples as precedents. Mathematical proof is replaced by reasonable
arguments, both for and against a premise, along with how these are assessed. In legal
proceedings, for instance, arguments are laid out by the Prosecution and the Defence, the Judge decides
what evidence is admissible, whilst guilt is assessed by the Jury.</p>
      <p>
        During the 1980’s Alan Collins and his co-workers developed a theory of plausible
reasoning [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] based upon analysis of recordings of how people reasoned. They found that:
• There are several categories of inference rules that people commonly use to answer
questions.
• People weigh the evidence that bears on a question, both for and against, rather like in
court cases.
• People are more or less certain depending on the certainty of the premises, the certainty of
the inferences, and whether diferent inferences lead to the same or oppositive conclusions.
• Facing a question for which there is an absence of directly applicable knowledge, people
search for other knowledge that could help given potential inferences.
      </p>
      <p>
        Plausible knowledge can be expressed using a combination of symbolic graphs and associated
metadata. This paper introduces the plausible knowledge notation (PKN) as an easy-to-read
extensible syntax accompanied with an implementation as a JavaScript library for use in web
page demos for diferent kinds of plausible reasoning [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], and as part of work for the W3C
Cognitive AI Community Group [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. PKN supports a variety of diferent kinds of statements:
      </p>
      <sec id="sec-2-1">
        <title>Properties</title>
        <p>Relationships
f l o w e r s o f E n g l a n d i n c l u d e s d a f f o d i l s , r o s e s ( c e r t a i n t y h i g h )
where flowers is a property of the referent England, and the use of includes signifies that
the property is an open set with values daffodils and roses. For a closed set, use is instead
of includes. Trailing round brackets are used to list qualitative metadata, in this case declaring
that the statement has a high certainty.
r o b i n k i n d − o f s o n g b i r d
duck s i m i l a r − t o g o o s e f o r h a b i t a t
duck d i s s i m i l a r − t o g o o s e f o r neck − l e n g t h
where robin is declared as a subclass of songbird, and duck is declared as being similar to
goose for habitat and dissimilar to goose in respect to neck length.</p>
      </sec>
      <sec id="sec-2-2">
        <title>Dependencies</title>
        <p>c l i m a t e d e p e n d s −on l a t i t u d e
p r e s s u r e d e c r e a s e s − w i t h a l t i t u d e
c u r r e n t i n c r e a s e s − w i t h v o l t a g e
where climate depends on latitude in some unspecified way, whilst pressure decreases
with increasing latitude and current increases with increasing voltage.</p>
      </sec>
      <sec id="sec-2-3">
        <title>Implications</title>
        <p>t e m p e r a t u r e o f ? p l a c e i s warm &amp;
r a i n f a l l o f ? p l a c e i s h e a v y
i m p l i e s g r a i n o f ? p l a c e i n c l u d e s r i c e
Implications are a form of if-then rules where variables are prefixed with a question mark.</p>
        <p>Metadata can be given with all kinds of PKN statements. Relationships, dependencies and
implications can be used for inferences in both directions, subject to any associated metadata.
Following Collins, PKN supports several kinds of statement metadata relevant to diferent kinds
of inferences:
Typicality in respect to other group members, e.g., robins are typical song birds.
Similarity to peers, e.g., having a similar climate.</p>
        <p>Strength as conditional likelihood, e.g., the strength of climate for determining which kinds
of plants grow well. The forward and backward strengths may difer, e.g., rain is a strong
indicator of cloudy weather, whilst cloudy weather is a weak indicator of rain.
Frequency as the proportion of children with a given property, e.g., most species of birds have
the ability to fly.</p>
        <p>Dominance as the relative importance in a given group, e.g., the size of a country’s economy.
Multiplicity as the number of items in a given range, e.g., how many diferent kinds of flowers
grow in England.</p>
        <p>
          The web demonstrator [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] allows you to pick from an assortment of queries, and to then see
a trace of the reasoning, proceeding from the facts to the premise. The inference engine itself
works backwards from the premise to the facts, and the explanation is subsequently generated
from the trace of execution. Here is an example of the reasoning associated with the query
whether dafodils are grown in England:
P r e m i s e : f l o w e r s o f E n g l a n d i n c l u d e s d a f f o d i l s
E v i d e n c e s u p p o r t i n g t h e p r e m i s e :
f l o w e r s o f E n g l a n d i n c l u d e s t e m p e r a t e − f l o w e r s
and d a f f o d i l s k i n d − o f t e m p e r a t e − f l o w e r s
t h e r e f o r e f l o w e r s o f E n g l a n d i n c l u d e s d a f f o d i l s
f l o w e r s o f N e t h e r l a n d s i n c l u d e s d a f f o d i l s , t u l i p s
and N e t h e r l a n d s s i m i l a r − t o E n g l a n d f o r f l o w e r s
t h e r e f o r e f l o w e r s o f E n g l a n d i n c l u d e s d a f f o d i l s
S u g g e s t i n g : f l o w e r s o f E n g l a n d i n c l u d e s d a f f o d i l s i s l i k e l y
This develops two lines of argument in favour of the premise in the query. The first is based on
recognising that dafodils are a sub-class of temperate flowers, which are known to grow in
England. The second makes use of knowledge that England and the Netherlands are similar
in respect to the flowers grown. The inference engine uses a fixed strategy for searching
for and applying relevant inferences. This may involve the use of graph algorithms such as
spreading activation to propose and prioritise potential inferences as suggested by Collins. Other
algorithms are used to compute certainties of inferences based upon statement metadata, and
for assessing and combining multiple lines of argument. Future work will explore a wide range
of reasoning, including spatial, temporal, causal and social reasoning, along with metacognition
for problem solving, and support for System 1 and 2 cognition [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Analogical Reasoning</title>
      <p>What benefits are potentially possible for analogical reasoning by cognitive agents? A starting
point is to distinguish between literal and figurative analogies. The former involves things that
are really quite similar, whilst the latter are not obviously comparable at first glance. Analogies
can help agents to generalise their knowledge based upon a few examples. This has potential
applicability for the properties of things, understanding their behaviours, as well as for problem
solving by drawing upon previous experience in similar situations.</p>
      <p>
        Analogies are further related to similes and metaphors in language. Similes involve a
comparison that explicitly emphasises some comparable characteristic, e.g., “his words were like
a punch in the guts” as a way to establish the impact of the words on the listener, whilst
metaphors involve an implicit comparison, e.g., “to get cold feet” is to have second thoughts
about some proposed course of action. People commonly use similes and metaphors to
communicate thoughts in ways that are more vivid and interesting, as well as to structure perceptions
and understanding, see Lackof and Johnson [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. As such, this is expected to be an important
aspect of human-machine communication, albeit one that is very challenging, at least in the
near future.
      </p>
      <p>
        Dedre Gentner [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] notes that analogies may involve matching based upon structural or causal
similarities, and noticing interesting diferences, in essence, abstracting from similarities and
dissimilarities
      </p>
      <p>Gentner cites the example of plumbing in that electrical circuits can be likened to a plumbing
system for water, e.g., equating voltage to pressure, and electrical current to water flow. Causal
relationships for the source can be used to suggest similar relationships for the target, e.g.,
higher voltage leads to greater current just as higher water pressure leads to greater water flow.</p>
      <p>Two situations can be identified as similar if they share some of the same properties, with the
implication that you may be able to infer properties of the target from properties of the source.
You may also be able to infer relationships, e.g., part/whole or cause/efect. More generally, the
situations have diferent properties, that can however be mapped one to another (as in voltage
to pressure). Such mappings have to be learned or guessed from matching relationships. Thus,
if two situations/contexts have several properties or relationships in common, then we may
consider them as analogical equivalents.</p>
      <p>
        The notion of similarity introduced by Collins [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] supports inferences on shared property
values at least in some given context, see the similar-to and dissimilar-to statements in
PKN above. A generalisation is to relate pairs of diferent properties, e.g., voltage corresponds to
pressure, and current to flow when making an analogy between electrical circuits and plumbing.
Such pairings can be represented by adding a corresponds-to statement to PKN:
v o l t a g e c o r r e s p o n d s − t o p r e s s u r e f o r c i r c u i t
c u r r e n t c o r r e s p o n d s − t o f l o w f o r c i r c u i t
f l o w i n c r e a s e s − w i t h p r e s s u r e
# t h u s a l l o w i n g u s t o i n f e r
c u r r e n t i n c r e a s e s − w i t h v o l t a g e
We also need a way to describe that voltage and current are characteristics of electrical circuits,
which are a sub-class of circuits, e.g.
e l e c t r i c a l − c i r c u i t k i n d − o f c i r c u i t
v o l t a g e p r o p e r t y − o f e l e c t r i c a l − c i r c u i t
c u r r e n t p r o p e r t y − o f e l e c t r i c a l − c i r c u i t
      </p>
      <p>An open question is how people learn such knowledge from examples and being taught by
others. That relates to the notion of syntagmatic and paradigmatic learning. Syntagmatic
learning deals with learning co-occurrence patterns within episodes, whilst, paradigmatic learning
involves identifying generalisations, and is believed to develop at a later age in childhood.
Analogies as part of critical thinking. It is easy to find web sites that propose the use
of analogies for teaching purposes. These are based upon simple patterns, e.g., synonyms,
antonyms, part/whole, cause/efect, etc. Here are some examples:
b a t t e r y i s − t o t o r c h a s ? x i s − t o c a r # e n g i n e p o w e r s a c a r
i t c h i s − t o s c r a t c h a s ? x i s − t o c o l d # v i r u s c a u s e s a c o l d
w a l l i s − t o b r i c k a s b o t t l e i s − t o ? x # a b o t t l e i s made o f g l a s s
Solving such queries involves identifying the pattern, and then applying background knowledge.
The first step is to recognise the query as using an analogy. The next step is to use the pair
that doesn’t involve a variable to identify likely patterns, e.g., battery/torch in the first example.
The knowledge base may contain plenty of facts and relationships, and it will be important
to look for patterns that also occur for the pair with the variable. It may be the case that two
pairs use diferent relationships, in which case, we need to find plausible evidence that they are
comparable patterns.</p>
      <p>
        Simple analogies are amenable to a fixed strategy plus associated graph algorithms. Qualitative
metadata can be used to reason about certainty and to prioritise processing. What about more
complicated analogies? The work by Jaime Carbonell on derivational analogies [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] is inspiring.
The paper describes a problem solver that searches for analogies with previously solved problems,
adapting the solution as needed based upon an analysis comparing the old and new problems.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Cognitive Architecture</title>
      <p>
        The quest for realising human-like AI owes a huge debt to many pioneers over many decades.
To mention just a few: Daniel Kahneman, a Nobel-prize willing psychologist who studied
System 1 &amp; 2 thinking along with cognitive biases [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]; Philip Johnson-Laird, a cognitive scientist
renowned for his work on how humans reason in terms of mental models rather than logic
and statistics [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]; John R. Anderson, a cognitive scientist renowned for his work on the
ACTR cognitive architecture for sequential cognition [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]; and Alan Collins, a cognitive scientist
renowned for his work on plausible reasoning and intelligent tutoring systems [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>Figure 1 illustrates a high-level cognitive architecture inspired by the structure and function
of the human brain.</p>
      <p>Memory is based on graph databases and associated graph algorithms. It combines symbolic
graphs with sub-symbolic information, mimicking the human cortex, and defined at a
conceptual level above that of RDF and Property Graphs (including NGSI-LD). Recall
is stochastic reflecting prior knowledge and past experience. This involves activation
boost/decay, spreading activation, the forgetting curve and spacing efect.
Perception interprets sensory data at progressively higher levels of abstraction, and places the
resulting models into the cortex. Cognitive rules can set the context for perception, and
direct attention as needed. Events are signalled by queuing chunks to cognitive bufers to
trigger rules describing the appropriate behaviour. A prioritised first-in first-out queue is
used to avoid missing closely spaced events.</p>
      <p>System 1 is about intuitive/emotional thought, and prioritising what’s important. The limbic
system provides rapid automatic assessment of past, present and imagined situations
without the delays incurred in deliberative thought. Emotions are perceived as positive or
negative, and associated with passive or active responses, involving actual and perceived
threats, goal-directed drives and soothing/nurturing behaviours.</p>
      <p>System 2 is slower and more deliberate thought, involving sequential execution of rules to
carry out particular tasks, including the means to invoke graph algorithms in the cortex,
and to invoke operations involving other cognitive circuits. Thought can be expressed
at many diferent levels of abstraction, and is subject to control through metacognition,
emotional drives, internal and external threats.</p>
      <p>Action is about carrying out actions initiated under conscious control, leaving the mind free to
work on other things. An example is playing a musical instrument where muscle memory
is needed to control your finger placements as thinking explicitly about each finger would
be far too slow. The cerebellum provides real-time coordination of muscle activation
actively guided by perception.</p>
      <p>
        This architecture has been partially realised with a suite of web-based demos developed for the
W3C Cognitive AI Community Group [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. This includes the chunks and rules specification, and
an implementation as a JavaScript library. Chunks are essentially collections of name/value pairs,
where values are literals or references to other chunks, or lists thereof. Chunks are associated
with decaying activation levels to mimic the characteristics of human-memory. Chunk rules
support sequential reasoning (System 2).
      </p>
      <p>Further work is underway to incrementally realise the requirements identified by Kahneman
for System 1, and to understand how plausible reasoning, learning and metacognition can be
layered on top of System 1 and 2. This will include the intuitive and deliberative reasoning
involved in natural language processing, and the human ability to reason about the past, present,
and imagined situations.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>AI today can be broadly split into symbolic AI, statistical techniques, and approaches based
upon deep learning and multi-layer artificial neural networks. Work in the cognitive sciences
suggests a middle ground that combines symbols and sub-symbolic metadata, and is open to
distributed representations (e.g., as vectors in noisy high dimensional spaces) where this would
yield computational benefits. Traditional symbolic AI is hard to scale, relying on hand-coded
knowledge, along with dificulties in dealing with imperfect knowledge, whilst deep learning
scales well, but has challenges with reasoning and transparency. This paper draws attention
to the potential for mimicking human-like memory, reasoning and learning, inspired by the
wealth of research in the cognitive sciences.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kahneman</surname>
          </string-name>
          , Thinking, fast and slow, Macmillan,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Collins</surname>
          </string-name>
          , R. S. Michalski,
          <article-title>The logic of plausible reasoning: A core theory</article-title>
          ,
          <source>Cogn. Sci</source>
          .
          <volume>13</volume>
          (
          <year>1989</year>
          )
          <fpage>1</fpage>
          -
          <lpage>49</lpage>
          . URL: https://doi.org/10.1207/s15516709cog1301_1. doi:
          <volume>10</volume>
          .1207/ s15516709cog1301\_
          <fpage>1</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Raggett</surname>
          </string-name>
          ,
          <article-title>Plausible reasoning demo</article-title>
          ,
          <source>visited on July 24</source>
          ,
          <year>2022</year>
          . URL: https://www.w3.org/ Data/demos/chunks/reasoning/.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>W3C</given-names>
            <surname>Cognitive AI Community Group</surname>
          </string-name>
          ,
          <source>visited on July 24</source>
          ,
          <year>2022</year>
          . URL: https://github.com/ w3c/cogai#readme.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>G.</given-names>
            <surname>Lakof</surname>
          </string-name>
          , M. Johnson, Metaphors we live by, University of Chicago press,
          <year>1980</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Gentner</surname>
          </string-name>
          ,
          <article-title>Structure-mapping: A theoretical framework for analogy</article-title>
          ,
          <source>Cogn. Sci. 7</source>
          (
          <year>1983</year>
          )
          <fpage>155</fpage>
          -
          <lpage>170</lpage>
          . URL: https://doi.org/10.1207/s15516709cog0702_3. doi:
          <volume>10</volume>
          .1207/ s15516709cog0702\_
          <fpage>3</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>J. G</surname>
          </string-name>
          . Carbonell, M. Veloso,
          <article-title>Integrating derivational analogy into a general problem solving architecture</article-title>
          ,
          <source>in: Proceedings of the First Workshop on Case-Based Reasoning</source>
          , Morgan Kaufmann Tampa, FL,
          <year>1988</year>
          , pp.
          <fpage>104</fpage>
          -
          <lpage>124</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P.</given-names>
            <surname>Johnson-Laird</surname>
          </string-name>
          ,
          <article-title>How we reason</article-title>
          , Oxford University Press,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Anderson</surname>
          </string-name>
          ,
          <article-title>How can the human mind occur in the physical universe?</article-title>
          , Oxford University Press,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>