During one step of a powerful programming, specification or query language, the same mathematical object, like a set or map or sequence, may be modified – in parallel – by different parts of the program. Such partial updates need to be efficiently checked for consistency and integrated. This is the problem of partial updates in a nutshell. In our first paper on the subject we proposed a general...

1

The Prolog program “term_expansion((define C as A with B), (C=>A:-B,!)). term_expansion((transition E if C then D), ((transition E):-C,!,B,A,(transition _))) :serialize(D,B,A). serialize((E,F),(C,D),(A,B)) :serialize(E,C,B), serialize(F,D,A). serialize(F:=G, ([G]=>*[E],F=..[C|D],D=>*B,A=..[C|B]), asserta(A=>E)). [G|H]=>*[E|F] :(G=\E; G=..[C|D],D=>*B,A=..[C|B],A=>E), !,H=>*F. []=>*[]. A=?B :[A,B...

We consider the use of evolving algebra methods of specifying grammars for natural languages. We are especially interested in distributed evolving algebras. We provide the motivation for doing this, and we give a reconstruction of some classical grammatical formalisms in directly dynamic terms. Finally, we consider some technical questions arising from the use of direct dynamism in grammatical ...

It is the aim of this paper to demonstrate that the notion of Di-algebras, introduced by T. Hagino, may be used to unify algebraic speciications of ADT's with the basic ideas of evolving algebras (E{algebras for short) which use static algebras as states of dynamic systems. The resulting speciication formalism is based on initial and terminal constraints of quasi varieties of Di{algebras. Initi...

Artificial intelligence games are a very interesting tool for teaching Artificial Intelligence techniques. Competitors write programs for agents, which are supposed to complete a given task or fight against other agents. In order to achieve the best performance, programs may have to use advanced Artificial Intelligence methods. In this paper, we present a framework to build artificial intellige...

We describe the architecture of an evolving algebra partial evaluator, a program which specializes an evolving algebra with respect to a portion of its input. We discuss the particular analysis, specialization, and optimization techniques used and show an example of its use.