This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

11institutetext: School of Information Science
Japan Advanced Institute of Science and Technology

Static Knowledge vs. Dynamic Argumentation
A Dual Theory Based on Kripke Semantics

Xinyu Wang    Momoka Fujieda
Abstract

This paper establishes a dual theory about knowledge and argumentation. Our idea is rooted at both epistemic logic and argumentation theory, and we aim to merge these two fields, not just in a superficial way but to thoroughly disclose the intrinsic relevance between knowledge and argumentation. Specifically, we define epistemic Kripke models and argument Kripke models as a dual pair, and then work out a two-way generation method between these two types of Kripke models. Such generation is rigorously justified by a duality theorem on modal formulae’s invariance. We also provide realistic examples to demonstrate our generation, through which our framework’s practical utility gets strongly advocated. We finally propose a philosophical thesis that knowledge is essentially dynamic, and we draw certain connection to Maxwell’s demon as well as the well-known proverb “knowledge is power”.

Keywords:
epistemic logic argumentation theory Kripke model ultrafilter Maxwell’s demon

1 Introduction

As we learn from Newtonian mechanics, motion is relative rather than absolute [15], and quantum mechanics further tells us about wave-particle duality [22]. Nature proves to be highly symmetric and unified. In epistemic logic, agents’ instantaneous knowledge is statically represented via current possible worlds [7], viz. implicitly through the equivalence class of all the indistinguishable worlds at this moment. Whereas in argumentation theory, the first-class citizens are chronological arguments that are dynamically articulated by different agents so as to attack each other [8], explicitly composing a sequential history of a tit-for-tat debate during a period of time.

Following some pioneering attempts to describe argumentation theory with modal logic [11, 12], a number of recent studies continue to explore assorted means of combining these two dimensions, namely agents’ knowledge and argumentation, into one compound Kripke-like model [21, 5, 19]. Nevertheless as far as we can see, those cursory treatments mostly scratch the surface, for under their settings generally speaking, knowledge and argumentation ipso facto reside within two distinct strata of the model which are evaluated in completely separate ways, and so they are totally free to vary independently without any innate relevance. Such kind of ad hoc solution fails to fully conform to our intuition. Actually just from everyday common sense, we can assuredly comprehend that on the one hand, someone (supposedly honest) argues for something, most simply because he knows/believes what he argues for is true; on the other hand even more noticeably, we always infer others’ knowledge/belief based on their arguments and actions, i.e. what they have said and done — essentially speaking, it is exactly the only way through which we may learn about others’ knowledge. After all, in order to find out what others really know, it would help very little even if we were allowed to biologically dissect others’ brains and examine their nerve cells! Therefore of all things, knowledge and argumentation are fundamentally intertwined.

In this paper, we propose a dual theory which simultaneously deals with both static knowledge and dynamic argumentation, from an intrinsic perspective that exquisitely unveils the close mutual interference between these two concepts. Specifically speaking, we shall define two different types of Kripke models, one for epistemic whilst another for argument, and then we shall demonstrate the two-way transformation between the two types. This is to say literally, given some epistemic-type Kripke model, we are able to compute out its corresponding argument-type Kripke model, and vice versa, the epistemic-type Kripke model can be generated from the argument-type Kripke model as well. In order to justify our framework, not only shall we elaborate on the philosophical intuition behind our definitions, but we shall also rigidly prove a duality theorem so that readers will get positively convinced of our approach’s plausibility. Our novel disposal of the relationship between knowledge and argumentation incisively sheds light on both philosophical depth and mathematical complicacy, furthermore, many particular aspects of our method’s superiority will be vividly exhibited as we leisurely walk through pragmatic examples of our logic’s application. At last we shall briefly discuss a few possible expansions and some other relevant topics.

The rest of this paper is organized as follows. Section 2 defines preliminaries of our framework, in particular two types of Kripke models, namely the epistemic one and the argument one. Section 3 illustrates how we can generate the corresponding argument Kripke model given the current epistemic Kripke model. Section 4 subsequently establishes the reverse generation, i.e. from the current argument Kripke model to its corresponding epistemic Kripke model. Since this latter direction of generation may look a bit more complex, in the next Section 5 we at length analyze a truly practical example of a virtual debate between two candidates for the mayor, which significantly affirms our logic’s affluent utility in the real world. Section 6 then is devoted to technical issues and ends up with a duality theorem on the two-way generation between two types of Kripke models, hence formally justifying our dual definition. Section 7 further discusses several relevant expansions and applications of our framework, especially invoking the famous thought experiment of Maxwell’s demon so as to aver that knowledge is a dynamic notion in essence. Section 8 finally concludes this paper and suggests possible directions of future work.

2 Preliminaries

Fix a nonempty set of propositions PP and a nonempty set of agents II.

Definition 1 (Language)

There are two types of well formed formulae: an epistemic formula φ\varphi and an argument formula ξ\xi. Respectively, we define them by the following Backus–Naur forms, where pPp\in P, iIi\in I:

φ::=p¬φ(φφ)𝒦iφ\displaystyle\varphi::=p\mid\neg\varphi\mid(\varphi\land\varphi)\mid\mathcal{K}_{i}\varphi ξ::=i¬ξ(ξξ)𝒜pξ\displaystyle\xi::=i\mid\neg\xi\mid(\xi\land\xi)\mid\mathcal{A}_{p}\xi
Remark 1

Readers may immediately notice the obvious duality between the two Backus–Naur forms in Definition 1. Indeed, as this paper aims at proposing a dual theory based on Kripke semantics, it is hardly a surprise that pairs of epistemic notions and argument notions will appear in parallel throughout the whole paper. Moreover, such symmetry also functions as a signpost to help readers smoothly navigate this paper.

The intuitive readings for epistemic formulae are just as usual, e.g., epistemic formula 𝒦iφ\mathcal{K}_{i}\varphi means “at the current world, agent ii knows φ\varphi”. For argument formulae, intuitively, argument formula ii means “the current argument is available to agent ii”, and argument formula 𝒜pξ\mathcal{A}_{p}\xi means “all the arguments that attack the current argument with respect to proposition pp satisfy ξ\xi”. Why we stipulate these intuitive readings for argument formulae will gradually become clear to readers as we continue unfolding our entire framework, but for now, if readers cannot help feeling somehow uneasy about our argument formulae or wondering whether they are really useful at all, then readers are strongly advised to take a quick look at the later Subsection 7.1, where we concisely yet convincingly provide further elaboration on our dual syntax, for example what argument formula 𝒜p¬i\mathcal{A}_{p}\neg i intuitively means, and also mention some possible syntactic expansions.

Anyway, the syntactic respect being as such, on the other side, the semantic respect also turns out to be quite standard Kripke models:

Definition 2 (Epistemic Kripke Model)

An epistemic Kripke model is a tuple 𝔐=(S,E,F)\mathfrak{M}=(S,E,F) where:

  • SS is a nonempty set of possible worlds.

  • E:I𝒫(S×S)E:I\to\mathcal{P}(S\times S) is a function that assigns an equivalence epistemic relation E(i)S×SE(i)\subseteq S\times S to each agent iIi\in I.

  • F:P𝒫(S)F:P\to\mathcal{P}(S) is a valuation function.

Definition 3 (Argument Kripke Model)

An argument Kripke model is a tuple 𝔑=(𝕎,A,G)\mathfrak{N}=(\mathbb{W},A,G) where:

  • 𝕎\mathbb{W} is a nonempty set of possible arguments.

  • A:P𝒫(𝕎×𝕎)A:P\to\mathcal{P}(\mathbb{W}\times\mathbb{W}) is a function that assigns an irreflexive attack relation A(p)𝕎×𝕎A(p)\subseteq\mathbb{W}\times\mathbb{W} to each proposition pPp\in P.

  • G:I𝒫(𝕎)G:I\to\mathcal{P}(\mathbb{W}) is an availability function.

Remark 2

