On a General Notion of Transformation for Multiagent Systems and its Implementation

The focus of this contribution is on the construction of a transformation system for Multiagent Systems (MAS) based on categorical notions. Based on former work on the categorical modeling of MAS the category MAS of all Multiagent Systems is introduced. A transformation system over this category is established using the Double Pushout Approach. For illustration we present a simple example. First steps of implementational work are described

Towards a General Approach for Modeling Actions and Change in Cooperating Agents Scenarios

. The ultimate aim of this work is to find a semantics for reasoning about actions and change in cooperating agent scenarios based on the concept of so called logical fiberings. As a first step in this direction we describe a small but non-trivial 3-agent-robotics scenario using two different methods, viz. resource-oriented deductive planning and the mathematical framework of logical fiberings. By means of this scenario both methods are illustrated, compared and the correspondences between the basic notions for both methods are clarified. The fiberings method is found to be very useful in modeling communication and interaction between cooperating agents, due to the possibility to switch between a local/global point of view which is inherent to this framework. We formulate a generic modeling principle using this notion. Furthermore, possible extensions of the framework, like formulas depending on space and/or time, are discussed. 1 Introduction The objective of this work is to provide ..

Modeling Cooperating Agents Scenarios by Deductive Planning Methods and Logical Fiberings

. We describe a small but non-trivial 3-agent-robotics scenario by two different methods, viz. resource-oriented deductive planning and logical fiberings. The ultimate aim is to find a semantics for planning methods by means of fiberings. To this end, a comparison of the two methods is made and illustrated by the sample scenario, and the correspondences between the basic notions for both methods are clarified. The fiberings method is found to be useful in modeling communication and interaction between cooperating agents, thanks to the local/global distinction that is inherent to this framework. Possible extensions of the framework, like e.g. formulas dependent on space and/or time, are discussed. 1 Introduction In this paper we set out to provide a semantics for planning methods (in particular resource-oriented disjunctive planning) by logical fiberings, a concept which we have transferred from classical fiber bundle and sheaf theory. First, a scenario consisting of three robots solv..

Ciencias de la Computación / Computational Sciences On Logical Fiberings and Automated Deduction in Many-valued Logics Using Gröbner Bases

Abstract. The concept of logical fiberings is briefly summarized. Based on experiences with concrete examples an algorithmic approach is developed which leads to a represention of a many-valued logic as a logical fibering. The Stone isomorphism for expressing classical logical operations by corresponding polynomials can be extended to m-valued logics. On the basis of this, a classical deduction problem can be treated symbolically as a corresponding ideal membership problem using computer algebra support with the method of Gröbner bases. A logical fibering representation in this context provides a parallelization of the original problem and leads to (fiberwise) simpler polynomials and thus to a reduction of complexity. Dedicated to Professor Bruno Buchberger on the occasion of his 60th birthday Sobre fibrados lógicos y deducción automática en lógicas multi-valuadas usando bases de Gröbner Resumen. En este trabajo se presenta en primer lugar una explicación resumida del concepto de fibrado lógico. Basándonos en nuestra experiencia sobre ejemplos concretos, desarrollamos una aproximación algorítmica que nos lleva a representar la lógica multi-valuada como un fibrado lógico. El isomorfismo de Stone que traduce expresiones de la lógica clásica a polinomios puede extenderse a lógicas m-valuadas. Basándonos en este último hecho, problemas de deducción clásicos pueden ser tratados desde la perspectiva del problema de pertenencia a un ideal, basándonos en el álgebra computacional usando Bases de Gröbner. Una representación como fibrado lógico en este contexto proporciona un modelo paralelo al problema original y lleva a polinomios (fiberwise) más simples, y a una reducción en la complejidad. Dedicado al profesor Bruno Bucherger con motivo de su 60 cumpleaños 1