Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...
In probabilistics, reasoning at optimum entropy (ME-reasoning) has proved to be a most sound and consistent method for inference. This paper investigates its properties in the fram...
We propose a computational model for analogy solving based on a topological formalism of representation. The source and the target analogs are represented as simplexes and the anal...
In this paper we describe an approach for integrating abduction and induction in the ILP setting of learning from interpretations with the aim of solving the problem of incomplete...
Abstract. Teams arise in a number of important multiagent applications. Several theories of intentions for teams have been proposed. By and large, these theories tend to model team...