Embed Size (px)
DESCRIPTION
Explicit / Implicit Belief Atoms. Explicit Belief Atoms of view a Expl (B X , a ) BA ( a) for each a B n if a B * \ B n then Expl (B X , a ) = for each B X. B X. Explicit / Implicit Belief Atoms. Explicit Belief Atoms of view a - PowerPoint PPT Presentation
Citation preview
Explicit Belief Atoms of view
(BX,) ( for each n
if * \n then (BX,) = for each BX
ExplicitExplicit // Implicit Belief AtomsImplicit Belief Atoms
BX
Explicit Belief Atoms of view
(BX,) ( for each n
if * \n then (BX,) = for each BX
Implicit Belief Atoms of view n
(BX,) = (\ (BX,)
if * \n then (BX,) = for each BX
ExplicitExplicit // Implicit Belief AtomsImplicit Belief Atoms
BX
BX BX
Definition: Let {} be a family of MATL languages on {}. A MAFSM = {F} is a total recursive function such that:
Fis a (set of ) Finite State Machines on the MATL language on:
and
(BX,) for each n ( * )
MultiAgent Finite State MachineMultiAgent Finite State Machine
BX
Definition: Let {} be a family of MATL languages on {}. A MAFSM = {F} is a total recursive function such that:
Fis a (set of ) Finite State Machines on the MATL language on:
and
(BX,) for each n ( * )
F
MultiAgent Finite State MachineMultiAgent Finite State Machine
BX
Definition: Let {} be a family of MATL languages on {}. A MAFSM = {F} is a total recursive function such that:
Fis a (set of ) Finite State Machines on the MATL language on: and
(BX,) for each n ( * )
F
if * \n then F=
MultiAgent Finite State MachineMultiAgent Finite State Machine
BX
Definition: Let {} be a family of MATL languages on {} and = {F} a MAFSM and a formula of :
,, f, sBXiff f’ FBX and sf reachable from J
,BX, f, s(BX, , s)
where
(BX,,s)= {| BX L(s)andBX (BX,)}
Satisfiability in a MAFSMSatisfiability in a MAFSM
Satisfiability in a MAFSMSatisfiability in a MAFSM
Definition: Let {} be a family of MATL languages on {} and = {F} a MAFSM and a formula of :
,, f, sBXiff f’ FBX and sf reachable from J
,BX, f, s(BX, , s)
where
(BX,,s)= {| BX L(s)andBX (BX,)}
Satisfiability in a MAFSMSatisfiability in a MAFSM
Definition: Let {} be a family of MATL languages on {} and = {F} a MAFSM and a formula of :
,, f, sBXiff f’ FBX and sf reachable from J
,BX, f, s(BX, , s)
where
(BX,,s)= {| BX L(s)andBX (BX,)}
,, f, sas for FSMs satisfiability
MAFSM and ConsistencyMAFSM and Consistency
BA
BABA
MAFSM and ConsistencyMAFSM and Consistency
BA
BABA
Consistent MAFSMConsistent MAFSM
Definition: A MAFSM is a consistent MAFSM if and only if for every view and every reachable state
sf (F):
ifBX(BX,andBXL(s),
then for some f FBX and reachable state s of f
,BX, f, s(BX, , s)
