Belief Revision in the GOAL Agent Programming Language

Algorithm 1

Contraction by belief 𝐴.

for all  𝑗=(𝐵,𝑠)∈𝑑𝑒𝑝𝑒𝑛𝑑𝑒𝑛𝑐𝑖𝑒𝑠(𝐴)  do

 remove(𝑗)

end for

for all  𝑗=(𝐴,𝑠)∈𝑗𝑢𝑠𝑡𝑖𝑓𝑖𝑐𝑎𝑡𝑖𝑜𝑛𝑠(𝐴)  do

 if  𝑠=[]  then

   𝑟𝑒𝑚𝑜𝑣𝑒(𝑗)

 else

   𝑐𝑜𝑛𝑡𝑟𝑎𝑐𝑡(𝑤(𝑠))

 end if

end for

𝑟𝑒𝑚𝑜𝑣𝑒(𝐴)