<!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>PWK Agent Belief Suspension in Argumentation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Massimiliano Carrara</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wei Zhu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>FISPPA Department, University of Padua</institution>
          ,
          <addr-line>Padua, 35126</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this article, we consider argumentation as an epistemic process used by an agent to improve beliefs and gain knowledge according to the information provided by the environment. While producing an argument an agent needs to revise her/his beliefs based on some new information. Such a process can generate a suspension in the argumentative process. There might be two kinds of suspensions of information flow: critical suspension and non-critical suspension. In this short paper, we distinguish these two kinds of suspensions and we sketch a formalization of them that consists in considering an expansion of AGM with Paraconsistent Weak Kleene Logic (PWK) - where the third value of PWK means of-topic .</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;AGM</kwd>
        <kwd>Paraconsistent Weak Kleene Logic</kwd>
        <kwd>Suspension</kwd>
        <kwd>Critical and Non-critical Error</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>and should be prevented and filtered. These two kinds of suspensions correspond to what in
the computation is taken as two kinds of errors: 1) critical errors and 2) non-critical errors.
A critical error globally stops the program, which means the error cannot be fixed in the
subsequent computational process. A non-critical error, instead, partially stops the computation
program, and the error can be fixed in the subsequent computational process. In this short paper,
we sketch a proposal that consists in considering an expansion of AGM with Paraconsistent
Weak Kleene Logic PWK, where the third value of PWK means of-topic . According to this
new interpretation, if a proposition obtains the third value u, it means the proposition is
oftopic. A PWK belief revision theory is sketched accordingly. Within our framework of PWK
belief revision theory, we characterize a non-critical suspension and a critical suspension and
distinguish one from the other.</p>
    </sec>
    <sec id="sec-2">
      <title>2. PWK and Of-topic</title>
      <p>
        In the field of many-valued logics, weak Kleene systems are a greatly underdeveloped subject
compared to their strong counterparts (on these systems see, for example, [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]). The language of
paraconsistent weak Kleene (PWK) is the standard Backus-Naur Form (BNF):
Φ  ∶∶=  ︀⋃ ¬ ⋃︀  ∨  ⋃︀  ∧  ⋃︀  ⊃  .
      </p>
      <p>Definition 2.1 (Valuation). A valuation  ∶ Φ  z→ {t, u, f } is induced by Table 1.
from the value of  (here, ⊛ is any connective defined in terms of
infection), as the value propagates from any  ∈
Φ  to any construction ⊛(, 
¬ ∨
, , , ).</p>
      <p>∧
The following is a straightforward and intuitive expression of contamination:
⊃
) independently
Fact 2.1 (Contamination). For all formulas  in  and any valuation  :</p>
      <p>( ) = u ⇔  () = u for some component  of</p>
      <p>It is interesting to observe that negation in PWK works like in strong Kleene, but conjunction
and disjunction in PWK work diferently from strong Kleene. In particular, the interpretation of
disjunction is not  and the interpretation of conjunction is not . The logical consequence
is defined as the preservation of non-false value:
Definition 2.2. Γ ⊧pwk ∆ if there is no valuation  such that:</p>
      <p>( ) ≠ f for all  ∈ Γ and  ( ) = f for all  ∈ ∆ .</p>
      <p>PWK is reflexive, transitive and monotonic. Although PWK has this last property in the sense
that if Γ ⊧pwk ∆ then Γ ∪ { } ⊧pwk ∆ , given the behaviour of conjunction in the premise side
PWK has a “non-monotonic flavour” in the sense that, for example,  ⊧pwk  but  ∧  ⊭pwk .
Observe that the inclusion of all the atoms of a premise set Γ in a conclusion set ∆ guarantees
that if Γ ⊧cl ∆ then Γ ⊧pwk ∆ . ⊧cl is the classical consequence relation.</p>
      <sec id="sec-2-1">
        <title>2.1. Of-topic Interpretation and Computational Errors</title>
        <p>
          Recently, the third value u—initially understood as nonsense, meaninglessness or undefined —has
