Maria del Pilar Pozos Parra

Learn More
We propose an extension of action theories to intention theories in the framework of situation calculus. Moreover the method for implementing action theories is adapted to consider the new components. The intention theories take account of the BDI (Belief-Desire-Intention) architecture. In order to avoid the computational complexity of theorem proving in(More)
The Situation Calculus has been used by Scherl and Levesque to represent beliefs and belief change without modal operators thanks to a predicate plays the role of an accessibility relation. Their approach has been extended by Shapiro et al. to support belief revision. In this extension plausibility levels are assigned to each situation, and the believed(More)
OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. Abstract. We study syntactical merging operations that are defined semantically by means of the Hamming distance between valuations; more precisely, we investigate the Σ-semantics, Gmax-semantics and max-semantics. We(More)
Model-based propositional belief merging operators are constructed from distances between the interpretations, or states, of the logic under consideration. In this paper we extend the notion of a distance between interpretations to generalised versions of propositional interpretations referred to as m-states. m-states allow for the definition of m-merging(More)
The stepsize value is one of the most sensitive parameters in the bacterial foraging optimization algorithm when solving constrained numerical optimization problems. In this paper, four stepsize control mechanisms are proposed and analyzed in the modified bacterial foraging optimization algorithm. The first one is based on a random value which remains fixed(More)
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators have been proposed which use distance measures and aggregation functions. This paper introduces the notion of Partial Satisfiability which is an alternative way of measuring the(More)
—A review of the bacterial foraging optimization algorithm used to solve numerical constrained optimization problems is presented in this paper. After an introduction to the algorithm and its main elements, a taxonomy of constraint-handling techniques is presented and adopted to discuss the different approaches based on the algorithm. Aspects related to the(More)