Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...
The Transferable Belief Model is a powerful interpretation of belief function theory where decision making is based on the pignistic transform. Smets has proposed a generalization ...
Conventional information fusion architectures are challenged by developments in sensor networks that allow individually-owned (and thereby selfish) sensors to interact and share d...
Alex Rogers, Rajdeep K. Dash, Nicholas R. Jennings...
: Argumentation theory is often used in multi agent-systems to facilitate autonomous agent reasoning and multi-agent interaction. The technology can also be used to develop online ...