been been studied in more depth. A new proposal by [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] suggests reading it as of-topic . Thus,
a proposition that obtains the third value should be regarded as being of-topic . Through this
new interpretation, we can consider a correspondence between the computational errors and
suspension [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. In a computational program, there are two kinds of computational errors:
1) critical error and 2) non-critical error: a critical error stops the program in a global way,
which means the error cannot be fixed in the subsequent computational process; a non-critical
error partially stops the computation program, and the error can be fixed in the subsequent
computational process. In the next section, we propose a framework of PWK belief revision
theory, in which a non-critical error corresponds to a non-critical suspension and that a critical
error corresponds to a critical suspension.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. A PWK belief revision theory</title>
      <p>3.1. Topic
We consider a PWK belief revision theory as an expansion of the AGM belief revision theory.
In the AGM paradigm, an agent’s belief state is formalized as a belief set Θ = (Θ ) in which
 is a consequence operation.</p>
      <p>As for a certain proposition, an AGM agent might believe it, disbelieve it, or keep it in
suspension. Three basic kinds of operators model the belief changes of an agent: – expansion
+ , contraction − , and revision ∗ . Suppose that Θ is a belief set and  is a
proposition. Belief expansion Θ +  means the agent expands her beliefs with a new
proposition  ; belief contraction Θ −  means the agent has to contract  from her beliefs
in a way that  will not be derived again after the contraction; belief revision Θ ∗  means
the agent has to accommodate  into Θ in a way that a possible contradiction brought by  can
be removed at the lowest cost.</p>
      <p>A PWK agent’s belief state – diferently from the AGM belief set – concerns a topic, which
corresponds to a set of propositions as answers to a question provoked by certain argumentation.
For example, for a question “How many stars are there?” the topic set can be {“No stars are
there.”, “One star is there.”, “Two stars are there.”, “One star is there or two stars is there.”. . . }.
Whether a proposition  is on-topic or of-topic also depends on whether  contains an of-topic
component atomic proposition: this is due to the contamination feature of PWK. Taken the
same example above, an argumentation process concerning the number of stars would regard
an argument such as “There are five empty seats in the library” as being of-topic.</p>
      <sec id="sec-3-1">
        <title>3.2. PWK Belief State</title>
        <p>A PWK agent’s epistemic attitude toward a given proposition  from the environment depends
on whether  is on-topic or of-topic. If  is on-topic, the agent would believe, disbelieve it or
keep it in non-critical suspension. If  is of-topic, the agent would keep it in critical suspension.
Non-critical suspension and critical suspension are two exclusive attitudes:
1) If  is in non-critical suspension,  is still available to be believed or disbelieved by the agent
later. Therefore, an on-topic sentence  can be released from non-critical suspension. We
still consider this kind of suspension an error because it might be problematic at the moment
when the agent has to decide about the epistemic status of  . In this case, the non-critical
suspension of  also suspends the agent from doing something else. The agent may collect
more information or require more reliable information sources to release  from non-critical
suspension. Computationally speaking, it is a non-critical error.
2) If  is of-topic, then  should be isolated from the current belief change process and be
kept in critical suspension.  ’s being of-topic could be the result of erroneous information,
which reflects some aspects of the environment. Computationally speaking, it is a critical
error.</p>
        <p>Definition 3.1 (PWK Belief State). A PWK agent’s belief state is &lt; Θ , ∆ , Σ &gt;. Θ , ∆ and Σ are
all sets of PWK propositions, i.e. Θ , ∆ , Σ ⊆ Φ :
Θ is a belief set if Θ = (Θ ) ∖ { ∈ Φ  ⋃︀  is of-topic };
∆ is a non-critical suspension set if ∆ = ∆</p>
        <p>⋃{¬ ⋃︀  ∈ ∆ }, for any  ∈ ∆ ,  is on-topic;