In accordance to common practice of epistemic logic, Definition 2 requires E(i)E(i) to be an equivalence relation, i.e., epistemic Kripke models are S5. But what restrictions should argument Kripke models conform to? We speculate that at least, any argument must not attack itself, and therefore Definition 3 requires relation A(p)A(p) to be irreflexive.

An argument Kripke model in Definition 3 is intuitively interpreted as the following:

  • For any U,V𝕎U,V\in\mathbb{W} and pPp\in P, (U,V)A(p)(U,V)\in A(p) means “argument VV attacks argument UU with respect to proposition pp”. Warning: (U,V)A(p)(U,V)\in A(p) means “VV attacks UU”, notUU attacks VV”.

  • For any U𝕎U\in\mathbb{W} and iIi\in I, UG(i)U\in G(i) means “argument UU is available for agent ii to utter out”. As we see, 𝕎\mathbb{W} includes all epistemically possible arguments, such as “it must be over 7am now, since it is so bright outside” and “it must be before 7am now, since there are few people on the street”. Nonetheless, for any rational agent ii at certain fixed world, apparently both arguments cannot be practically accessible to him at the same time, otherwise it would imply absurdity. Therefore, the subset G(i)𝕎G(i)\subseteq\mathbb{W} denotes all the arguments currently available to agent ii.

Remark 3

Here we would like to emphasize once again, as our above “Warning” asserts, (U,V)A(p)(U,V)\in A(p) intuitively means “VV attacks UU” rather than “UU attacks VV”. So why do we adopt such a “reverse” definition? Certainly, the whole argument model as a graph structure would just carry the very same information even if we had defined it in the opposite way, however as a Kripke model, the direction of the binary attack relation A(p)A(p) matters really huge [3]. Therefore to tell the truth, it should just be our chosen direction rather than the reverse that can comply well with other parts of this paper. All the relevant mathematical details will formally manifest such a fact along with our paper’s progressing.

Definition 4 (Semantics)

For epistemic formulae, given an epistemic Kripke model 𝔐=(S,E,F)\mathfrak{M}=(S,E,F) and a possible world sSs\in S:

𝔐,sp\displaystyle\mathfrak{M},s\vDash p\iff sF(p)\displaystyle s\in F(p)
𝔐,s¬φ\displaystyle\mathfrak{M},s\vDash\neg\varphi\iff not 𝔐,sφ\displaystyle\text{\rm{not }}\mathfrak{M},s\vDash\varphi
𝔐,sφψ\displaystyle\mathfrak{M},s\vDash\varphi\land\psi\iff 𝔐,sφ and 𝔐,sψ\displaystyle\mathfrak{M},s\vDash\varphi\text{\rm{ and }}\mathfrak{M},s\vDash\psi
𝔐,s𝒦iφ\displaystyle\mathfrak{M},s\vDash\mathcal{K}_{i}\varphi\iff for all tS such that (s,t)E(i),𝔐,tφ\displaystyle\text{\rm{for all }}t\in S\text{\rm{ such that }}(s,t)\in E(i),\mathfrak{M},t\vDash\varphi

For argument formulae, given an argument Kripke model 𝔑=(𝕎,A,G)\mathfrak{N}=(\mathbb{W},A,G) and a possible argument U𝕎U\in\mathbb{W}:

𝔑,Ui\displaystyle\mathfrak{N},U\vDash i\iff UG(i)\displaystyle U\in G(i)
𝔑,U¬ξ\displaystyle\mathfrak{N},U\vDash\neg\xi\iff not 𝔑,Uξ\displaystyle\text{\rm{not }}\mathfrak{N},U\vDash\xi
𝔑,Uξζ\displaystyle\mathfrak{N},U\vDash\xi\land\zeta\iff 𝔑,Uξ and 𝔑,Uζ\displaystyle\mathfrak{N},U\vDash\xi\text{\rm{ and }}\mathfrak{N},U\vDash\zeta
𝔑,U𝒜pξ\displaystyle\mathfrak{N},U\vDash\mathcal{A}_{p}\xi\iff for all V𝕎 such that (U,V)A(p),𝔑,Vξ\displaystyle\text{\rm{for all }}V\in\mathbb{W}\text{\rm{ such that }}(U,V)\in A(p),\mathfrak{N},V\vDash\xi

Semantics in Definition 4 is just routine, based on which readers can easily verify that our intuitive readings for both epistemic and argument formulae are indeed appropriate.

Next, in the following Sections 3 and 4, we are going to rigorously define a two-way generation between these dual types of Kripke models, which constitutes the backbone of this paper.

3 From Knowledge to Argumentation

Our first task is to generate an argument Kripke model 𝔑g\mathfrak{N}_{g}, given an epistemic Kripke model 𝔐=(S,E,F)\mathfrak{M}=(S,E,F) and the current world sSs\in S. Thus more precisely, 𝔑g\mathfrak{N}_{g} depends both on 𝔐\mathfrak{M} and on ss and may be more explicitly denoted as 𝔑g(𝔐,s)\mathfrak{N}_{g}(\mathfrak{M},s) or 𝔑g(s)\mathfrak{N}_{g}(s), but we shall anyway denote simply as 𝔑g\mathfrak{N}_{g} as long as 𝔐\mathfrak{M} and ss are clear from the context without any possible confusion.

Now that we are provided with all the epistemically possible worlds, what are possible arguments then? In fact ontologically, an argument advocates an opinion about the world, asserting what the world is like or what the world is not like, such as “the earth is getting warmer and warmer” or “unicorn does not exist”. Therefore technically speaking, an argument is essentially a nonempty subset of possible worlds, claiming that our current world lies within this subset. Of course, an empty set stands for a self-contradictory argument, and we can safely ignore such a case under our innocent assumption that all agents are rational.

If arguments are subsets of possible worlds, then how about attack relations between arguments? In fact with respect to any proposition pp, an argument (i.e., a nonempty subset of possible worlds) must hold one out of three distinct types of attitudes:

  1. 1.

    The argument asserts pp, i.e., all the possible worlds in the subset satisfy pp.

  2. 2.

    The argument asserts ¬p\neg p, i.e., all the possible worlds in the subset falsify pp.

  3. 3.

    The argument does not tell whether pp, i.e., some possible worlds in the subset satisfy pp while the others falsify pp.

Hence, several different versions of attack relations might look plausible:

  1. (i)

    Weak attack relation: only case 1 and case 2 attack each other.

  2. (ii)

    Medium attack relation: case 1 and case 2 attack each other, and both of them attack case 3.

  3. (iii)

    Strong attack relation: any two different cases attack each other.

While all the above versions of attack relations may be quite reasonable by one way or another, in this paper, we choose to stick to the medium attack relation. Our intuition is such: different arguments possess different strength. Some arguments are stronger while others are weaker, and generally speaking, stronger arguments attack weaker arguments. The universal set SS itself is a trivial argument, as it just says that every possible world is possible and thus essentially argues nothing at all, therefore, it must be one of the weakest arguments and is supposed to be attacked by many other stronger arguments. Assume that with respect to some proposition pp, the trivial argument SS is case 3, (which indeed seems most likely to be,) then we expect it to be attacked by arguments of case 1 and case 2, but not vice versa. The above explanation accounts for our preference for the medium attack relation. Besides, only the medium attack relation is not necessarily symmetric, a crucial feature which undoubtedly makes the medium attack relation both more philosophically profound and more technically interesting.

By the way, we also point out in the later Subsection 7.2 that Dung’s classic argument framework [8] is probably closer to the weak attack relation. Nevertheless for our project here, the weak attack relation looks pitifully too weak: case 3 is just radically ruled out of the game so that much information about the original epistemic Kripke model will get lost.

Finally, we also have to figure out the last part in the generated argument Kripke model 𝔑g=(𝕎,A,G)\mathfrak{N}_{g}=(\mathbb{W},A,G), namely about the availability function GG. Here we simply assume every agent is rational and honest, so that his available arguments should not exceed his own knowledge, that is to say, an argument (i.e., a nonempty subset of possible worlds USU\subseteq S) is available to an agent iIi\in I if and only if UU is a superset of ii’s current epistemic equivalence class. Putting all the above discussion together, we obtain the following Definition 5:

