<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-005-07-0418</article-id>
      <article-id pub-id-type="publisher-id">27571</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>I.2.3 - Deduction and Theorem Proving</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Probabilistic Reasoning as Information Compression by Multiple Alignment, Unification and Search: An Introduction and Overview</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Wolff</surname>
            <given-names>J. Gerard</given-names>
          </name>
          <email xlink:type="simple">gerry@sees.bangor.ac.uk</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">University of Wales, Bangor, United Kingdom</addr-line>
        <institution>University of Wales</institution>
        <addr-line content-type="city">Bangor</addr-line>
        <country>United Kingdom</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: J. Gerard Wolff (<email xlink:type="simple">gerry@sees.bangor.ac.uk</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>1999</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>07</month>
        <year>1999</year>
      </pub-date>
      <volume>5</volume>
      <issue>7</issue>
      <fpage>418</fpage>
      <lpage>462</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/0CF9281B-E77E-535D-B219-65A6A5343707">0CF9281B-E77E-535D-B219-65A6A5343707</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/6995688">6995688</uri>
      <permissions>
        <copyright-statement>J. Gerard Wolff</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>This article introduces the idea that probabilistic reasoning (PR) may be understood as information compression by multiple alignment, unification and search (ICMAUS). In this context, multiple alignment has a meaning which is similar to but distinct from its meaning in bio-informatics, while unification means a simple merging of matching patterns, a meaning which is related to but simpler than the meaning of that term in logic.  A software model, SP61, has been developed for the discovery and formation of "good" multiple alignments, evaluated in terms of information compression. The model is described in outline.  Using examples from the SP61 model, this article describes in outline how the ICMAUS framework can model various kinds of PR including: PR in best-match pattern recognition and information retrieval, one-step "deductive" and "abductive" PR, inheritance of attributes in a class hierarchy, chains of reasoning (probabilistic decision networks and decision trees, and PR with "rules" ), geometric analogy problems, nonmonotonic reasoning and reasoning with default values, modelling the function of a Bayesian network.</p>
      </abstract>
    </article-meta>
  </front>
</article>