Σ is a critical suspension set if for any  ∈ Σ ,  is of-topic;
Θ ⋂ ∆ = Θ ⋂ Σ = ∆ ⋂ Σ = ∅, Θ ⋃ ∆ ⋃ Σ ⊆ Φ .</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.3. Three Belief State Change Operators</title>
        <p>Definition 3.2 (PWK Belief State Change ∮ ). We denote three PWK belief state change
operators, expansion, contraction and revision, as ∮ . ∮ takes a PWK belief state &lt; Θ , ∆ , Σ &gt; and a
propositional input  as two variables. It can be defined from
, Φ  &gt; to &lt; P(Φ ), P(Φ ), P(Φ ) &gt;:
&lt;&lt; P(Φ ), P(Φ ), P(Φ ) &gt;
∮ (&lt; Θ , ∆ , Σ &gt;, ) = ⌋︀
︀)
︀⌉︀⌉ ∲ (&lt; Θ , ∆ , Σ &gt;, )
︀⌉︀] ∳ (&lt; Θ , ∆ , Σ &gt;, )
︀⌉
if  is on-topic,
if  is of-topic.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.4. Specific Operators</title>
        <p>In this subsection, we propose a concrete model for PWK belief change operators to show how
these ideas work and how AGM operators could also be preserved within the framework.
Definition 3.3 (PWK Plain Expansion
+, Contraction
−, Revision
∗). The expansion,
contraction and revision of a belief state &lt; Θ , ∆ , Σ &gt; with respect to a new proposition  can be seen as
operators defined from
&lt;&lt; P(Φ ), P(Φ ), P(Φ ) &gt;, Φ  &gt; to &lt; P(Φ ), P(Φ ), P(Φ ) &gt;:
∮
∮
∮
∮</p>
        <p>+
−
∗
∮
∮
∲</p>
        <p>(&lt; Θ , ∆ , Σ &gt;, ) = ⌋︀
(&lt; Θ , ∆ , Σ &gt;, ) = ⌋︀
(&lt; Θ , ∆ , Σ &gt;, ) = ⌋︀
︀]
︀⌉︀⌉︀) &lt; Θ + , ∆ , Σ &gt;
︀⌉︀⌉ &lt; Θ , ∆ , Σ ∪ {} &gt;
︀)
︀⌉︀⌉ &lt;&lt; Θ , ∆ &gt; − , Σ &gt;</p>
        <p>Θ , ∆ , Σ &gt;
︀]
︀⌉︀⌉ &lt;
︀]
︀⌉︀⌉ &lt;
︀)
︀⌉︀⌉ &lt;&lt; Θ , ∆ &gt; ∗ , Σ &gt;
Θ , ∆ , Σ ∪ {} &gt;
if  is on-topic,
if  is of-topic.</p>
        <p>if  is on-topic,
if  is of-topic.
if  is on-topic,
if  is of-topic.
∲
+,</p>
        <p>∲
agent’s mind.</p>
        <p>−, and</p>
        <p>∗ to deal with the belief change concerning an on-topic input.</p>
        <p>Three AGM operators, + , − and ∗ have been embedded into sub-operators
are independent from them. They collect and preserve the of-topic inputs. In this way, we
can show how the on-topic part of a belief state changes concerning an on-topic proposition;
at least, we can see clearly that the PWK belief change is not merely expansion. The above
definitions of belief state change operators also show the insulation feature of a PWK epistemic
∳
+,
∳
−, and
∳
∗
Theorem 3.4. AGM postulates agree with a PWK belief change framework.
based on {∮</p>
        <p>∮
+, −, ∗ .</p>
        <p>∮ }
