Abstract
This paper presents a formal framework in which to study the socialization processes evolving among utility-based agents. These agents are self-interested, being their different social attitudes (cooperativeness, competitiveness or indifference) a consequence of this behavior. The dynamics of the socialization process are captured by a relation that measures the similarities between the desires of two groups of agents. This similitude relation is derived from the system's model, defined as a probabilistic transition system and a set of individual preference relations. Game-theoretic concepts are used in order to determine the rational(or expected) transitions of the system. © 1998 IEEE.

Abstract
Today's dynamic industrial process simulation problems require systematically new methodologies and sophisticated computational tools. Such processes involve frequently discontinuities, environment structures changes and entities with high functional levels. Furthermore, there are cases where we must integrate intelligent techniques and negotiation protocols. These characteristics are crucial in distributed problems that require resource balance, low cost distribution plans, and stock optimization. In order to analyse the application of a distributed object-oriented simulation system we selected, as a case study, a gas distribution network in which we find all the referred characteristics. This paper presents a brief description of the simulation scenario, the overall system's structure, the intelligent negotiation protocol used by system's objects and the concurrent programming techniques to implement it.

Abstract

Abstract
This paper accompanies the demonstration of CAMILA, an experimental platform for formal software development, rooted in the tradition of constructive specification methods. The CAMILA approach is an attempt to make available at software development level the basic problem solving strategy one got used to from school physics -- create, experiment and reason on a mathematical model. Based on a notion of formal software component, it encompasses a set-theoretic language and an in equational calculus for classification and refinement. Its kernel is a functional prototyping environment, fully connectable to external applications, equipped with a classified component repository and distribution facilities. © Springer-Verlag Berlin Heidelberg 1997.

Abstract
In this paper, we study the relationship between tabulation and goal-oriented bottom-up evaluation of logic programs, Differences emerge when one tries to identify features of one evaluation method in the other. We show that to obtain the same effect as tabulation in top-down evaluation, one has to perform a careful adomment in programs to be evaluated bottom-up. Furthermore, we propose an efficient algorithm to perform forward subsumption checking over adorned magic facts. (C) Elsevier Science Inc., 1997.

Abstract
Current data abstraction mechanisms are not adequate to control sharing of state in the general case involving objects in linked structures. The pervading possibility of sharing is a source of errors and an obstacle to language implementation techniques. We present a general extension to programming languages which makes the ability to share state a first class property of a data type, resolving a long-standing flaw in existing data abstraction mechanisms. Balloon types enforce a strong form of encapsulation: no state reachable (directly or transitively) by a balloon object is referenced by any external object. Syntactic simplicity is achieved by relying on a non-trivial static analysis as the checking mechanism. Balloon types are applicable in a wide range of areas such as program transformation, memory management and distributed systems. They are the key to obtaining self-contained composite objects, truly opaque data abstractions and value types-important concepts for the development of large scale, provably correct programs. © Springer-Verlag Berhn Heidelberg 1997.