Abstract
There is a collective of locally communicating agents. They believe in some facts of their world. Any agent changes their beliefs depending on the beliefs of their neighbours. Which rules are to be followed? Based on the agent analogy, this paper shows how to extract non‐logical axioms and structural features of the formal doxastic system with temporal instantiation from given inference of a formula, i.e. series of the propositions.
Subject
Computer Science (miscellaneous),Social Sciences (miscellaneous),Theoretical Computer Science,Control and Systems Engineering,Engineering (miscellaneous)
Reference17 articles.
1. Adamatzky, A. (1994), Identification of Cellular Automata, Francis & Taylor, London.
2. Adamatzky, A.I. (1993), Identification of Distributed Intelligence. Izvestia RAN. Tekhnicheskaya Kibernetika. (Proc. RAS. Technical Cybernetics)(in Russian), Vol. 5, pp. 359‐69.
3. Adamatzky, A.I. (1997), “Automatic programming of cellular automata: identification approach”, Kybernetes, Vol. 26, pp. 126‐34.
4. Adamatzky, A.I. (1998), “Master‐slave algebra: on the binary compositions of distributed beliefs”, Applied Mathematics and Computation (in press).
5. Chandy, M. and Misra, J. (1989), “How process learn”, Distributed Computing, Vol. 1, pp. 40‐52.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献