We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...
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 ...
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...