<!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>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Univ. Artois</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>CRIL / Institut Universitaire de France</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>France</string-name>
        </contrib>
      </contrib-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>1. Abstract
Dealing with high-risk or safety-critical applications calls for the development of trustworthy AI
systems. Beyond prediction, such systems must ofer a number of additional facilities, including
explanation and verification.</p>
      <p>The case when the prediction made is deemed wrong by an expert calls for still another
operation, called rectification. Rectifying a classifier aims to guarantee that the predictions
made by the classifier (once rectified) comply with the expert knowledge. Here, the expert is
supposed more reliable than the predictor, but their knowledge is typically incomplete.</p>
      <p>Focusing on Boolean classifiers, I will present rectification as a change operation. Following an
axiomatic approach, I will give some postulates that must be satisfied by rectification operators.
I will show that the family of rectification operators is disjoint from the family of revision
operators and from the family of update operators. I will also present a few results about the
computation of a rectification operation.</p>
    </sec>
  </body>
  <back>
    <ref-list />
  </back>
</article>