Abstract Concurrent Constraint Programming (CCP) has been used over the last two
decades as an elegant and expressive model for concurrent systems. It models systems of …

In a similar way as 2-categories can be regarded as a special case of double categories,
rewriting logic (in the unconditional case) can be embedded into the more general tile logic …

Distributed Problem Solving (DPS) approaches decompose problems into subproblems to
be solved by interacting, cooperative software agents. Thus, DPS is suitable for solving …

Declarative programming languages base on the idea that programs should be as close as
possible to the problem specification and domain. Programs of these languages usually …

Abstract Distributed Problem Solving (DPS) decomposes problems into subproblems to be
solved by interacting, cooperative software agents. Thus, DPS is suitable for modeling, in the …

Process calculi treat concurrent processes much like the λ-calculus treat computable
functions. They provide a language in which the structure of terms represents the structure of …

We present a comparison of two new approaches for solving constraints occurring in spatial
inference. In contrast to qualitative spatial reasoning we use a metric description, where …

Constraint programming and techniques of constraint satisfaction are areas of active
research in several disciplines of Computer Science: logic programming, artificial …

This paper describes the basic elements (data, actions, tunings, voids, mixtures,...) and
principles of programming (strati cation, implicit knowledge, limited freedom,...), directed to …

Natural Language is not only the most important means of communication between human
beings, it is also used over historical periods for the preservation of cultural achievements …