Professional Documents
Culture Documents
Presentacion ASAI (JAIIO 2016) 2016 - Sin Animaciones-02 PDF
Presentacion ASAI (JAIIO 2016) 2016 - Sin Animaciones-02 PDF
SOCIAL NETWORKS
Fabio R. Gallo, Natalia Abad Santos, Gerardo I. Simari,
María V. Martínez and Marcelo A. Falappa
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.
74
Network Social Bases
L: language, P: propositional symbols, only connective is ,
: vertex/1 and edge/2 predicate symbols.
84
Network Social Bases
L: language, P: propositional symbols, only connective is ,
: vertex/1 and edge/2 predicate symbols.
94
Network Social Bases
L: language, P: propositional symbols, only connective is ,
: vertex/1 and edge/2 predicate symbols.
104
Network Social Bases
L: language, P: propositional symbols, only connective is ,
: vertex/1 and edge/2 predicate symbols.
114
Network Social Bases
L: language, P: propositional symbols, only connective is ,
: vertex/1 and edge/2 predicate symbols.
124
Network KB
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
and
;
If and then .
208
Consistency
(+,, f)
219
Consistency
(+,, f)
229
Related Work
10
23
RELATED WORK
Belief merging
11
24
RELATED WORK
Belief merging
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
14
30
Possible Solutions Using Existing
Operators
Iterated binary
Pre-merge
Post-merge
14
31
Iterated binary
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
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.
20
49
Conclusions and Future Work
We have formalized the problem of performing belief
dynamics in a complex social network setting.
20
50
Conclusions and Future Work
We have formalized the problem of performing belief
dynamics in a complex social network setting.
20
51
Conclusions and Future Work
We have formalized the problem of performing belief
dynamics in a complex social network setting.
20
52
21
53
22
54