Definition 5 (Generated Argument Kripke Model)

Given an epistemic Kripke model 𝔐=(S,E,F)\mathfrak{M}=(S,E,F) with a possible world sSs\in S, the generated argument Kripke model is 𝔑g=(𝕎,A,G)\mathfrak{N}_{g}=(\mathbb{W},A,G), where:

  • 𝕎=𝒫(S)\mathbb{W}=\mathcal{P}(S)\setminus\emptyset.

  • For any pPp\in P and any U,V𝕎U,V\in\mathbb{W}, (U,V)A(p)(U,V)\in A(p) iff tUrV\exists t\in U\forall r\in V, (tF(p)rF(p))(tF(p)rF(p))(t\in F(p)\land r\notin F(p))\lor(t\notin F(p)\land r\in F(p)).

  • For any iIi\in I, G(i)={U𝕎tS,(s,t)E(i)tU}G(i)=\{U\in\mathbb{W}\mid\forall t\in S,(s,t)\in E(i)\to t\in U\}.

It is easy to see that 𝕎\mathbb{W}\neq\emptyset and that A(p)A(p) is irreflexive, thus 𝔑g\mathfrak{N}_{g} in Definition 5 is indeed a well-defined argument Kripke model. In order to vividly demonstrate this generating process, we provide a simple example below:

Example 1

Suppose there are two different propositions p,qPp,q\in P and two different agents a,bIa,b\in I.

The original epistemic Kripke model is given as the following 𝔐\mathfrak{M} with three possible worlds S={s1,s2,s3}S=\{s_{1},s_{2},s_{3}\}, where any proposition not shown at a possible world is falsified there by default. The present world is s2s_{2}, therefore both pp and qq actually hold, but agent aa only knows the former fact and agent bb the latter.

𝔐\textstyle{\mathfrak{M}}s1:p\textstyle{s_{1}:p\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}E(a),E(b)\scriptstyle{E(a),E(b)}E(a)\scriptstyle{E(a)}s2:p,q\textstyle{s_{2}:p,q\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}E(a),E(b)\scriptstyle{E(a),E(b)}s3:q\textstyle{s_{3}:q\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}E(a),E(b)\scriptstyle{E(a),E(b)}E(b)\scriptstyle{E(b)}{s1,s2,s3}:a,b\textstyle{\{s_{1},s_{2},s_{3}\}:a,b\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}A(p)\scriptstyle{A(p)}A(q)\scriptstyle{A(q)}𝔑g (in part)\textstyle{\mathfrak{N}_{g}\text{ (in part)}}{s1,s2}:a\textstyle{\{s_{1},s_{2}\}:a\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}A(q)\scriptstyle{A(q)}{s1,s3}\textstyle{\{s_{1},s_{3}\}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}A(p)\scriptstyle{A(p)}A(q)\scriptstyle{A(q)}{s2,s3}:b\textstyle{\{s_{2},s_{3}\}:b\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}A(p)\scriptstyle{A(p)}{s1}\textstyle{\{s_{1}\}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}A(q)\scriptstyle{A(q)}A(p),A(q)\scriptstyle{A(p),A(q)}{s2}\textstyle{\{s_{2}\}}{s3}\textstyle{\{s_{3}\}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}A(p)\scriptstyle{A(p)}

We can then compute out the generated argument Kripke model as the above 𝔑g\mathfrak{N}_{g}, where there are seven possible arguments in total as the seven nonempty subsets of SS, however in fact, just a part of 𝔑g\mathfrak{N}_{g} is shown for the sake of neatness. Specifically speaking, any attack relations between the upper four arguments and the lower three are omitted, but anyway readers can easily complete the whole 𝔑g\mathfrak{N}_{g} if needed. An argument is available to agent aa or bb only if it gets explicitly marked out in the above partial diagram of 𝔑g\mathfrak{N}_{g}, and thus we can perceive that an (honest and rational) agent is only able to argue for some superset of his current epistemic equivalence class of possible worlds.

From the generated argument Kripke model 𝔑g\mathfrak{N}_{g}, we can also easily see that the possible argument {s1,s2}\{s_{1},s_{2}\} is available to agent aa and has the power to attack many other arguments with respect to proposition pp, exactly because agent aa knows pp in the original epistemic Kripke model 𝔐\mathfrak{M} at the current possible world s2s_{2}, and vise versa for the possible argument {s2,s3}\{s_{2},s_{3}\}, agent bb and proposition qq. Ergo scientia est potentia. In sum, the anticipated interaction between knowledge and argumentation indeed coincides with our intuition pretty well.

4 From Argumentation to Knowledge

Our second task is to generate an epistemic Kripke model 𝔐g\mathfrak{M}_{g}. In parallel with Definition 5 in Section 3, here our start point should be an argument Kripke model 𝔑=(𝕎,A,G)\mathfrak{N}=(\mathbb{W},A,G) together with the current argument U𝕎U\in\mathbb{W}. But what does the “current” argument mean? We understand it as the last argument in a realistic argumentation process consisting of a chronological series of successive arguments, which is also ordinarily regarded as “the currently winning argument”, exactly like Dung points out in [8]:

The way humans argue is based on a very simple principle which is summarized succinctly by an old saying: “The one who has the last word laughs best”.

So suppose we are now provided with an argument Kripke model and the current argument, what on earth should be all the epistemically possible worlds? It could look like a merely impossible mission at the very first glance. Nevertheless, considering how we manage to derive argumentation from knowledge in Section 3, conceptually speaking, if our knowledge determines our argumentation, then our argumentation must also reflect our knowledge the other way round. Also from everyday experience, it is actually quite common and natural for us to infer others’ epistemic states based on their utterances, namely, arguments. Therefore, just as nonempty subsets of possible worlds can represent possible arguments, let us in turn try to seek what kinds of subsets of possible arguments can represent possible worlds.

As it is assumed that all agents are rational, roughly speaking, all the possible arguments available to certain agent should form a consistent subset, however not necessarily complete. Instead, very similar to the canonical model method that gets extensively utilized in completeness proof of modal logic [10], the core philosophical idea of our treatment here is to regard maximal consistent subsets of possible arguments as possible worlds. This subset of possible arguments are exactly all those arguments that actually hold true at the corresponding possible world, hence it must be consistent, and also once it is maximal, this subset contains so many possible arguments that they completely cover all aspects of a world’s characteristics, thus uniquely determining the one possible world.

For now, in order to formalize the above intuitive idea, one subtle technical issue remains to be solved with care: we still lack a rigid definition of so-called “consistent” subsets of possible arguments. After all, recall that now we are directly provided with an argument Kripke model, which is never guaranteed to have been actually generated from some epistemic Kripke model; in fact based on Definition 3, we know nothing but attack relations are irreflexive in argument Kripke models. Hence, we have to define a very general notion of “consistency” through very general mathematical tools.

Nevertheless, some sort of hint drawn from our established methodology of the generated argument Kripke model may still prove to be quite enlightening. For a figurative clue let us refer back to Example 1, where the generated argument Kripke model 𝔑g\mathfrak{N}_{g} very similarly resembles the power set lattice of SS [1], so apparent an evidence that drives us to naturally think of the bijective correspondence between any element in a set and its principal ultrafilter, which is exactly a subset of the power set. Such a broad orientation via ultrafilters seems quite promising, however as we can confirm, an argument Kripke model does not necessarily form a Boolean algebra, and thus we have to invoke a more generalized mathematical definition, say ultrafilters over a partial order (or preorder, almost equivalently). But then what is the partial order?

Thankfully, recall our previous informal discussion on stronger arguments and weaker arguments in Section 3, there exactly exists a quite handy and natural notion of partial order among arguments, namely by order of argumentation strength. And then immediately, our core philosophical idea bears intimate similarity to the ultrafilter extension construction in modal logic, so that proper filters correspond to “consistent theories” while ultrafilters correspond to “maximal consistent theories”, for readers unfamiliar with this topic, cf. [4] as a rudimentary introduction. Formal definitions go as the following:

