BELIEF DYNAMICS IN COMPLEX

SOCIAL NETWORKS
Fabio R. Gallo, Natalia Abad Santos, Gerardo I. Simari,
María V. Martínez and Marcelo A. Falappa

Institute for Computer Science and Engineering (UNS-CONICET)

Department of Computer Science and Engineering
Department of Mathematics
Universidad Nacional del Sur
Bahía Blanca, Argentina

1
Problem

22
Problem

32
Problem

42
Problem

52
Preliminaries

63
 Network Social Bases
L: language, P: propositional symbols, only connective is ,
: vertex/1 and edge/2 predicate symbols.

A Social Network is a 4-tuple where:

is a finite set whose elements are called vertices.
is a finite set whose elements are called edges.
is a function called a vertex labelling function.
is a function called an edge labelling function,
where .

74
 Network Social Bases
L: language, P: propositional symbols, only connective is ,
: vertex/1 and edge/2 predicate symbols.

A Social Network is a 4-tuple where:

is a finite set whose elements are called vertices.
is a finite set whose elements are called edges.
is a function called a vertex labelling function.
is a function called an edge labelling function,
where .

84
 Network Social Bases
L: language, P: propositional symbols, only connective is ,
: vertex/1 and edge/2 predicate symbols.

A Social Network is a 4-tuple where:

is a finite set whose elements are called vertices.
is a finite set whose elements are called edges.
is a function called a vertex labelling function.
is a function called an edge labelling function,
where .

94
 Network Social Bases
L: language, P: propositional symbols, only connective is ,
: vertex/1 and edge/2 predicate symbols.

A Social Network is a 4-tuple where:

is a finite set whose elements are called vertices.
is a finite set whose elements are called edges.
is a function called a vertex labelling function.
is a function called an edge labelling function,
where .

104
 Network Social Bases
L: language, P: propositional symbols, only connective is ,
: vertex/1 and edge/2 predicate symbols.

A Social Network is a 4-tuple where:

is a finite set whose elements are called vertices.
is a finite set whose elements are called edges.
is a function called a vertex labelling function.
is a function called an edge labelling function,
where .

114
 Network Social Bases
L: language, P: propositional symbols, only connective is ,
: vertex/1 and edge/2 predicate symbols.

A Social Network is a 4-tuple where:

is a finite set whose elements are called vertices.
is a finite set whose elements are called edges.
is a function called a vertex labelling function.
is a function called an edge labelling function,
where .

124
 Network KB

A Network KB (NKB for short) is a 5-tuple

, where the first four elements comprise a
social network, and 2 L is a mapping assigning a
knowledge base each vertex. For every is called the
knowledge base associated with vertex .

135
Example: Complex social network

146
Example: Complex social network

156
Example: Complex social network

166
 Constraint
A constraint C over a is a pair
where, given , and
,
, called the structural part, contains a conjuction of
conditions that can be of either of the following forms:
• ;
• , for some
.
is called the belief part and contains a conjuction of
conditions involving elements in .

177
 Constraint
A constraint C over a is a pair
where, given , and
,
, called the structural part, contains a conjuction of
conditions that can be of either of the following forms:
• ;
• , for some
.
is called the belief part and contains a conjuction of
conditions involving elements in .

187
 Constraint
A constraint C over a is a pair
where, given , and
,
, called the structural part, contains a conjuction of
conditions that can be of either of the following forms:
• ;
• , for some
.
is called the belief part and contains a conjuction of
conditions involving elements in .

197
 Constraint: Example

Let , and ; we have a

constraint defined by:

and
;

If and then .

208
 Consistency

Given a finite set of constraints IC, we say that an

is consistent w.r.t. IC if it satisfies all

constraints in IC.

A news item consists of a triple , where:

(+,, f)

219
 Consistency

Given a finite set of constraints IC, we say that an

is consistent w.r.t. IC if it satisfies all

constraints in IC.

A news item consists of a triple , where:

(+,, f)

229
Related Work

10
23
 RELATED WORK

Axiomatic characterization of Pure merging operators

merging operators (integrity constraint)

Belief merging

Majority and Prioritized change and

arbitration
symmetric change

11
24
 RELATED WORK

Axiomatic characterization of Pure merging operators

merging operators (integrity constraint)

Belief merging

Majority and Prioritized change and

arbitration
symmetric change

11
25
Possible solutions using
existing operators

12
26
Example

13
27
Example

13
28
Example

13
29
 Possible Solutions Using Existing
Operators

 Iterated binary

 Pre-merge

 Post-merge

Belief merging or belief N-ary belief merging

revision operator operator
L L L L L L

14
30
 Possible Solutions Using Existing
Operators

 Iterated binary

 Pre-merge

 Post-merge

Belief merging or belief N-ary belief merging

revision operator operator
L L L L L L

14
31
 Iterated binary

Let be a function taking an , a node in the network, and

a set of news items, such that:

where is identical to except that is replaced

with .

Base case:

15
32
Iterated binary

16
33
Iterated binary

16
34
Iterated binary

16
35
Iterated binary

16
36
Iterated binary

16
37
Iterated binary

16
38
 Pre-merge
Let be a function taking an , a node in the associated
network, and a set of news items, defined as follows:

17
39
 Pre-merge
Let be a function taking an , a node in the associated
network, and a set of news items, defined as follows:

17
40
 Pre-merge
Let be a function taking an , a node in the associated
network, and a set of news items, defined as follows:

17
41
 Pre-merge
Let be a function taking an , a node in the associated
network, and a set of news items, defined as follows:

17
42
 Pre-merge
Let be a function taking an , a node in the associated
network, and a set of news items, defined as follows:

17
43
 Post-merge

Let be a function taking an , a node in the associated

network, and a set of news items, defined as:

18
44
Post-merge

18
45
Post-merge

18
46
Post-merge

18
47
Conclusions and
Future Work

19
48
 Conclusions and Future Work
 We have formalized the problem of performing belief
dynamics in a complex social network setting.

 We evaluated three possible solutions using operators from the

literature.
 We identified drawbacks in each case.

 We conclude that a new kind of operator is needed:

n-ary network-base merging operator.

20
49
 Conclusions and Future Work
 We have formalized the problem of performing belief
dynamics in a complex social network setting.

 We evaluated three possible solutions using operators from the

literature.
 We identified drawbacks in each case.

 We conclude that a new kind of operator is needed:

n-ary network-base merging operator.

20
50
 Conclusions and Future Work
 We have formalized the problem of performing belief
dynamics in a complex social network setting.

 We evaluated three possible solutions using operators from the

literature.
 We identified drawbacks in each case.

 We conclude that a new kind of operator is needed:

n-ary network-base merging operator.

20
51
 Conclusions and Future Work
 We have formalized the problem of performing belief
dynamics in a complex social network setting.

 We evaluated three possible solutions using operators from the

literature.
 We identified drawbacks in each case.

 We conclude that a new kind of operator is needed:

n-ary network-base merging operator.

20
52
21
53
22
54