This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...
This paper presents a quantitative evaluation of the portability to the stock market domain of the revision rule hierarchy used by the system STREAKto incrementally generate newsw...
Abstract. The Transferable Belief Model (TBM) relies on belief functions and enables one to represent and combine a variety of knowledge from certain up to ignorance as well as con...
Conventional approaches to the modeling of autonomous agents and agent communication rely heavily on the ascription of mental properties like beliefs and intentions to the individ...
Matthias Nickles, Felix A. Fischer, Gerhard Wei&sz...
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...