Definition 6 (Preorder \leq)

Given an argument Kripke model 𝔑=(𝕎,A,G)\mathfrak{N}=(\mathbb{W},A,G), we define a preorder 𝕎×𝕎\leq\subseteq\mathbb{W}\times\mathbb{W} such that for any U,V𝕎U,V\in\mathbb{W}, UVU\leq V iff pPW𝕎\forall p\in P\forall W\in\mathbb{W}, (W,V)A(p)(W,U)A(p)(W,V)\in A(p)\to(W,U)\in A(p).

Verifying that \leq is reflexive and transitive is obvious. As for the intuitive reading, UVU\leq V means “argument UU is no weaker than argument VV in attack power”, just as Definition 6 shows, if and only if any pair of proposition and argument attacked by VV also gets attacked by UU.

Remark 4

UVU\leq V intuitively means “UU is stronger than VV” (or at least equally strong), notVV is stronger than UU”, and therefore, here it is inadvisable to read the notation “\leq” as “less than or equal to”. This kind of definition in many ways conforms to the convention in set theory [14]: the “smaller”, the stronger.

Given any fixed partial order (or more generally, fixed preorder) \leq over any fixed nonempty set 𝕎\mathbb{W}, the usual definitions of filters and ultrafilters [16] are presented as below:

Definition 7 (Filter)

For any 𝕌𝕎\mathbb{U}\subseteq\mathbb{W}, 𝕌\mathbb{U} is a filter iff:

  • 𝕌\mathbb{U}\neq\emptyset.

  • U𝕌\forall U\in\mathbb{U}, W𝕎\forall W\in\mathbb{W}, UWW𝕌U\leq W\to W\in\mathbb{U}.

  • U,V𝕌\forall U,V\in\mathbb{U}, W𝕌\exists W\in\mathbb{U}, WUWVW\leq U\land W\leq V.

A filter 𝕌\mathbb{U} is proper iff 𝕌𝕎\mathbb{U}\neq\mathbb{W}, i.e., 𝕌𝕎\mathbb{U}\subset\mathbb{W}.

Definition 8 (Ultrafilter)

