Approach to solving DCSP using BDI

BDI is an agent who works based on three basic attitudes: beliefs, desires and intentions. Is presented in this paper the development of a multiagent system based on BDI agents or intentional agents to solve problems of satisfaction of typical restrictions, using the algorithm "Asynchronous Backtracking. The problem is distributed on several agents working together to find a solution. Is shown part of the system design, through development methodology oriented to AAII agents, and the application of the above by implementing two such problems: N-Queens and Sudoku, the results obtained from experiments and conclusions based on this.