Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
Abstract. The automatic modelling tool Conjure generates CSP models from problem specifications. The generated models may contain multiple alternative (redundant) representations ...
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
This research aims at reconciling web personalization with privacy constraints imposed by legal restrictions and by users’ privacy preferences. We propose a software product line...
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...