For any 𝕌𝕎\mathbb{U}\subseteq\mathbb{W}, 𝕌\mathbb{U} is an ultrafilter iff:

  • 𝕌\mathbb{U} is a proper filter.

  • ¬𝕍𝕎(𝕌𝕍𝕍\neg\exists\mathbb{V}\subseteq\mathbb{W}(\mathbb{U}\subset\mathbb{V}\land\mathbb{V} is a filter).

Here we have to pay a little more attention, however. Unlike set-theoretic ultrafilters, which always exist for any nonempty set SS as subsets of 𝒫(S)\mathcal{P}(S), for a portion of partial orders or preorders there exist no ultrafilters over them. To give a pictorial though informal depiction, those partial orders without ultrafilters never “diverge permanently” towards totally independent directions, thus so to speak, they are either just linear orders or in a sense much like linear orders. Fortunately, such kind of partial orders matter little to argumentation theory — no need to argue if there is no divergence after all! Therefore, as the following Definition 9, in this paper we can safely concentrate on nontrivial argument Kripke models with ultrafilters.

Definition 9 (Triviality)

An argument Kripke model 𝔑\mathfrak{N} is trivial iff there is no ultrafilter over the preorder \leq in Definition 6. 𝔑\mathfrak{N} is nontrivial iff it is not trivial.

Through viewing ultrafilters as possible worlds, we at last approach the following Definition 10:

Definition 10 (Generated Epistemic Kripke Model)

Given a nontrivial argument Kripke model 𝔑=(𝕎,A,G)\mathfrak{N}=(\mathbb{W},A,G) with a possible argument W𝕎W\in\mathbb{W}, the generated epistemic Kripke model is 𝔐g=(S,E,F)\mathfrak{M}_{g}=(S,E,F), where:

  • S={𝕌𝕎𝕌S=\{\mathbb{U}\subseteq\mathbb{W}\mid\mathbb{U} is an ultrafilter over the preorder }\leq\}.

  • For any iIi\in I and any 𝕌,𝕍S\mathbb{U},\mathbb{V}\in S, (𝕌,𝕍)E(i)(\mathbb{U},\mathbb{V})\in E(i) iff 𝕌G(i)=𝕍G(i)\mathbb{U}\cap G(i)=\mathbb{V}\cap G(i).

  • For any pPp\in P, F(p)={𝕌SU𝕌V𝕌,VU(V,W)A(p)}F(p)=\{\mathbb{U}\in S\mid\exists U\in\mathbb{U}\forall V\in\mathbb{U},V\leq U\to(V,W)\notin A(p)\}.

It is easy to see that SS\neq\emptyset and that E(i)E(i) is an equivalence relation, thus 𝔐g\mathfrak{M}_{g} in Definition 10 is indeed a well-defined epistemic Kripke model. Readers may now wonder, however, that we have yet provided no justification for E(i)E(i) or F(p)F(p) in Definition 10. As a matter of fact, since possible worlds are constituted of ultrafilters, which are somewhat mathematically factitious after all, it is inevitably tough to give further intuitive explanation solely based on our folk experience. Rather, we shall adopt a little indirect but strictly formal approach, through investigating into a beautiful duality theorem on invariance over the language in Definition 1, so as to demonstrate that our generations in Definitions 5 and 10 are indeed perfectly reasonable. Nevertheless, before we dive into technical subtleties related to this duality theorem in Section 6, we had better first take a look at one vivid practical example presented in the following Section 5, both for acquainting readers with our rather abstract mathematical definitions above and for illustrating the significant practicality of such two-way generation as well as our framework as a whole.

5 A Practical Example: Running for the Mayor

Example 2

Alice and Bob, two of the mayor candidates, are publicly debating over their intended urban policies.

‘Aging is the biggest challenge our city is now facing,’ says Alice. ‘There are more and more old people, yet young population is decreasing. If I am elected as the mayor, I will wield a series of revolutionary measures that attract young people to move and dwell into our city.’ (A1)\cdots\cdots(A_{1})

‘No, we don’t need any more young people who will end up competing for only a limited number of job positions,’ says Bob. ‘In my opinion, it is unemployment that constitutes our biggest problem, since at present around 1,000 young people are badly in need of a job. Therefore if I am elected as the mayor, I promise to create 1,000 new job opportunities during 5 years.’ (B)\cdots\cdots(B)

‘I cannot agree with you,’ says Alice. ‘As far as I know, our city’s working-age population is rapidly decreasing at a current speed of around minus 400 per year, so what will be the point of those 1,000 more job opportunities if there are merely not enough young people who can take them?’ (A2)\cdots\cdots(A_{2})

In actuality, the above debate depicted in Example 2 may well continue going on, but to utter a real-time commentary on the debate, at the present moment Alice’s last argument attacks Bob’s, and thus based on our folk principle that “the one who has the last word laughs best”, we can conclude that Alice is tentatively winning the debate. Therefore, we can formalize this debate as the following:

  • Two agents a,ba,b denote Alice and Bob, respectively.

  • A1A_{1}, BB, A2A_{2} denote the three consecutive arguments by Alice and Bob, respectively, as we have indexed beside the text above in Example 2. Our current possible argument is the last argument, namely A2A_{2}.

  • Proposition pp denotes that “there exists considerable unemployment.” Argument BB attacks argument A1A_{1} with respect to proposition pp.

  • Proposition qq denotes that “considering aging, unemployment is not a serious problem”. Argument A2A_{2} attacks argument BB with respect to proposition qq.

  • At present, arguments A1A_{1} and A2A_{2} are of course available to Alice herself. Nonetheless, argument BB is not available to Bob now (although it used to be), because it is losing to the current argument A2A_{2} which is attacking it and hence Bob has to give it up.

Then, our current argument Kripke model 𝔑\mathfrak{N} should look like the following:

𝔑\textstyle{\mathfrak{N}}A1:a,¬b\textstyle{A_{1}:a,\neg b\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}A(p)\scriptstyle{A(p)}B:¬a,¬b\textstyle{B:\neg a,\neg b\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}A(q)\scriptstyle{A(q)}A2:a,¬b\textstyle{A_{2}:a,\neg b}

Based on model 𝔑\mathfrak{N}, the preorder \leq in Definition 6 can be represented as the following Hasse diagram, namely A2A1A_{2}\leq A_{1} and BA1B\leq A_{1}:

A1\textstyle{A_{1}}A2\textstyle{A_{2}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}B\textstyle{B\ignorespaces\ignorespaces\ignorespaces\ignorespaces}

And so obviously there exist two ultrafilters, namely {A1,A2}\{A_{1},A_{2}\} and {A1,B}\{A_{1},B\}.

Before finalizing our construction of the generated epistemic Kripke model 𝔐g\mathfrak{M}_{g}, let us pause for a while and genuinely think about what we are actually doing now and why we are doing it. Surely, we desire a familiar, tidy and expressive epistemic Kripke model that can aid us to reason about the current scenario, as epistemic logic has been thoroughly studied over the decades and has proved to be a quite accurate and productive depiction of agents’ knowledge, especially helpful when dealing with intricate situations such as the muddy children puzzle and the Byzantine generals problem [9]. Nonetheless, there remains one fatal concern. Indeed, the common method to obtain epistemic Kripke models in reality still relies largely on human intuition and so is rather obscure, a deficiency which in fact greatly impedes such kind of logic approach to knowledge presentation from being universally put into practical application [18]. For instance, just under our current setting of the above Example 2, we have already formalized the argument Kripke model 𝔑\mathfrak{N} with ease, simply as a literal transcription of the debate per se, however, the task of generating the epistemic Kripke model for Alice and Bob is far from obvious or even natural. After all, in the realistically physical world, it is solely Alice and Bob’s extrinsic debate that is plainly accessible to other audience, whereas their intrinsic knowledge could be indirectly inferred but never directly observed.

The above analysis accounts for exactly why we are about to compute the generated epistemic Kripke model 𝔐g\mathfrak{M}_{g} from our original argument Kripke model 𝔑\mathfrak{N}, and also illuminates one of the major motivations as well as applications of our dual framework presented in this paper. Hence as defined in the previous Section 4, the generated epistemic Kripke model 𝔐g\mathfrak{M}_{g} from the argument Kripke model 𝔑\mathfrak{N} together with the current possible argument A2A_{2} is calculated to be the following:

𝔐g\textstyle{\mathfrak{M}_{g}}{A1,A2}:p,q\textstyle{\{A_{1},A_{2}\}:p,q\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}E(a),E(b)\scriptstyle{E(a),E(b)}E(b)\scriptstyle{E(b)}{A1,B}:p,¬q\textstyle{\{A_{1},B\}:p,\neg q\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}E(a),E(b)\scriptstyle{E(a),E(b)}

It can be noted that 𝔐g\mathfrak{M}_{g} contains two possible worlds, namely the two ultrafilters {A1,A2}\{A_{1},A_{2}\} and {A1,B}\{A_{1},B\}. Thus which one should be our current possible world? The current possible world should of course include the current possible argument A2A_{2}, and so it must be the ultrafilter {A1,A2}\{A_{1},A_{2}\}, where both pp and qq really hold. Now as 𝔐g\mathfrak{M}_{g} also shows, Alice actually knows the fact qq but Bob does not, since he also considers another world (i.e. ultrafilter) {A1,B}\{A_{1},B\} possible, where ¬q\neg q holds instead. Hence in a word, our resulting epistemic Kripke model 𝔐g\mathfrak{M}_{g}, albeit automatically generated from the argument Kripke model 𝔑\mathfrak{N}, indeed conforms pretty well with what a human being would intuitively deduce from the argumentation process between Alice and Bob in Example 2.

Admittedly, in this specific simple example, 𝔐g\mathfrak{M}_{g} looks so obvious just by our intuition, and some of the readers might still be wondering why we essentially need such an indirect process to generate 𝔐g\mathfrak{M}_{g} rather than try to directly construct the current epistemic Kripke model. But here the main point is, no matter how simple or how complex 𝔐g\mathfrak{M}_{g} may actually be, to say the very least, any straightforward clues about what the epistemic Kripke model is like can be scarcely found either in the real physical world, or in the narration of some story happened in real world. For instance considering the muddy children puzzle, an ordinary solution would commonly start with a cubic epistemic Kripke model which is almost taken for granted, although this puzzle’s literal text — namely some English sentences describing the background settings of the puzzle followed by the conversation between the parent and the children — actually shows no direct hint for any cubic structure at all. As a matter of fact, according to David Lewis’ modal realism [17], all possible worlds in the epistemic Kripke model are equally real, which could suggest that since we are at our current world, we should not be fully capable of observing other possible worlds as directly as the current world, thus not for the whole epistemic Kripke model, either. Therefore in argumentation theory as well as other fields of application, quite substantially, the intangible epistemic Kripke model is always generated from other concrete observables, such as the argument Kripke model. Even though in relatively easy cases like Example 2 and the muddy children puzzle, the epistemic Kripke model seems fairly apparent, nonetheless, human’s intuition may fail to function well when confronted with much complicated circumstances, and moreover importantly, such vague concept of human intuition possesses little reference value for AI systems to be counted as an effective algorithm. Hence, our approach by the dual theory helps to fill up the above gap through automatically generating the appropriate epistemic Kripke model in a systematical way.

As a conclusion to our philosophical analysis over Example 2 in this section, we have carefully demonstrated how to generate the corresponding epistemic Kripke model 𝔐g\mathfrak{M}_{g} given the current argument Kripke model 𝔑\mathfrak{N}. In the next Section 6, we shall then turn our attention to some technical details and in the end prove a duality theorem so as to formally justify our such methodology of two-way generation.

6 Knowledge vs. Argumentation: The Duality

Fix an epistemic Kripke model 𝔐=(S,E,F)\mathfrak{M}=(S,E,F) with a possible world sSs\in S, and suppose its corresponding generated argument Kripke model is 𝔑g=(𝕎,A,G)\mathfrak{N}_{g}=(\mathbb{W},A,G), where we have {s}𝕎\{s\}\in\mathbb{W}. Assume 𝔑g\mathfrak{N}_{g} is nontrivial. Thus once again, with respect to this fixed argument Kripke model 𝔑g\mathfrak{N}_{g} and this fixed possible argument {s}\{s\}, suppose its corresponding generated epistemic Kripke model is 𝔐gg=(S,E,F)\mathfrak{M}_{gg}=(S^{\prime},E^{\prime},F^{\prime}). We reasonably expect that 𝔐gg\mathfrak{M}_{gg}, even though may not be exactly identical to the original 𝔐\mathfrak{M}, must resemble 𝔐\mathfrak{M} to a certain extent. Nonetheless, in order to pin down such intuition precisely, we firstly have to determine which possible world in SS^{\prime} should correspond to the original sSs\in S, namely, represent the currently real world.

Lemma 1

For any tSt\in S namely {t}𝕎\{t\}\in\mathbb{W}, there does not exist U𝕎U\in\mathbb{W} such that U{t}{t}UU\leq\{t\}\land\{t\}\nleq U, where relation \leq is defined in Definition 6.

Proof

To a contradiction suppose such UU exists, since {t}U\{t\}\nleq U, there exists pPp\in P, V𝕎V\in\mathbb{W} such that (V,U)A(p)(V,{t})A(p)(V,U)\in A(p)\land(V,\{t\})\notin A(p), hence there does not exist vVv\in V such that (vF(p)tF(p))(vF(p)tF(p))(v\in F(p)\land t\notin F(p))\lor(v\notin F(p)\land t\in F(p)), namely for any vVv\in V, vF(p)tF(p)v\in F(p)\iff t\in F(p). And then as (V,U)A(p)(V,U)\in A(p), it is easy to see that for any uUu\in U, vVv\in V, uF(p)vF(p)tF(p)u\in F(p)\iff v\notin F(p)\iff t\notin F(p), thus (U,{t})A(p)(U,\{t\})\in A(p) but of course (U,U)A(p)(U,U)\notin A(p), therefore U{t}U\nleq\{t\}, a contradiction.

Proposition 1

For any tSt\in S, τ(t)={U𝕎{t}U}𝕎\tau(t)=\{U\in\mathbb{W}\mid\{t\}\leq U\}\subseteq\mathbb{W} is an ultrafilter.

Proof

Since {t}{t}\{t\}\leq\{t\}, {t}τ(t)\{t\}\in\tau(t) so τ(t)\tau(t)\neq\emptyset. For any Uτ(t)U\in\tau(t), any W𝕎W\in\mathbb{W}, if UWU\leq W then by transitivity {t}W\{t\}\leq W, hence Wτ(t)W\in\tau(t). For any U,Vτ(t)U,V\in\tau(t), {t}τ(t)\exists\{t\}\in\tau(t) such that {t}U{t}V\{t\}\leq U\land\{t\}\leq V. Thus τ(t)\tau(t) is a filter. To a contradiction suppose τ(t)=𝕎\tau(t)=\mathbb{W}, then any proper filter 𝕌𝕎\mathbb{U}\subset\mathbb{W} is not an ultrafilter, namely there are no ultrafilters, contradicting our assumption that 𝔑g\mathfrak{N}_{g} is nontrivial. Thus τ(t)𝕎\tau(t)\subset\mathbb{W} is a proper filter. To a contradiction suppose there exists 𝕌𝕎\mathbb{U}\subseteq\mathbb{W} such that τ(t)𝕌\tau(t)\subset\mathbb{U} and that 𝕌\mathbb{U} is a filter, then there exists U𝕌τ(t)U\in\mathbb{U}\setminus\tau(t), as 𝕌\mathbb{U} is a filter, there exists V𝕌V\in\mathbb{U} such that VUV{t}V\leq U\land V\leq\{t\}, and because Uτ(t)U\notin\tau(t), we also have Vτ(t)V\notin\tau(t), namely {t}V\{t\}\nleq V, contradicting the previous Lemma 1. Thus τ(t)\tau(t) is an ultrafilter.

Definition 11 (Principal Ultrafilter)

As Proposition 1 shows, for any tSt\in S, we call τ(t)S\tau(t)\in S^{\prime} as tt’s principal ultrafilter.

Although the definition here is slightly different from ordinary principal ultrafilters over a Boolean algebra [13], readers should feel convinced that the core idea is the same and so we are quite justified for usage of the same name. Then of course, the current possible world in the “generated generated” epistemic Kripke model 𝔐gg\mathfrak{M}_{gg} should be τ(s)S\tau(s)\in S^{\prime}, namely, the principal ultrafilter of the original current world sSs\in S.

A little more preparation is required: we additionally assume that for any proposition pPp\in P, 𝔐,sp\mathfrak{M},s\vDash p i.e. sF(p)s\in F(p). The reason is that an argument Kripke model can only inform us about the relative attack relations between arguments with respect to some proposition pp, but nothing concerned with their absolute true-hood or falsehood, hence such kind of assumption, or to be called more accurately as convention or protocol, is necessarily needed. Anyhow, this restriction actually does not matter a lot, since due to symmetry between true and false we can always freely choose either pp or ¬p\neg p as the proper basic proposition so as to meet the assumption’s requirements. We then firstly prove a series of useful lemmata under our current assumption:

Proposition 2

For any U,V𝕎U,V\in\mathbb{W} such that UVU\subseteq V, UVU\leq V.

Proof

This fact can be verified straightforwardly from definition.

Lemma 2

For any tSt\in S and any pPp\in P, 𝔐gg,τ(t)p𝔐,tp\mathfrak{M}_{gg},\tau(t)\vDash p\iff\mathfrak{M},t\vDash p.

Proof

We have

𝔐gg,τ(t)p\displaystyle\mathfrak{M}_{gg},\tau(t)\vDash p\iff τ(t)F(p)\displaystyle\tau(t)\in F^{\prime}(p)
\displaystyle\iff Uτ(t)Vτ(t),VU(V,{s})A(p)\displaystyle\exists U\in\tau(t)\forall V\in\tau(t),V\leq U\to(V,\{s\})\notin A(p)
\displaystyle\iff Uτ(t)Vτ(t),VU¬rVs{s},\displaystyle\exists U\in\tau(t)\forall V\in\tau(t),V\leq U\to\neg\exists r\in V\forall s\in\{s\},
(rF(p)sF(p))(rF(p)sF(p))\displaystyle(r\in F(p)\land s\notin F(p))\lor(r\notin F(p)\land s\in F(p))
\displaystyle\iff Uτ(t)Vτ(t),VUrV,\displaystyle\exists U\in\tau(t)\forall V\in\tau(t),V\leq U\to\forall r\in V,
rF(p)sF(p)\displaystyle r\in F(p)\leftrightarrow s\in F(p)
\displaystyle\iff Uτ(t)Vτ(t),VUrV,rF(p)\displaystyle\exists U\in\tau(t)\forall V\in\tau(t),V\leq U\to\forall r\in V,r\in F(p) ()\displaystyle({\dagger})

On the one hand, suppose (†) holds, then since Uτ(t)U\in\tau(t), we have {t}U\{t\}\leq U, so r{t},rF(p)\forall r\in\{t\},r\in F(p), hence tF(p)t\in F(p). On the other hand, suppose tF(p)t\in F(p), then {t}τ(t)\{t\}\in\tau(t), and for any Vτ(t)V\in\tau(t) such that V{t}V\leq\{t\}, namely for any Vτ(t)V\in\tau(t) such that qPW𝕎\forall q\in P\forall W\in\mathbb{W}, (W,{t})A(q)(W,V)A(q)(W,\{t\})\in A(q)\to(W,V)\in A(q), we thus have (W,{t})A(p)(W,V)A(p)(W,\{t\})\in A(p)\to(W,V)\in A(p). If ¬uS\neg\exists u\in S such that uF(p)u\notin F(p), then of course rVS\forall r\in V\subseteq S, rF(p)r\in F(p). If uS\exists u\in S such that uF(p)u\notin F(p), then ({u},{t})A(p)(\{u\},\{t\})\in A(p) thus ({u},V)A(p)(\{u\},V)\in A(p), therefore we still have rV\forall r\in V, rF(p)r\in F(p). Anyway, (†) always holds. In total, we have ()tF(p)({\dagger})\iff t\in F(p), namely 𝔐gg,τ(t)p𝔐,tp\mathfrak{M}_{gg},\tau(t)\vDash p\iff\mathfrak{M},t\vDash p.

Lemma 3

For any tSt\in S and any iIi\in I, if (s,t)E(i)(s,t)\in E(i) then (τ(s),τ(t))E(i)(\tau(s),\tau(t))\in E^{\prime}(i).

Proof

For any Uτ(s)G(i)U\in\tau(s)\cap G(i) we have tUt\in U, hence {t}U\{t\}\leq U, so also Uτ(t)G(i)U\in\tau(t)\cap G(i), and vice versa, thus τ(s)G(i)=τ(t)G(i)\tau(s)\cap G(i)=\tau(t)\cap G(i), namely (τ(s),τ(t))E(i)(\tau(s),\tau(t))\in E^{\prime}(i).

Lemma 4

For any iIi\in I, pPp\in P and any 𝕌S\mathbb{U}\in S^{\prime} such that (τ(s),𝕌)E(i)(\tau(s),\mathbb{U})\in E^{\prime}(i),

  1. 1.

    if 𝔐gg,𝕌p\mathfrak{M}_{gg},\mathbb{U}\vDash p then there exists tSt\in S such that (s,t)E(i)(s,t)\in E(i) and that 𝔐,tp\mathfrak{M},t\vDash p.

  2. 2.

    if 𝔐gg,𝕌p\mathfrak{M}_{gg},\mathbb{U}\nvDash p then there exists tSt\in S such that (s,t)E(i)(s,t)\in E(i) and that 𝔐,tp\mathfrak{M},t\nvDash p.

Proof

Denote [s]i={tS(s,t)E(i)}𝕎[s]_{i}=\{t\in S\mid(s,t)\in E(i)\}\in\mathbb{W}. Since s[s]is\in[s]_{i}, {s}[s]i\{s\}\leq[s]_{i} namely [s]iτ(s)[s]_{i}\in\tau(s), also since [s]iG(i)[s]_{i}\in G(i), we have [s]iτ(s)G(i)[s]_{i}\in\tau(s)\cap G(i). As (τ(s),𝕌)E(i)(\tau(s),\mathbb{U})\in E^{\prime}(i), namely τ(s)G(i)=𝕌G(i)\tau(s)\cap G(i)=\mathbb{U}\cap G(i), hence [s]i𝕌[s]_{i}\in\mathbb{U}.

Moreover the same as (†) in Lemma 2, we have 𝔐gg,𝕌pU𝕌V𝕌,VUrV,rF(p)\mathfrak{M}_{gg},\mathbb{U}\vDash p\iff\exists U\in\mathbb{U}\forall V\in\mathbb{U},V\leq U\to\forall r\in V,r\in F(p).

  1. 1.

    If 𝔐gg,𝕌p\mathfrak{M}_{gg},\mathbb{U}\vDash p, namely U𝕌V𝕌,VUrV,rF(p)\exists U\in\mathbb{U}\forall V\in\mathbb{U},V\leq U\to\forall r\in V,r\in F(p), then as [s]i𝕌[s]_{i}\in\mathbb{U} and 𝕌\mathbb{U} is a filter, there exists W𝕌W\in\mathbb{U} such that W[s]iWUW\leq[s]_{i}\land W\leq U, hence rW\forall r\in W, rF(p)r\in F(p), and because WW\neq\emptyset we have rW\exists r\in W, rF(p)r\in F(p). Since W[s]iW\leq[s]_{i} and (W,W)A(p)(W,W)\notin A(p), we have (W,[s]i)A(p)(W,[s]_{i})\notin A(p), therefore t[s]i\exists t\in[s]_{i} such that tF(p)t\in F(p), namely (s,t)E(i)(s,t)\in E(i) and 𝔐,tp\mathfrak{M},t\vDash p.

  2. 2.

    If 𝔐gg,𝕌p\mathfrak{M}_{gg},\mathbb{U}\nvDash p, namely U𝕌V𝕌,VUrV,rF(p)\forall U\in\mathbb{U}\exists V\in\mathbb{U},V\leq U\land\exists r\in V,r\notin F(p), then as [s]i𝕌[s]_{i}\in\mathbb{U}, there exists V𝕌V\in\mathbb{U} such that V[s]irVV\leq[s]_{i}\land\exists r\in V, rF(p)r\notin F(p). Since V[s]iV\leq[s]_{i} and (V,V)A(p)(V,V)\notin A(p), we have (V,[s]i)A(p)(V,[s]_{i})\notin A(p), therefore t[s]i\exists t\in[s]_{i} such that tF(p)t\notin F(p), namely (s,t)E(i)(s,t)\in E(i) and 𝔐,tp\mathfrak{M},t\nvDash p.

Finally we state our main result as the following duality theorem:

Theorem 6.1 (Duality Theorem)

For any epistemic formula φ\varphi where epistemic modalities only act upon atomic propositions and their negations, we have 𝔐,sφ𝔐gg,τ(s)φ\mathfrak{M},s\vDash\varphi\iff\mathfrak{M}_{gg},\tau(s)\vDash\varphi.

Proof

The atomic case when φ\varphi is the form of pp follows from Lemma 2. The modal case when φ\varphi is the form of 𝒦ip\mathcal{K}_{i}p or 𝒦i¬p\mathcal{K}_{i}\neg p follows from Lemmata 2 and 3 for one direction, as well as Lemma 4 for another direction.

It may seem a little pity that according to Theorem 6.1, only agents’ knowledge about atomic propositions (and their negations) is ensured to be preserved from 𝔐\mathfrak{M} to 𝔐gg\mathfrak{M}_{gg}, but not necessarily for more complex knowledge like 𝒦i(pq)\mathcal{K}_{i}(p\to q) or mutual knowledge like 𝒦i𝒦jp\mathcal{K}_{i}\mathcal{K}_{j}p. However, such limitation is exactly due to the fact that in Definition 3 of argument Kripke models, possible arguments can attack each other only with respect to each single atomic proposition, but not with respect to a set of propositions like {p,q}\{p,q\} or agents’ knowledge like 𝒦jp\mathcal{K}_{j}p. For simplicity and clarity, we choose to work with this restricted version of definition in the major part of this paper, but shall also briefly discuss possible directions to expand the model and semantics in the following Subsection 7.2 so that we can obtain richer representation and finer-grained resolution.

On the other hand symmetrically, it is also totally feasible to start from an argument Kripke model 𝔑=(𝕎,A,G)\mathfrak{N}=(\mathbb{W},A,G) with a possible argument W𝕎W\in\mathbb{W} and end up with the “generated generated” argument Kripke model 𝔑gg\mathfrak{N}_{gg}, while a corresponding duality theorem similar to Theorem 6.1 should then be expected under a suitable set of presumptions. Anyhow, this dual generating process from 𝔑\mathfrak{N} to 𝔑gg\mathfrak{N}_{gg} might seem less intuitive or practically useful, and we shall omit detailed analysis here since by duality, the mathematical technique is just very similar.

In sum, this kind of duality theorem formally justifies our two-way generation in Definitions 5 and 10, so that the static, intrinsic epistemic Kripke models and the dynamic, extrinsic argument Kripke models are indeed a dual pair.

7 Further Discussion

This section collects a bunch of miscellaneous discussion on further expansions and applications of our framework presented in this paper.

7.1 Syntax Expanded

In Definition 1, a symmetric pair of languages, namely the epistemic formula φ\varphi and the argument formula ξ\xi, are defined as the ordinary basic modal logic. While epistemic logic has been well established in the literature, readers may keep wondering about the practical usefulness of the argument formulae, in spite of our explanation for their intuitive readings right after Definition 1. As a matter of fact, argument formulae are just as expressive as epistemic formulae, both mathematically and pragmatically, that is to say, they are indeed able to talk about lots of interesting features of argumentation. As an elementary example, the following very simple argument formula 𝒜p¬i\mathcal{A}_{p}\neg i intuitively says that, all arguments that attack the current argument with respect to proposition pp are not accessible to agent ii, in other words, the current argument “defeats”, “dominates” or “overrules” agent ii with respect to proposition pp because he has no available counter arguments to refute it, hence, whoever utters this argument out will certainly win the debate over proposition pp against agent ii. Although we admit that the usage itself might seem a little bit awkward — probably because it somewhat differs from our familiar SVO word order in English — substantially, argument formulae are competently powerful for expressing a variety of situations in argumentation.

Moreover, we mainly restrict our attention in this paper onto basic modal logic for the reason of simplicity and clarity, but of course we by no means have to take such limit rigidly. Since sole argument formulae are definitely not enough for distinguishing every detail of argument Kripke models, we are rather free to expand the language, for example by introducing new modalities, so as to obtain more abundant expressivity just in any case of need.

7.2 Semantics Expanded

On the other hand, it is also plausible to consider expanding the Kripke models, especially the argument one, with more affluent structure and information. As Definition 3 shows, for simplicity at present, we only allow arguments to attack each other with respect to certain atomic proposition. However let alone in mathematics, even in real life, people often argue for different opinions which do not disagree simply on one atomic proposition. For example, two agents do not know whether Alice loves Bob or Bob loves Alice, hence there is no divergence on either atomic proposition, but one agent believes that Alice loves Bob if and only if Bob loves Alice, while the other agent does not think it is necessarily so. Furthermore, arguments can also disagree over agents’ knowledge, such as 𝒦jp\mathcal{K}_{j}p. Through taking various kinds of attack relations into consideration we will then be able to drop the restrictions on language in Theorem 6.1, as we have remarked right after that theorem’s proof.

For another common concern on the relationship between our dual framework presented in this paper and Dung’s argumentation theory [8], as we have foretold in Section 3, Dung’s arguments seem to attack each other only in the weak sense, because accordingly in his definition of consistency, any two arguments in a consistent set can never attack one another, which seems to be even stricter than our later definition in Section 4 of maximal consistent sets of arguments as ultrafilters over a preorder. Anyway, although Dung’s definition is perhaps not strong enough to fulfill our demand here as a dual theory, we might still consider using it in certain due case.

On the flip side, not only attack relations, but support relations between arguments may also get dealt with as another sort of modality. In total, the same technique applies to all these semantic expansions with various kinds of relations amongst the arguments.

7.3 Application to Game Theory

We would also like to suggest that our framework is versatile and flexible for applying to game theory, which contributes as another quite important practical usage. For a very rough instance, agents who are game players might take turns to pick one possible argument that is currently available to himself from the argument Kripke model, and as explained in the previous Subsection 7.1, agent ii will lose this game of argumentation over proposition pp against any argument on which 𝒜p¬i\mathcal{A}_{p}\neg i holds. Briefly speaking, in accordance with different kinds of practical scenarios, our detailed game rules can also be set differently, and moreover, agents can devise their personal game strategies based on their own knowledge from the epistemic Kripke model.

7.4 Dynamic Essence of Knowledge as Maxwell’s Demon

Commonly, knowledge is regarded as some static state of the objective world, for example, we talk about the agents’ knowledge at a single moment. The traditionally accepted definition of knowledge as justified true belief or something else alike does not seem to reveal any temporal characteristic of knowledge, either [2]. Nonetheless, our approach in this paper to treat knowledge and argumentation as a dual creatively provides an alternative angle of philosophical view, asserting that knowledge also bears an essential dynamic dimension, as the current epistemic Kripke model is always accompanied by its corresponding generated argument Kripke model.

As for an intuitive explanation, here we would like to resort to Maxwell’s demon. Based on both thermodynamics [20] and information theory [6], the recognized explication for how the demon works is that the demon has to know each molecule’s velocity in order to perform his task, while such knowledge (or to be called information) itself is negative entropy, in other words in the physical reality, entropy must increase when the demon attempts to acquire new knowledge about a molecule’s velocity by whatever means. Hence the demon’s seemingly subjective knowledge as a static mental state actually carries physically objective negative entropy, exactly because the demon is able to act dynamically according to his knowledge and thus influence the physical world. Therefore, this well known thought experiment strongly defenses our metaphysical and epistemological thesis that knowledge is essentially dynamic.

8 Concluding Remarks

In this paper, we come up with a dual theory between static knowledge and dynamic argumentation so as to uncover the two concepts’ profound relevance. Particularly, we define in symmetry two types of modal formulae, for knowledge and argumentation respectively, as well as two corresponding types of Kripke models. We then semantically establish the two-way generation method capable of transforming either type of Kripke model to the other type, and also rigidly justify our methodology by showing the syntactic invariance via a dual theorem. Our novel yet convincing approach to combine knowledge and argumentation fundamentally gets rid of any unnatural affectations in other previous attempts, while our simple yet clear framework is supposed to lay out a basic playground for both epistemic logic and argumentation theory.

Moreover, through careful examination on a vivid example of pragmatically utilizing our dual theory, we not only demonstrate in a concrete way how the methodology of two-way generation actually works, but we are also led to the eventual discovery of our framework’s one significantly useful application in practice: realistically, the argument Kripke model is usually much easier to observe and obtain, for example simply by recording the actual verbal debate among the agents, from the source data of which we are then able to generate the corresponding epistemic Kripke model and carry out a real-time analysis over the current debate. What is more important, the above task essentially relies little on human intuition and so is also viable to get mechanically performed by an AI system, who can properly implement modal logic’s decidability as one of its main advantages.

Further, we discuss possible expansions as well as applications of our framework, which may constitute some future research directions. Especially, we claim that in contrary to our common perception, the seemingly “static” knowledge essentially possesses an indispensably dynamic instinct. As Francis Bacon’s famous saying goes: “Knowledge is power”. Such admitted characterization of knowledge also displays a vibrant image to help us intuitively understand knowledge’s dynamic essence, as power can only manifest itself through actual exertion of the power in some specific dynamic event, for instance, by demonstrating your argument power to skillfully defeat your opponent during a debate, while your such power exactly comes out of your knowledge. All the entanglement between statics and dynamics reminds us of Karl Marx’s extremely influential motto: “The philosophers have hitherto only interpreted the world in various ways; the point, however, is to change it”.

Acknowledgements

Both the authors owe immense gratitude to Teeradaj Racharak (whose nickname is ‘X’) for his teaching and help on argumentation theory. We would also like to thank the anonymous reviewers for their invaluable advice.

References

  • [1] Artin, M.: Algebra. Prentice Hall, Hoboken, New Jersey (1991)
  • [2] Audi, R.: Epistemology: a comtemporary introduction to the theory of knowledge. Routledge, New York (1998)
  • [3] van Benthem, J.F.A.K.: The Logic of Time. D. Reidel Publishing Company, Dordrecht, Holland (1982)
  • [4] Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)
  • [5] Caminada, M.W.A., Sakama, C.: On the issue of argumentation and informedness. In: JSAI-isAI Workshops (2015)
  • [6] Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Hoboken, New Jersey (2006)
  • [7] van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic, Synthese Library, vol. 337. Springer, Dordrecht, The Netherlands (2008)
  • [8] Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77(2), 321–357 (1995)
  • [9] Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. The MIT Press, Cambridge, Massachusetts (1995)
  • [10] Goldblatt, R.: Logics of Time and Computation. Center for the Study of Language and Information, Stanford (1992)
  • [11] Grossi, D.: On the logic of argumentation theory. In: van der Hoek, W., Kaminka, G.A., Lespérance, Y., Luck, M., Sen, S. (eds.) Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: Volume 1 - Volume 1. p. 409–416. International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2010)
  • [12] Grossi, D.: Argumentation in the view of modal logic. In: McBurney, P., Rahwan, I., Parsons, S. (eds.) Argumentation in Multi-Agent Systems. pp. 190–208. Springer Berlin Heidelberg, Berlin, Heidelberg (2011)
  • [13] Hodges, W.: A shorter model theory. Cambridge University Press, Cambridge (1997)
  • [14] Jech, T.: Set Theory. Springer Monographs in Mathematics, Springer, Berlin Heidelberg, 3rd millennium edn. (2003)
  • [15] Kittel, C., Knight, W.D., Ruderman, M.A.: Mechanics. McGraw-Hill Book Company, New York (1973)
  • [16] Kunen, K.: Set Theory: An Introduction to Independent Proofs. Elsevier Science B.V., Amsterdam (1980)
  • [17] Lewis, D.: On the Plurality of Worlds. Wiley-Blackwell, Oxford (2001)
  • [18] Perrotin, E., Galimullin, R., Canu, Q., Alechina, N.: Public group announcements and trust in doxastic logic. In: Blackburn, P., Lorini, E., Guo, M. (eds.) Proceedings of 7th International Workshop, LORI 2019. Lecture Notes in Computer Science, vol. 11813, pp. 199–213. Springer, Berlin, Heidelberg (2019)
  • [19] Proietti, C., Yuste-Ginel, A.: Dynamic epistemic logics for abstract argumentation. Synthese 199(3), 8641–8700 (2021)
  • [20] Reif, F.: Statistical Physics. McGraw-Hill Book Company, New York (1965)
  • [21] Schwarzentruber, F., Vesic, S., Rienstra, T.: Building an epistemic logic for argumentation. In: Proceedings of the 13th European Conference on Logics in Artificial Intelligence. p. 359–371. JELIA’12, Springer-Verlag, Berlin, Heidelberg (2012)
  • [22] Wichmann, E.H.: Quantum Physics. McGraw-Hill Book Company, New York (1971)