Proof. According to the definition 3.3, AGM operators are adopted to deal with the on-topic
part of PWK belief change. + , − , and ∗ are embedded into {∲
+,
∲
−,
∲
long as AGM operators follow AGM postulates, {∲
+,
∲
−, ∗
∲ } do as well. Therefore, AGM
postulates, which regulate {∲
+, −, ∲ ∗}, also support this PWK belief change framework
∲
∗}. As</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Concluding Remarks</title>
      <p>In this article we briefly sketch the basic elements of a PWK belief revision theory, a theory
which can accommodate two kinds of agent belief suspensions, a distinction useful in an
argumentation process.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Modgil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Prakken</surname>
          </string-name>
          ,
          <article-title>A general account of argumentation with preferences</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>195</volume>
          (
          <year>2013</year>
          )
          <fpage>361</fpage>
          -
          <lpage>397</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T. J.</given-names>
            <surname>Bench-Capon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. E.</given-names>
            <surname>Dunne</surname>
          </string-name>
          , Argumentation in artificial intelligence,
          <source>Artificial intelligence 171</source>
          (
          <fpage>10</fpage>
          -
          <lpage>15</lpage>
          ) (
          <year>2007</year>
          )
          <fpage>619</fpage>
          -
          <lpage>641</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>M. D'Agostino</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Modgil</surname>
          </string-name>
          ,
          <article-title>Classical logic, argument and dialectic</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>262</volume>
          (
          <year>2018</year>
          )
          <fpage>15</fpage>
          -
          <lpage>51</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.artint.
          <year>2018</year>
          .
          <volume>05</volume>
          .003.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Falappa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Kern-Isberner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. R.</given-names>
            <surname>Simari</surname>
          </string-name>
          ,
          <article-title>Explanations, belief revision and defeasible reasoning</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>141</volume>
          (
          <issue>1-2</issue>
          ) (
          <year>2002</year>
          )
          <fpage>1</fpage>
          -
          <lpage>28</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>N. D.</given-names>
            <surname>Rotstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. O.</given-names>
            <surname>Moguillansky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Falappa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. J.</given-names>
            <surname>García</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. R.</given-names>
            <surname>Simari</surname>
          </string-name>
          ,
          <article-title>Argument theory change: Revision upon warrant</article-title>
          ,
          <source>COMMA</source>
          <volume>172</volume>
          (
          <year>2008</year>
          )
          <fpage>336</fpage>
          -
          <lpage>347</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Baumann</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Brewka, AGM meets abstract argumentation: Expansion and revision for dung frameworks</article-title>
          ,
          <source>in: Twenty-Fourth International Joint Conference on Artificial Intelligence</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Carrara</surname>
          </string-name>
          , W. Zhu,
          <article-title>Computational errors and suspension in a pwk epistemic agent</article-title>
          ,
          <source>Journal of Logic and Computation</source>
          (09
          <year>2021</year>
          ). doi:
          <volume>10</volume>
          .1093/logcom/exab052.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>C. E.</given-names>
            <surname>Alchourrón</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Gärdenfors</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Makinson</surname>
          </string-name>
          ,
          <article-title>On the logic of theory change: Partial meet contraction and revision functions</article-title>
          ,
          <source>Journal of Symbolic Logic</source>
          <volume>50</volume>
          (
          <issue>2</issue>
          ) (
          <year>1985</year>
          )
          <fpage>510</fpage>
          -
          <lpage>530</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Bochvar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bergmann</surname>
          </string-name>
          ,
          <article-title>On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus, History and Philosophy of Logic 2 (1-2</article-title>
          ) (
          <year>1981</year>
          )
          <fpage>87</fpage>
          -
          <lpage>112</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Beall</surname>
          </string-name>
          ,
          <article-title>Of-topic: A new interpretation of weak-kleene logic</article-title>
          ,
          <source>The Australasian Journal of Logic</source>
          <volume>13</volume>
          (
          <issue>6</issue>
          ) (
          <year>2016</year>
          )
          <fpage>136</fpage>
          -
          <lpage>142</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>